Abstract
Using quantum networks to distribute symmetric keys has become a usable and commercial technology available under limitations that are acceptable in many application scenarios. The fact that the security is implemented directly at the hardware level, and moreover, relies on the laws of physics instead of conjectured hardness assumptions, justifies the use of quantum security in many cases. Limitations include 100 km communication range and installation of quantum channels between each pair of users of the network. Presently, with the current lack of trust in commercial security solutions, mostly due to the Snowden crisis, there is the need to improve such solutions. In this paper we discuss how quantum networks can be used to setup secure multiparty computation (SMC), allowing for instance for private data mining, electronic elections among other security functionalities. SMC relies mostly on establishing an efficient oblivious transfer protocol. We present a bit-string quantum oblivious transfer protocol based on single-qubit rotations that can be implemented with current technology based on optics and whose security relies only on the laws of physics.
Chapter PDF
Similar content being viewed by others
References
Bennett, C., Brassard, G.: Quantum Cryptography: Public Key Distribution and Coin Tossing. In: Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, pp. 175–179. IEEE Press, New York (1984)
Carter, J., Wegman, M.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143–154 (1979)
Lindell, Y., Zarosim, H.: On the feasibility of extending oblivious transfer. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 519–538. Springer, Heidelberg (2013)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information, 1st edn. Cambridge University Press (January 2004)
Nikolopoulos, G.: Applications of single-qubit rotations in quantum public-key cryptography. Phys. Rev. A 77, 032348(2008)
Rabin, M.: How to exchange secrets by oblivious transfer (1981)
Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)
Yao, A.C.-C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS 1986, pp. 162–167. IEEE Computer Society, Washington, DC (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Mateus, P., Paunković, N., Rodrigues, J., Souto, A. (2014). Enhancing Privacy with Quantum Networks. In: De Decker, B., Zúquete, A. (eds) Communications and Multimedia Security. CMS 2014. Lecture Notes in Computer Science, vol 8735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44885-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-44885-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44884-7
Online ISBN: 978-3-662-44885-4
eBook Packages: Computer ScienceComputer Science (R0)