Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial

作者: Jörg Rothe

DOI:

关键词:

摘要: In this tutorial, selected topics of cryptology and computational complexity theory are presented. We give a brief overview the history foundations classical cryptography, then move on to modern public-key cryptography. Particular attention is paid cryptographic protocols problem constructing key components such as one-way functions. A function if it easy compute, but hard invert. discuss notion functions both in complexity-theoretic setting. also consider interactive proof systems present some interesting zero-knowledge protocols. protocol one party can convince other knowing secret information without disclosing any bit information. Motivated by these protocols, we survey results related classes.

参考文章(58)
Miklós Ajtai, The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions. Electronic Colloquium on Computational Complexity. ,vol. 4, ,(1997)
O. Goldreich, Randomness, interactive proofs, and zero-knowledge—A survey A half-century survey on The Universal Turing Machine. pp. 377- 405 ,(1988)
Miklós Ajtai, Generating Hard Instances of Lattice Problems Electronic Colloquium on Computational Complexity. ,vol. 3, ,(1996)
Daniele Micciancio, Shafi Goldwasser, Interactive Proof Systems Springer, Boston, MA. pp. 195- 210 ,(2002) , 10.1007/978-1-4615-0897-7_9
Gilles Brassard, Claude Crepeau, Sorting out zero-knowledge theory and application of cryptographic techniques. pp. 181- 191 ,(1990) , 10.1007/3-540-46885-4_20
Oded Goldreich, A taxonomy of proof systems Complexity theory retrospective II. pp. 109- 134 ,(1998)
Albrecht Beutelspacher, Jörg Schwenk, Klaus-Dieter Wolfenstetter, Moderne Verfahren der Kryptographie Vieweg+Teubner Verlag. ,(1995) , 10.1007/978-3-322-84306-7
Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung, On Sets with Easy Certificates and the Existence of One-Way Permutations international conference on algorithms and complexity. pp. 264- 275 ,(1997) , 10.1007/3-540-62592-5_78
Michael George Luby, None, Pseudorandomness and Cryptographic Applications ,(1996)
Leonard Charles Berman, Polynomial reducibilities and complete sets. Cornell University. ,(1977)