Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Circuits & Systems II Express Briefs

Anonymous Quantum Sealed-Bid Auction

Runhua Shi

Published Jul 20, 2021• 16 citations
Publisher

Abstract

In this brief, we present a novel quantum protocol for sealed-bid auction and design the corresponding quantum circuits. In the proposed protocol, we introduce two auctioneers to ensure that they can supervise each other, where one is a classical auctioneer, and the other is a quantum auctioneer. Furthermore, we turn sealed-bid auction into secure multiparty summation by employing the Chinese Remainder Theorem to achieve the anonymity. Compared with the related protocols, the proposed protocol can meet more security properties, e.g., anonymity, fairness, verifiability, secrecy and non-repudiation.

DOI
10.1109/tcsii.2021.3098755

Related papers

Quantum Sealed-Bid Auction Without a Trusted Third Party

Runhua Shi

A sealed-bid auction is an essential tool for trading commodities in modern society. However, the non-winning bidders in previously proposed sealed-bid auction schemes lack privacy protection. In this paper, we define a sealed-bid auction with strong privacy protection, which can protect the privacy of all non-winning bidders. In order to fulfil the task, we first present a quantum secret sharing protocol and a secure quantum summation protocol and then design their corresponding quantum circuits, where the security of the latter is guaranteed by the former, while the former is information-theoretically secure. We further present a quantum seal-bid auction (QSA) scheme with strong privacy protection based on the designed quantum protocols. In our QSA scheme, each bidder first encodes a private vector by his private bid and public agreement information, and then all bidders jointly compute the summations of their respective private vectors without a trusted third party. Finally, we verify the correctness and the feasibility of the proposed QSA scheme by circuit simulations in IBM Qiskit.

IEEE Transactions on Circuits and Systems I Regular Papers•Aug 13, 2021•28 citations

Measurement-Based Quantum Sealed-Bid Auction

Chong-Qiang Ye, Jian Li, Xiu‐Bo Chen +2 more

Quantum sealed-bid auction (QSA) is expected to provide an alternative to classical sealed-bid auction to defend against attacks from quantum adversaries. However, most previous QSA protocols required bidders to have quantum operation capabilities, resulting in excessive quantum resource requirements. To relieve the burden of protocol quantum resources, a measurement-based quantum sealed-bid auction protocol with the one-way transmission is proposed. Compared to previous protocols, our protocol only requires bidders to perform measurements, and no other operations, such as Pauli or Phase operations, are required. In order to verify the correctness and feasibility of the proposed QSA protocol, the corresponding quantum circuits are designed and simulated by IBM Qiskit. The proposed protocol satisfies security properties, including anonymity, fairness, verifiability, privacy, and non-repudiation. In addition, we further extend the protocol to scenarios that do not require an auctioneer and achieve bid privacy protection for unsuccessful bidders. Therefore, our protocol may have broad applications in auction scenarios.

IEEE Transactions on Circuits and Systems I Regular Papers•Oct 5, 2023•12 citations

On the generic structures of the protocols for quantum auction and quantum summation and their relation

Kabir Sandhu, Sandeep Mishra, Anirban Pathak

Secure multi-party computation (SMC) addresses the problem of jointly computing global functions of private inputs while revealing minimal information about individual data. Two prominent examples of SMC tasks are sealed-bid auction and secure multi-party summation. Existing schemes for quantum auction and quantum summation have largely been developed independently, motivated by distinct applications and employing different computational primitives. In this work, mutual reductions between the two tasks are established for single-item sealed-bid auctions with first-price payment. In one direction, an auction used as a black box computes a secure sum: each party bids a private random key drawn from its input, so the clearing price depends on the inputs only through their sum $S$. The reduction is perfectly private against colluding semi-honest parties and uses $O(S^2\log(1/δ))$ auction rounds, which is optimal, or $O(S\log(1/δ))$ under coherent access. It can be instantiated with an existing auctioneer-free quantum auction after a one-line change to its disjunction subroutine, which as published leaks occupancy counts. In the other direction, summation with randomized inputs yields threshold disjunctions, and a single search over composite keys locates the highest bid and a winner, revealing nothing else. Because each query consumes the bidders' encodings, a bidder can adapt its effective bid undetected, while a fixed query set restores sealed bidding. Combinatorial auctions and general payment rules lie outside this framework. On a superconducting processor, one instance of each direction is executed, recovering the winner for four-bidder instances with ties and the sum of private inputs from repeated auctions.

quant-pharXiv:2606.27693•Jun 29, 2026•0 citations

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Runhua Shi, Yifei Li

