Abstract
AbstractWe 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 deterministic 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.
Funder
European Science Foundation
Other
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Condensed Matter Physics,Atomic and Molecular Physics, and Optics,Control and Systems Engineering
Reference59 articles.
1. Shenoy-Hejamadi A, Pathak A, Radhakrishna S. Quantum cryptography: Key distribution and beyond. Quanta. 2017;6(1):1–47.
2. Gisin N, Ribordy G, Tittel W, Zbinden H. Quantum cryptography. Rev Mod Phys. 2002;74(1):145.
3. Bennett CH, Brassard G. Quantum cryptography: Public key distribution and coin tossing. In: International conference on computer system and signal processing. Bangalore, India: IEEE; 1984. p. 175–9.
4. Ekert AK. Quantum cryptography based on Bell’s theorem. Phys Rev Lett. 1991;67(6):661.
5. Colbeck R. Quantum and relativistic protocols for secure multi-party computation. 2009. arXiv preprint. arXiv:0911.3814.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献