A Linkable Anonymous and Verifiable Sealed-Bid Auction Scheme for Consortium Blockchain
- 1Computer Science College, Beijing Information Science and Technology University, Beijing 100192, China
- 2Beijing Venustech Cybervision Co., Ltd., Beijing 100193, China
Abstract
Sealed-bid auctions require bidders to submit concealed bids within a prescribed bidding period, after which the bids are opened and compared to determine the highest bidder. However, existing auction systems still face challenges in protecting bidder privacy and bid data, verifying auction results, and reducing dependence on centralized auctioneers. This paper proposes LAV-Auction, a linkable anonymous and verifiable sealed-bid auction scheme for consortium blockchain. A registration authority publishes a ring of eligible public keys. Each bidder submits a commitment, a bid ciphertext containing the bid value and commitment randomness, and an auction-scoped linkable ring signature. The signature hides which registered key was used, while its key image enables the contract to reject repeated bids from the same credential in the same auction. After the contract fixes the accepted record order, the auction committee decrypts the bid ciphertexts. A verifier recomputes the digest of the frozen ledger records. It then verifies a Groth16 proof showing that the announced winner corresponds to a valid frozen bid with the highest value. LAV-Auction provides bidder anonymity, bid confidentiality before committee decryption, duplicate bid prevention, and verifiable winner correctness over the frozen valid bid set. Experiments on a Hyperledger Fabric implementation demonstrate practical computation, communication, and scalability trade-offs. The results show that LAV-Auction achieves millisecond-level result verification through succinct Groth16 proofs while maintaining compact result certification payloads under increasing bidder scales.
Related
- S2F-Agent: Harnessing sequence-to-function models for verifiable genome interpretation
- Foliar application of microbial consortium formulations suppresses Phomopsis leaf blight, promotes vegetative growth, and modulates biochemical defence in strawberry (Fragaria × ananassa Duch. cv. Camarosa) under protected cultivation
- Mangrove-Derived Halotolerant Endophytic Bacteria Confer Strain-Specific and Consortium-Mediated Salt Tolerance in Peanut (Arachis hypogaea L.)
- A defined multi-kingdom microbial consortium naturalizes the immune system of laboratory mice
- Tracing genome size dynamics in sharks and rays with inclusive sequence analysis by the Squalomix Consortium
BibTeX
@article{jia2026linkable,
title = {{A Linkable Anonymous and Verifiable Sealed-Bid Auction Scheme for Consortium Blockchain}},
author = {Jing Jia and Suwen Zhang and Wenbao Jiang},
journal = {Applied Sciences},
year = {2026},
month = oct,
doi = {10.3390/app162010017},
url = {https://doi.org/10.3390/app162010017},
note = {CC BY},
}
RIS
TY - JOUR
TI - A Linkable Anonymous and Verifiable Sealed-Bid Auction Scheme for Consortium Blockchain
AU - Jing Jia
AU - Suwen Zhang
AU - Wenbao Jiang
PY - 2026
DA - 2026/10/26
JO - Applied Sciences
DO - 10.3390/app162010017
UR - https://doi.org/10.3390/app162010017
AB - Sealed-bid auctions require bidders to submit concealed bids within a prescribed bidding period, after which the bids are opened and compared to determine the highest bidder. However, existing auction systems still face challenges in protecting bidder privacy and bid data, verifying auction results, and reducing dependence on centralized auctioneers. This paper proposes LAV-Auction, a linkable anonymous and verifiable sealed-bid auction scheme for consortium blockchain. A registration authority publishes a ring of eligible public keys. Each bidder submits a commitment, a bid ciphertext containing the bid value and commitment randomness, and an auction-scoped linkable ring signature. The signature hides which registered key was used, while its key image enables the contract to reject repeated bids from the same credential in the same auction. After the contract fixes the accepted record order, the auction committee decrypts the bid ciphertexts. A verifier recomputes the digest of the frozen ledger records. It then verifies a Groth16 proof showing that the announced winner corresponds to a valid frozen bid with the highest value. LAV-Auction provides bidder anonymity, bid confidentiality before committee decryption, duplicate bid prevention, and verifiable winner correctness over the frozen valid bid set. Experiments on a Hyperledger Fabric implementation demonstrate practical computation, communication, and scalability trade-offs. The results show that LAV-Auction achieves millisecond-level result verification through succinct Groth16 proofs while maintaining compact result certification payloads under increasing bidder scales.
SN - 2076-3417
ER -