Cryptology ePrint Archive: Report 2015/687

Classical Cryptographic Protocols in a Quantum World

Sean Hallgren and Adam Smith and Fang Song

Abstract: Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information processing is the most realistic model of physically feasible computation, then we must ask: what classical protocols remain secure against quantum attackers?

Our main contribution is showing the existence of classical two-party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions (for example, it suffices that the learning with errors problem be hard for quantum polynomial time). Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.

Category / Keywords: cryptographic protocols / quantum attacks, composition,

Original Publication (with major differences): IACR-CRYPTO-2011

Date: received 7 Jul 2015

Contact author: fang song at uwaterloo ca

Available format(s): PDF | BibTeX Citation

Note: Full version of an old paper in Crypto'11. Invited to International Journal of Quantum Information Vol. 13, No. 4 (2015) DOI: 10.1142/S0219749915500288

Version: 20150713:075340 (All versions of this report)

Short URL: ia.cr/2015/687

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]