Privacy-preserving Quantum Sealed-bid Auction Based on Grover's Search Algorithm
Related Experiment Video
Updated: Jul 16, 2026

Gradient Echo Quantum Memory in Warm Atomic Vapor
Published on: November 11, 2013
Run-Hua Shi1,2, Mingwu Zhang3
1School of Computer Science, Hubei University of Technology, Wuhan City, 430068, China. rhshi@ncepu.edu.cn.
Abstract:
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.
Related Concept Videos
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Theorems of Pappus and Guldinus: Problem Solving
Norton's Theorem
Green’s Theorem
Extended Versions of Green’s Theorem

