Quantum Sealed-bid Auction Protocol Research Articles

A New Quantum Sealed-Bid Auction Protocol with a Set of Local Indistinguishable Orthogonal Product States

Quantum sealed-bid auction (QSA) is a special form of transaction with significant applications in the economic and financial fields. Using a unique set of locally indistinguishable orthogonal product (LIOP) states, we propose a new QSA protocol in this paper. In the protocol, the bid message is encoded as a quantum sequence of LIOP states, and the different particles of LIOP states are transmitted separately. Even though an attacker obtains a portion of the particles, they cannot recover the entire bid message because of the local indistinguishability of LIOP states. Once the auctioneer announces the winner’s bid, all bidders are able to confirm the authenticity of their bid. With the help of a semi-honest third party, collusion between the auctioneer and a malicious bidder can be discovered. Finally, our protocol is capable of meeting all requirements for secure sealed-bid auctions through security and completeness analysis. Additionally, the proposed protocol does not require any entangled resources and complicated operations, so it can be easily implemented in practice.

Quantum sealed-bid auction protocol based on quantum secret sharing

Quantum sealed-bid auction protocol based on quantum secret sharing

A secure quantum sealed-bid auction protocol based on quantum public key encryption

A secure quantum sealed-bid auction protocol based on quantum public key encryption

Quantum sealed-bid auction protocol for simultaneous ascending auction with GHZ states

Quantum sealed-bid auction protocol for simultaneous ascending auction with GHZ states

Quantum Sealed-Bid Auction Protocol Based on Semi-honest Model

In view of the possible disclosure of personal information in the quantum auction protocol, by using the correlation between entangled particles and quantum teleportation, we propose a secure quantum sealed-bid auction (QSBA) protocol based on semi-honest model. In this protocol, by introducing a trusted third party Trent, we separate the registration operation of users from the business function of auction center. Bidders and the auction center can realize quantum identity authentication without information disclosure, so as to reduce the risk of the auction center disclosing the personal information of bidders. With the help of Trent, using the quantum sequences to be the information carrier of bidding, the auction center and bidders can conduct quantum teleportation to obtain each bidding price. When the auction center publishes the bid price and serial number, the registration center also publishes the corresponding winning bidder. Through security analysis, our protocol can guarantee the anonymity of bidders and the integrity of bidding information.

A Quantum Sealed Auction Protocol Based on Secret Sharing

In this paper, a novel multiparty quantum sealed-bid auction protocol based on secret sharing is proposed. We present a novel post-confirmation mechanism without quantum entanglement, in which only k(k ≤ n) bidders can verify the truth of the bid to guarantee the fairness and the security of the auction. In addition, compared with those protocols based on the entangled states, the proposed protocol is more flexible and feasible within present technologies, since it uses the single photons as the message carrier of the bids and no one needs to store the photons.

An economic and feasible Quantum Sealed-bid Auction protocol

We present an economic and feasible Quantum Sealed-bid Auction protocol using quantum secure direct communication based on single photons in both the polarization and the spatial-mode degrees of freedom, where each single photon can carry two bits of classical information. Compared with previous protocols, our protocol has higher efficiency. In addition, we propose a secure post-confirmation mechanism without quantum entanglement to guarantee the security and the fairness of the auction.

Quantum sealed-bid auction using a modified scheme for multiparty circular quantum key agreement

A feasible, secure and collusion-attack-free quantum sealed-bid auction protocol is proposed using a modified scheme for multi-party circular quantum key agreement. In the proposed protocol, the set of all ($n$) bidders is grouped in to $l$ subsets (sub-circles) in such a way that only the initiator (who prepares the quantum state to be distributed for a particular round of communication and acts as the receiver in that round) is a member of all the subsets (sub-circles) prepared for a particular round, while any other bidder is part of only a single subset. All $n$ bidders and auctioneer initiate one round of communication, and each of them prepares $l$ copies of a $\left(r-1\right)$-partite entangled state (one for each sub-circle), where $r=\frac{n}{l}+1$. The efficiency and security\textcolor{blue}{{} }of the proposed protocol are critically analyzed. It is shown that the proposed protocol is free from the collusion attacks that are possible on the existing schemes of quantum sealed-bid auction. Further, it is observed that the security against collusion attack increases with the increase in $l$, but that reduces the complexity (number of entangled qubits in each entangled state) of the entangled states to be used and that makes the scheme scalable and implementable with the available technologies. The additional security and scalability is shown to arise due to the use of a circular structure in place of a complete-graph or tree-type structure used earlier.

Multiparty quantum sealed-bid auction using single photons as message carrier

