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

arXiv:2004.10312 · Entropy

Lottery and Auction on Quantum Blockchain

Xin Sun, Piotr Kulicki, Mirek Sopek

Published Dec 5, 2020• 18 citations
arXivHTMLPDF

Abstract

This paper proposes a protocol for lottery and a protocol for auction on quantum Blockchain. Our protocol of lottery satisfies randomness, unpredictability, unforgeability, verifiability, decentralization and unconditional security. Our protocol of auction satisfies bid privacy, posterior privacy, bids' binding, decentralization and unconditional security. Except quantum Blockchain, the main technique involved in both protocols is quantum bit commitment.

DOI
10.3390/e22121377

Related papers

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

Anonymous Quantum Sealed-Bid Auction

Runhua Shi

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.

IEEE Transactions on Circuits & Systems II Express Briefs•Jul 20, 2021•16 citations

A Simple Voting Protocol on Quantum Blockchain

Xin Sun, Quanlong Wang, Piotr Kulicki +1 more

This paper proposes a simple voting protocol based on Quantum Blockchain. Despite its simplicity, our protocol satisfies the most important properties of secure voting protocols: is anonymous, binding, non-reusable, verifiable, eligible, fair and self-tallying. The protocol could also be implemented using presently available technology.

arXiv:1805.11979•International Journal of Theoretical Physics•Oct 18, 2018•76 citations

QUANTUM AUCTIONS

Tad Hogg, Pavithra Harsha, Kay‐Yut Chen

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition. Thus, non-winning bids are never revealed. Participants can use entanglement to arrange for correlations among their bids, with the assurance that this entanglement is not observable by others. This protocol is useful for information hiding applications, such as partnership bidding with allocative externality or concerns about revealing bidding preferences. The protocol applies to a variety of auction types, e.g. first or second price, and to auctions involving either a single item or arbitrary bundles of items (i.e. combinatorial auctions). We analyze the game-theoretical behavior of the quantum protocol for the simple case of a sealed-bid quantum, and show how a suitably designed adiabatic search reduces the possibilities for bidders to game the auction. This design illustrates how incentive rather that computational constraints affect quantum algorithm choices.

arXiv:0704.0800•International Journal of Quantum Information•Oct 1, 2007•42 citations

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•13 citations
This paper proposes a protocol for lottery and a protocol for auction on quantum Blockchain. Our protocol of lottery satisfies randomness, unpredictability, unforgeability, verifiability, decentralization and unconditional security. Our protocol of auction satisfies bid privacy, posterior privacy, bids' binding, decentralization and unconditional security. Except quantum Blockchain, the main technique involved in both protocols is quantum bit commitment.
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.
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.
We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition. Thus, non-winning bids are never revealed. Participants can use entanglement to arrange for correlations among their bids, with the assurance that this entanglement is not observable by others. This protocol is useful for information hiding applications, such as partnership bidding with allocative externality or concerns about revealing bidding preferences. The protocol applies to a variety of auction types, e.g. first or second price, and to auctions involving either a single item or arbitrary bundles of items (i.e. combinatorial auctions). We analyze the game-theoretical behavior of the quantum protocol for the simple case of a sealed-bid quantum, and show how a suitably designed adiabatic search reduces the possibilities for bidders to game the auction. This design illustrates how incentive rather that computational constraints affect quantum algorithm choices.
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.