Welcome to the resource topic for 2015/687
Title:
Classical Cryptographic Protocols in a Quantum World
Authors: Sean Hallgren, Adam Smith, 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.
ePrint: https://eprint.iacr.org/2015/687
Talk: https://www.youtube.com/watch?v=4-_WUOFZ950
Slides: http://www.iacr.org/cryptodb/archive/2011/CRYPTO/presentation/07-2-Song.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .