Quantum-based anonymity and secure veto

Wang, Qingle; Li, Yuancheng; Yu, Chao; Shi, Ronghua; Zhang, Zhichao

doi:10.1007/s11128-021-03022-2

Cited by 12 publications

(11 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the above example, suppose that 𝑁 = 100, and there are 6 bidders: 𝐵𝑜𝑏 1 (56), 𝐵𝑜𝑏 2 (43), 𝐵𝑜𝑏 3 (73), 𝐵𝑜𝑏 4 (61), 𝐵𝑜𝑏 5 (87), and 𝐵𝑜𝑏 6 (39), where the integers in parentheses are their respective private bids. Furthermore, we assume that 𝑑 = 10 and Δ = 10, which are negotiated and determined by all bidders in Step 1.…”

Section: Fig 3 Finding the Highest Bid's Intervalmentioning

confidence: 99%

See 1 more Smart Citation

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Shi

2022

IEEE Trans. Quantum Eng.

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

Section: Fig 3 Finding the Highest Bid's Intervalmentioning

confidence: 99%

“…In addition, as a primitive protocol of secure multiparty computations, our proposed quantum SMD protocol can be utilized to implement the anonymous veto [39], where the inputs 0 and 1 mean "approval" and "disapproval" on one proposal, respectively. Once existing at least one "disapproval," the proposal is rejected.…”

Section: Performancementioning

confidence: 99%

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Shi

2022

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

show abstract

“…There are some work on quantum-secured veto [27,25,15], in which the ballots are still classical, but they are encrypted by some methods of quantum cryptography in order to ensure some security properties. To the best of our knowledge, quantum veto in which ballots are in quantum state has never been studied before.…”

Section: Quantum Vetomentioning

confidence: 99%

Distributed Quantum Vote Based on Quantum Logical Operators, a New Battlefield of the Second Quantum Revolution

Sun¹,

He²,

Qiu³

et al. 2022

Preprint

View full text Add to dashboard Cite

We designed two rules of binary quantum computed vote: Quantum Logical Veto (QLV) and Quantum Logical Nomination (QLN). The conjunction and disjunction from quantum computational logic are used to define QLV and QLN, respectively. Compared to classical vote, quantum computed vote is fairer, more democratic and has stronger expressive power. Since the advantage of quantum computed vote is neither the speed of computing nor the security of communication, we believe it opens a new battlefield in the second quantum revolution. Compared to other rules of quantum computed vote, QLV and QLN have better scalability. Both QLV and QLN can be implemented by the current technology and the difficulty of implementation does not grow with the increase of the number of voters.

show abstract

“…Since then a large number of new protocols for anonymous voting have been designed, but an unconditionally secure and practical quantum voting protocol has remained elusive till this date [14][15][16][17][18]. More recently, there has been a heightened interest in the quantum anonymous voting protocols with a flurry of papers [19][20][21][22][23][24][25][26][27][28][29][30][31][32]. These voting schemes can be classified in different categories on the basis of required quantum resources, nature of ballots, number of candidates, conditions to be satisfied, and so on.…”

Section: Introductionmentioning

confidence: 99%

Quantum anonymous veto: A set of new protocols

Mishra,

Thapliyal,

Parakh

et al. 2021

Preprint

View full text Add to dashboard Cite

We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be viewed as single photon-based, bipartite and multipartite entangled states-based, orthogonal state-based and conjugate coding-based. The set of the proposed schemes is analyzed for all the requirements of a valid QAV scheme (e.g., privacy, verifiability, robustness, binding, eligibility and correctness). The proposed schemes are observed to be more efficient in comparison to the existing QAV schemes and robust up to the moderate decoherence rate. In addition, a trade-off between correctness and robustness of the probabilistic QAV schemes is observed. Further, the multipartite dense coding based determinsitic QAV scheme is most efficient scheme among the set of schemes proposed here. A bipartite entanglement based iterative scheme employing dense coding is yet another efficient and practical scheme. The intrinsic connections between dining cryptographer-net with anonymous veto-net is also explored in the process of designing new protocols.

show abstract

Quantum-based anonymity and secure veto

Cited by 12 publications

References 28 publications

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Distributed Quantum Vote Based on Quantum Logical Operators, a New Battlefield of the Second Quantum Revolution

Quantum anonymous veto: A set of new protocols

Contact Info

Product

Resources

About