In this article, we first define a primitive problem of secure multiparty computations, i.e., secure multiparty disjunction (SMD), and present a novel quantum protocol for SMD that can ensure information-theoretical security, i.e., unconditional security. Furthermore, based on the quantum SMD protocol, we design a quantum sealed-bid auction (QSA) scheme without an auctioneer. In the proposed QSA scheme, all bidders can jointly find the winning bidder without the help of an auctioneer while it can perfectly protect the privacy of nonwinning bidders. The proposed quantum SMD protocol and quantum QSA scheme take Bell states as quantum resources and only perform single-particle Pauli operators and two-particle Bell measurements. Finally, we simulate the related quantum protocols in Qiskit and verify the correctness and the feasibility of the proposed protocols.

IEEE Transactions on Quantum Engineering•Jan 1, 2022•17 citations

Privacy-preserving Quantum Sealed-bid Auction Based on Grover’s Search Algorithm

Runhua Shi, Mingwu Zhang

Sealed-bid auction is an important tool in modern economic especially concerned with networks. However, the bidders still lack the privacy protection in previously proposed sealed-bid auction schemes. In this paper, we focus on how to further protect the privacy of the bidders, especially the non-winning bidders. We first give a new privacy-preserving model of sealed-bid auction and then present a quantum sealed-bid auction scheme with stronger privacy protection. Our proposed scheme takes a general state in N-dimensional Hilbert space as the message carrier, in which each bidder privately marks his bid in an anonymous way, and further utilizes Grover's search algorithm to find the current highest bid. By O(lnn) iterations, it can get the highest bid finally. Compared with any classical scheme in theory, our proposed quantum scheme gets the lower communication complexity.

Scientific Reports•May 20, 2019•55 citations

Semi‐Quantum Secure Multiparty Summation and its Applications to Anonymous Auction and Ranking

Chong‐Qiang Ye, J. Li, Xiu‐Bo Chen +4 more

Abstract Semi‐quantum secure summation allows multiple parties with limited quantum capabilities to perform collective calculations under the premise of protecting privacy. However, current approaches are confined to low‐dimensional quantum states as information carriers and are restricted to scenarios involving two or three parties. This limitation hinders their universality and ability to fulfill the requirements of practical secure multiparty computations. To address these challenges, a novel semi‐quantum secure multiparty summation (SQSMS) protocol is proposed based on high‐dimensional entangled states and single‐particle states. The protocol leverages the entanglement correlation to guarantee the security of the transmission, enabling resistance against various potential attacks. Then, by utilizing the IBM Qiskit platform, corresponding quantum circuits and simulation results are presented to validate the feasibility and correctness of the protocol. Furthermore, building upon the foundation of the SQSMS protocol, semi‐quantum anonymous auction and anonymous ranking protocols are further constructed. Compared with previous approaches, the designed protocols cater to the requirements of their respective counterparts. Consequently, the approach may have broad applications in semi‐quantum secure multiparty computation scenarios.

