Classical cryptographic protocols in a quantum world

Authors:
Sean Hallgren;Adam Smith;Fang Song
Affiliations:
Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA;Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA;Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA
Venue:
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Year:
2011

Citing 40
Cited 3

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
The round complexity of secure protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Unconditional security in quantum cryptography

Journal of the ACM (JACM)
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Secure multi-party quantum computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Zero Knowledge Proofs of Knowledge in Two Rounds

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Quantum Bit Commitment and Coin Tossing Protocols

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Practical Quantum Oblivious Transfer

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On Deniability in Quantum Key Exchange

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
New notions of security: achieving universal composability without trusted setup

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Simulatable Security and Polynomially Bounded Concurrent Composability

SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

Journal of the ACM (JACM)
Cryptography in the Bounded-Quantum-Storage Model

SIAM Journal on Computing
Games for exchanging information

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Quantum circuit complexity

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Composing Quantum Protocols in a Classical Environment

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
General Composition and Universal Composability in Secure Multiparty Computation

Journal of Cryptology
On lattices, learning with errors, random linear codes, and cryptography

Journal of the ACM (JACM)
Improving the Security of Quantum Protocols via Commit-and-Open

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Zero-Knowledge against Quantum Attacks

SIAM Journal on Computing
Quantum-Secure Coin-Flipping and Applications

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Perfectly concealing quantum bit commitment from any quantum one-way permutation

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Universally composable security with global setup

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Simulation in quasi-polynomial time, and its application to protocol composition

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Secure identification and QKD in the bounded-quantum-storage model

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Information-Theoretically Secure Protocols and Security under Composition

SIAM Journal on Computing
Concurrent composition in the bounded quantum storage model

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Fully simulatable quantum-secure coin-flipping and applications

AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
The universal composable security of quantum key distribution

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Approximate quantum error-correcting codes and secret sharing schemes

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Universally composable quantum multi-party computation

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
The security of triple encryption and a framework for code-based game-playing proofs

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Random oracles in a quantum world

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Quantum proofs of knowledge

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Feasibility and completeness of cryptographic tasks in the quantum world

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.