Abstract
AbstractUnforgeable quantum money tokens were the first invention of quantum information science, but remain technologically challenging as they require quantum memories and/or long-distance quantum communication. More recently, virtual “S-money” tokens were introduced. These are generated by quantum cryptography, do not require quantum memories or long-distance quantum communication, and yet in principle guarantee many of the security advantages of quantum money. Here, we describe implementations of S-money schemes with off-the-shelf quantum key distribution technology, and analyse security in the presence of noise, losses, and experimental imperfection. Our schemes satisfy near-instant validation without cross-checking. We show that, given standard assumptions in mistrustful quantum cryptographic implementations, unforgeability and user privacy could be guaranteed with attainable refinements of our off-the-shelf setup. We discuss the possibilities for unconditionally secure (assumption-free) implementations.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Statistical and Nonlinear Physics,Computer Science (miscellaneous)
Reference60 articles.
1. Wiesner, S. Conjugate coding. ACM Sigact News 15, 78 (1983).
2. D., Gavinsky, Quantum money with classical verification. in Proc. 2012 IEEE 27th Annual Conference on Computational Complexity (CCC) 42–52 (IEEE, 2012).
3. Molina, A., Vidick, T. & Watrous, J. in Theory of Quantum Computation, Communication, and Cryptography (eds Iwama, K., Kawano, Y. & Murao, M.) 45–64.(Springer, 2012).
4. Pastawski, F., Yao, N. Y., Jiang, L., Lukin, M. D. & Cirac, J. I. Unforgeable noise-tolerant quantum tokens. Proc. Natl. Acad. Sci. USA 109, 16079 (2012).
5. Georgiou, M. & Kerenidis, I. New constructions for quantum money. in LIPIcs-Leibniz International Proceedings in Informatics (Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献