An economic and feasible Quantum Sealed-bid Auction protocol

Zhang, Rui; Shi, Ronghua; Qin, Jia-qi; Peng, Zhen-wan

doi:10.1007/s11128-017-1805-6

Cited by 19 publications

(12 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently, in order to enhance the security of QSA or ensure the feasibility of QSA, many quantum protocols with post-confirmation were proposed 27–33 . In 2017, we presented an economic and feasible quantum sealed-bid auction protocol based on single photons in both the polarization and the spatial-mode degrees of freedom 34 . In our protocol, the post-confirmation mechanism uses single photons instead of entangled EPR pairs, and it does not require quantum memory.…”

Section: Related Workmentioning

confidence: 99%

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

Shi

Zhang

2019

Sci Rep

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

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

Shi

Zhang

2019

Sci Rep

Self Cite

View full text Add to dashboard Cite

show abstract

“…WJ Jung et al [7] focused on studying customer engagement using contest based social media marketing. R Zhang et al [8] proposed a quantum system ensuring security in sealed-bid auction. G E Kersten et al [9] performed a comparative study on auctions and negotiations and then suggested that social effect become much dominant over competitive nature when transparency is provided.…”

Section: Related Workmentioning

confidence: 99%

Addictive Auctions: using lucky-draw and gambling addiction to increase participation during auctioning

Kumar¹

2019

Preprint

View full text Add to dashboard Cite

Auction theories are believed to provide a better selling opportunity for the resources to be allocated. Various organizations have taken measures to increase trust among participants towards their auction system, but trust alone cannot ensure a high level of participation. We propose a new type of auction system which takes advantage of lucky draw and gambling addictions to increase the engagement level of candidates in an auction. Our system makes use of security features present in existing auction systems for ensuring fairness and maintaining trust among participants.

show abstract

“…Sharma et al [27] presented a novel collusion attack-free quantum sealed-bid auction protocol by dividing all bidders into disjoint subgroups, in which each bidder sends his bid to the auctioneer in a circular manner but he also needs share his bid with the remaining bidders to achieve the honesty. In 2018, Zhang et al [28] presented a feasible quantum sealed-bid auction protocol based on single photons in both the polarization and the spatial-mode degrees of freedom, in which the post-confirmation mechanism uses single photons instead of entangled EPR pairs, and it does not require quantum memory. In 2019, Shi et al [3] proposed a secure quantum sealed-bid auction protocol based on Grover's search algorithm to protect the privacy of non-winning bidders (i.e., losing bidders).…”

Section: Introductionmentioning

confidence: 99%

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Shi

2022

IEEE Trans. Quantum Eng.

Self Cite

View full text Add to dashboard Cite

We first define a primitive problem of secure multiparty computations, i.e., Secure Multiparty Disjunction (SMD), and present a novel quantum protocol for SMD, which can ensure the information-theoretical security, i.e., the 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 non-winning bidders. 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.

show abstract

An economic and feasible Quantum Sealed-bid Auction protocol

Cited by 19 publications

References 35 publications

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

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

Addictive Auctions: using lucky-draw and gambling addiction to increase participation during auctioning

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Contact Info

Product

Resources

About