Advanced Quantum Technologies•Jan 8, 2024•14 citations
In this brief, we present a novel quantum protocol for sealed-bid auction and design the corresponding quantum circuits. In the proposed protocol, we introduce two auctioneers to ensure that they can supervise each other, where one is a classical auctioneer, and the other is a quantum auctioneer. Furthermore, we turn sealed-bid auction into secure multiparty summation by employing the Chinese Remainder Theorem to achieve the anonymity. Compared with the related protocols, the proposed protocol can meet more security properties, e.g., anonymity, fairness, verifiability, secrecy and non-repudiation.
A sealed-bid auction is an essential tool for trading commodities in modern society. However, the non-winning bidders in previously proposed sealed-bid auction schemes lack privacy protection. In this paper, we define a sealed-bid auction with strong privacy protection, which can protect the privacy of all non-winning bidders. In order to fulfil the task, we first present a quantum secret sharing protocol and a secure quantum summation protocol and then design their corresponding quantum circuits, where the security of the latter is guaranteed by the former, while the former is information-theoretically secure. We further present a quantum seal-bid auction (QSA) scheme with strong privacy protection based on the designed quantum protocols. In our QSA scheme, each bidder first encodes a private vector by his private bid and public agreement information, and then all bidders jointly compute the summations of their respective private vectors without a trusted third party. Finally, we verify the correctness and the feasibility of the proposed QSA scheme by circuit simulations in IBM Qiskit.
Quantum sealed-bid auction (QSA) is expected to provide an alternative to classical sealed-bid auction to defend against attacks from quantum adversaries. However, most previous QSA protocols required bidders to have quantum operation capabilities, resulting in excessive quantum resource requirements. To relieve the burden of protocol quantum resources, a measurement-based quantum sealed-bid auction protocol with the one-way transmission is proposed. Compared to previous protocols, our protocol only requires bidders to perform measurements, and no other operations, such as Pauli or Phase operations, are required. In order to verify the correctness and feasibility of the proposed QSA protocol, the corresponding quantum circuits are designed and simulated by IBM Qiskit. The proposed protocol satisfies security properties, including anonymity, fairness, verifiability, privacy, and non-repudiation. In addition, we further extend the protocol to scenarios that do not require an auctioneer and achieve bid privacy protection for unsuccessful bidders. Therefore, our protocol may have broad applications in auction scenarios.
Secure multi-party computation (SMC) addresses the problem of jointly computing global functions of private inputs while revealing minimal information about individual data. Two prominent examples of SMC tasks are sealed-bid auction and secure multi-party summation. Existing schemes for quantum auction and quantum summation have largely been developed independently, motivated by distinct applications and employing different computational primitives. In this work, mutual reductions between the two tasks are established for single-item sealed-bid auctions with first-price payment. In one direction, an auction used as a black box computes a secure sum: each party bids a private random key drawn from its input, so the clearing price depends on the inputs only through their sum SSS. The reduction is perfectly private against colluding semi-honest parties and uses O(S2log⁡(1/δ))O(S^2\log(1/δ))O(S2log(1/δ)) auction rounds, which is optimal, or O(Slog⁡(1/δ))O(S\log(1/δ))O(Slog(1/δ)) under coherent access. It can be instantiated with an existing auctioneer-free quantum auction after a one-line change to its disjunction subroutine, which as published leaks occupancy counts. In the other direction, summation with randomized inputs yields threshold disjunctions, and a single search over composite keys locates the highest bid and a winner, revealing nothing else. Because each query consumes the bidders' encodings, a bidder can adapt its effective bid undetected, while a fixed query set restores sealed bidding. Combinatorial auctions and general payment rules lie outside this framework. On a superconducting processor, one instance of each direction is executed, recovering the winner for four-bidder instances with ties and the sum of private inputs from repeated auctions.
In this article, we first define a primitive problem of secure multiparty computations, i.e., secure multiparty disjunction (SMD), and present a novel quantum protocol for SMD that can ensure information-theoretical security, i.e., unconditional security. Furthermore, based on the quantum SMD protocol, we design a quantum sealed-bid auction (QSA) scheme without an auctioneer. In the proposed QSA scheme, all bidders can jointly find the winning bidder without the help of an auctioneer while it can perfectly protect the privacy of nonwinning bidders. The proposed quantum SMD protocol and quantum QSA scheme take Bell states as quantum resources and only perform single-particle Pauli operators and two-particle Bell measurements. Finally, we simulate the related quantum protocols in Qiskit and verify the correctness and the feasibility of the proposed protocols.
Sealed-bid auction is an important tool in modern economic especially concerned with networks. However, the bidders still lack the privacy protection in previously proposed sealed-bid auction schemes. In this paper, we focus on how to further protect the privacy of the bidders, especially the non-winning bidders. We first give a new privacy-preserving model of sealed-bid auction and then present a quantum sealed-bid auction scheme with stronger privacy protection. Our proposed scheme takes a general state in N-dimensional Hilbert space as the message carrier, in which each bidder privately marks his bid in an anonymous way, and further utilizes Grover's search algorithm to find the current highest bid. By O(lnn) iterations, it can get the highest bid finally. Compared with any classical scheme in theory, our proposed quantum scheme gets the lower communication complexity.
Abstract Semi‐quantum secure summation allows multiple parties with limited quantum capabilities to perform collective calculations under the premise of protecting privacy. However, current approaches are confined to low‐dimensional quantum states as information carriers and are restricted to scenarios involving two or three parties. This limitation hinders their universality and ability to fulfill the requirements of practical secure multiparty computations. To address these challenges, a novel semi‐quantum secure multiparty summation (SQSMS) protocol is proposed based on high‐dimensional entangled states and single‐particle states. The protocol leverages the entanglement correlation to guarantee the security of the transmission, enabling resistance against various potential attacks. Then, by utilizing the IBM Qiskit platform, corresponding quantum circuits and simulation results are presented to validate the feasibility and correctness of the protocol. Furthermore, building upon the foundation of the SQSMS protocol, semi‐quantum anonymous auction and anonymous ranking protocols are further constructed. Compared with previous approaches, the designed protocols cater to the requirements of their respective counterparts. Consequently, the approach may have broad applications in semi‐quantum secure multiparty computation scenarios.