Classical Cryptographic Protocols in a Quantum World

  • Sean Hallgren
  • Adam Smith
  • Fang Song
Conference paper

DOI: 10.1007/978-3-642-22792-9_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6841)
Cite this paper as:
Hallgren S., Smith A., Song F. (2011) Classical Cryptographic Protocols in a Quantum World. In: Rogaway P. (eds) Advances in Cryptology – CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science, vol 6841. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Sean Hallgren
    • 1
  • Adam Smith
    • 1
  • Fang Song
    • 1
  1. 1.Department of Computer Science and EngineeringPennsylvania State UniversityU.S.A.

Personalised recommendations