In this study, a novel multiparty quantum sealed-bid auction protocol using the single photons as the message carrier of bids is proposed, followed by an example of three-party auction. Compared with those protocols based on the entangled states (GHZ state, EPR pairs, etc.), the present protocol is more economic and feasible within present technology. In order to guarantee the security and the fairness of the auction, the decoy photon checking technique and an improved post-confirmation mechanism with EPR pairs are introduced respectively.

A new quantum sealed-bid auction protocol with secret order in post-confirmation

A new security protocol for quantum sealed-bid auction is proposed to resist the collusion attack from some malicious bidders. The most significant feature of this protocol is that bidders prepare their particles with secret order in post-confirmation for encoding bids. In addition, a new theorem and its proof are given based on the theory of combinatorial mathematics, which can be used as evaluation criteria for the collusion attack. It is shown that the new protocol is immune to the collusion attack and meets the demand for a secure auction. Compared with those previous protocols, the security, efficiency and availability of the proposed protocol are largely improved.

Comment on "Cryptanalysis and improvement of the secure quantum sealed-bid auction with post confirmation"

In a recent paper, an improvement of quantum sealed-bid auction protocol is proposed by introducing hash function. However, in this comment, it is shown that the improvement brings in other problems which would not complete the task of a sealed-bid auction fairly.

Attacks and Improvement of Quantum Sealed-Bid Auction with EPR Pairs

Recently, an experimentally feasible three-party quantum sealed-bid auction protocol based on EPR pairs [Z.Y. Wang, Commun. Theor. Phys. 54 (2010) 997] was proposed. However, this study points out Wang's protocol cannot resist some internal bidders' attacks, such as the Twice-CNOT attack, the collusion attack. A malicious bidder can launch the Twice-CNOT attack to obtain the other's bid, or the dishonest auctioneer may collude with one bidder and help him/her win the action by changing his/her bid. For preventing against these attacks, a simple solution by using the QKD-based message encryption and a post-confirmation mechanism by adopting the hash function are proposed.

Cryptanalysis and melioration of secure quantum sealed-bid auction with post-confirmation

We investigate the quantum sealed-bid auction protocol proposed by Zhao et al. (Opt Commun 283:1394, 2010). It uses M groups n-particle GHZ states to represent bids and a post-confirmation mechanism to guarantee the honesty of the quantum sealed-bid auction. However, in our opinion the protocol still does not complete the task of a sealed-bid auction fairly. It is shown that a large group of dishonest bidders can collude to obtain all the other one's secret bids before the opening phase of the auction with a probability polynomially close to one. Moreover, a simple feasible improvement of the protocol is proposed.

REVISITING NASERI'S SECURE QUANTUM SEALED-BID AUCTION

The secure quantum sealed-bid auction protocol [Mosayeb Naseri, Opt. Commun.282 (2009) 1939] is revisited. It is found that, utilizing intercept-measure-resend attacks, any evil bidder can make the auction aborted without being detected by the auctioneer. Further, if the evil bidder succeeds to be the first bidder, then he/she can win conclusively in the auction. To prevent such attacks, some defence strategies are adopted in the qubit distribution stage and the channel security check stage respectively and the original protocol is therefore modified somewhat.

Comment on: “Secure quantum sealed-bid auction” [Opt. Comm. 282 (2009) 1939

In a recent paper [Opt. Comm. 282 (2009) 1939], a quantum sealed-bid auction protocol was proposed. However, in this comment, it is shown that the protocol does not complete the task of a sealed-bid auction fairly when any bidder colludes with the auctioneer.

Improved secure quantum sealed-bid auction

The security of a secure quantum sealed-bid auction protocol using quantum secure direct communication based on GHZ states [M. Naseri, Opt. Commun. 282 (2009) 1939] is reexamined. It is shown that the protocol does not complete the task of a sealed-bid auction fairly. It is shown that a dishonest bidder can obtain all the other one’s secret bids by two special types of attack, i.e., double Controlled NOT attack or using fake entangled particles. Furthermore, a simple possible improvement of the protocol is proposed.

Cryptanalysis and improvement of a secure quantum sealed-bid auction

The security of a secure quantum sealed-bid auction protocol using quantum secure direct communication [Mosayeb Naseri, Opt. Commun. 282 (2009) 1939] is analyzed. It is shown that this protocol is unfair as a malicious bidder can obtain others’ bids without being found, and then he can optimize his bid to win the auction. Finally, a simple improvement to resist this attack is proposed.

Secure quantum sealed-bid auction

A new experimentally feasible and secure quantum sealed-bid auction protocol using quantum secure direct communication based on GHZ states is proposed. In this scheme all bidders Bob, Charlie,…, and Zach use M groups n-particle GHZ states to represent their bids. Here, an auctioneer gives the auction outcome by performing a sequence of n-particle GHZ-basis measurements on the final quantum states. It has been shown that using this method guarantees the honesty of the protocol, and malicious bidders can not collude with the auctioneers.