Modern Cryptography, Probabilistic Proofs and Pseudorandomness

From the Publisher: This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.

[1]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[2]  Richard Cleve,et al.  Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.

[3]  Peter Bro Miltersen,et al.  Derandomizing Arthur–Merlin Games using Hitting Sets , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[4]  Avi Wigderson,et al.  SL ⊆L4/3 , 1997, STOC 1997.

[5]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[6]  Ivan Damgård,et al.  A Design Principle for Hash Functions , 1989, CRYPTO.

[7]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Moti Yung,et al.  How to share a function securely , 1994, STOC '94.

[9]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[10]  Hugo Krawczyk,et al.  Pseudorandom functions revisited: the cascade construction and its concrete security , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[12]  Hugo Krawczyk,et al.  Keying Hash Functions for Message Authentication , 1996, CRYPTO.

[13]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[14]  Manuel Blum,et al.  Non-interactive zero-knowledge and its applications , 1988, STOC '88.

[15]  Leonid A. Levin,et al.  Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.

[16]  Oded Goldreich,et al.  Computational Indistinguishability: A Sample Hierarchy , 1999, J. Comput. Syst. Sci..

[17]  Uriel Feige.  On the success probability of the two provers in one-round proof systems , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[18]  Aravind Srinivasan,et al.  Explicit dispersers with polylog degree , 1995, STOC '95.

[19]  Birgit Pfitzmann,et al.  Fail-Stop Signatures , 1997, SIAM J. Comput..

[20]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[21]  Mihir Bellare,et al.  Incremental cryptography and application to virus protection , 1995, STOC '95.

[22]  Oded Goldreich,et al.  Quantifying knowledge complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[23]  Michael Luby,et al.  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.

[24]  Rafail Ostrovsky,et al.  One-way functions are essential for non-trivial zero-knowledge , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[25]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[26]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[27]  Ralph C. Merkle,et al.  A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.

[28]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[29]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[30]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[31]  Hugo Krawczyk,et al.  New Hash Functions For Message Authentication , 1995, EUROCRYPT.

[32]  Ralph C. Merkle,et al.  Protocols for Public Key Cryptosystems , 1980, 1980 IEEE Symposium on Security and Privacy.

[33]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[34]  Amit Sahai,et al.  A complete promise problem for statistical zero-knowledge , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[35]  Johan Håstad,et al.  Perfect zero-knowledge languages can be recognized in two rounds , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[36]  Michael E. Saks,et al.  Efficient construction of a small hitting set for combinatorial rectangles in high dimension , 1997, Comb..

[37]  Nancy A. Lynch,et al.  Distributed Algorithms , 1994, Lecture Notes in Computer Science.

[38]  Oded Goldreich,et al.  Comparing entropies in statistical zero knowledge with applications to the structure of SZK , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[39]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[40]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[41]  Oded Goldreich,et al.  A Note on Computational Indistinguishability , 1990, Inf. Process. Lett..

[42]  Moni Naor,et al.  Adaptively secure multi-party computation , 1996, STOC '96.

[43]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[44]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[45]  Mihir Bellare,et al.  Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..

[46]  Joe Kilian,et al.  An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions , 1998, Journal of Cryptology.

[47]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[48]  Ueli Maurer,et al.  Unconditional Security Against Memory-Bounded Adversaries , 1997, CRYPTO.

[49]  Silvio Micali,et al.  CS proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[50]  Alan M. Frieze,et al.  Reconstructing Truncated Integer Variables Satisfying Linear Congruences , 1988, SIAM J. Comput..

[51]  Noam Nisan,et al.  Undirected connectivity in o(\log1 , 1989 .

[52]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[53]  Oded Goldreich,et al.  The Random Oracle Hypothesis Is False , 1994, J. Comput. Syst. Sci..

[54]  Noam Nisan,et al.  Extracting randomness: how and why. A survey , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[55]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[56]  Miklós Ajtai,et al.  Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..

[57]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[58]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[59]  Moni Naor,et al.  Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.

[60]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[61]  Amnon Ta-Shma,et al.  Almost Optimal Dispersers , 1998, STOC '98.

[62]  Mihir Bellare,et al.  Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.

[63]  Mihir Bellare,et al.  The Security of Cipher Block Chaining , 1994, CRYPTO.

[64]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[65]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[66]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[67]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[68]  Hugo Krawczyk,et al.  On the Existence of Pseudorandom Generators , 1993, SIAM J. Comput..

[69]  Ran Canetti,et al.  Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information , 1997, CRYPTO.

[70]  Noam Nisan.  Rl <= Sc , 1994, Comput. Complex..

[71]  Manuel Blum,et al.  How to exchange (secret) keys , 1983, TOCS.

[72]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[73]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[74]  Michael Saks,et al.  RSPACE(S) DSPACE(S^3/2) , 1995, FOCS 1995.

[75]  Rafail Ostrovsky,et al.  Deniable Encryption , 1997, IACR Cryptol. ePrint Arch..

[76]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[77]  Sam Toueg,et al.  Fast Distributed Agreement , 1987, SIAM J. Comput..

[78]  U. Feige.  Error reduction by parallel repetition-the state of the art , 1995 .

[79]  M. Blum,et al.  Towards a computational theory of statistical tests , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[80]  Ran Canetti,et al.  Incoercible multiparty computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[81]  Mihir Bellare,et al.  Improved non-approximability results , 1994, STOC '94.

[82]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[83]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[84]  Mihir Bellare,et al.  Knowledge on the average—perfect, statistical and logarithmic , 1995, STOC '95.

[85]  David Chaum,et al.  Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..

[86]  Ran Raz.  A Parallel Repetition Theorem , 1998, SIAM J. Comput..

[87]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[88]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[89]  Uri Zwick,et al.  Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[90]  Uriel Feige,et al.  Making games short (extended abstract) , 1997, STOC '97.

[91]  Yvo Desmedt,et al.  Society and Group Oriented Cryptography: A New Concept , 1987, CRYPTO.

[92]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[93]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[94]  Daniel A. Spielman,et al.  Nearly-linear size holographic proofs , 1994, STOC '94.

[95]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[96]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[97]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[98]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[99]  Oded Goldreich,et al.  On the Complexity of Interactive Proofs with Bounded Communication , 1998, Inf. Process. Lett..

[100]  David Zuckerman,et al.  Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.

[101]  Adi Shamir,et al.  Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.

[102]  Venkatesan Guruswami,et al.  A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[103]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[104]  Silvio Micali,et al.  An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..

[105]  Roy Armoni,et al.  On the Derandomization of Space-Bounded Computations , 1998, RANDOM.

[106]  Ran Raz,et al.  Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.

[107]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[108]  Daniel R. Simon.  Anonymous Communication and Anonymous Cash , 1996, CRYPTO.

[109]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[110]  Moni Naor,et al.  Non-malleable cryptography , 1991, STOC '91.

[111]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[112]  Andrew Chi-Chih Yao,et al.  How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.

[113]  Johan Håstad,et al.  A well-characterized approximation problem , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[114]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[115]  Moni Naor,et al.  Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions , 1999, J. Comput. Syst. Sci..

[116]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[117]  Oded Goldreich,et al.  Another proof that BPP subseteq PH (and more) , 1997, Electron. Colloquium Comput. Complex..

[118]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[119]  Michael Luby,et al.  Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.

[120]  Mihir Bellare,et al.  The Complexity of Decision Versus Search , 1991, SIAM J. Comput..

[121]  Mihir Bellare,et al.  XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions , 1995, CRYPTO.

[122]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[123]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[124]  Lance Fortnow,et al.  On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..

[125]  Yvo Desmedt,et al.  Threshold Cryptosystems , 1989, CRYPTO.

[126]  Hugo Krawczyk,et al.  On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.

[127]  Mihir Bellare,et al.  The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin , 1996, EUROCRYPT.

[128]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[129]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[130]  Moshe Tennenholtz,et al.  The Noisy Oracle Problem , 1988, CRYPTO.

[131]  Gilles Brassard,et al.  Quantum Information Processing: The Good, the Bad and the Ugly , 1997, CRYPTO.

[132]  Mihir Bellare,et al.  Provably secure session key distribution: the three party case , 1995, STOC '95.

[133]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[134]  Birgit Pfitzmann,et al.  Digital Signature Schemes: General Framework and Fail-Stop Signatures , 1996 .

[135]  Silvio Micali,et al.  Why and how to establish a private code on a public network , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[136]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[137]  Markus Jakobsson,et al.  Proactive public key and signature systems , 1997, CCS '97.

[138]  Silvio Micali,et al.  Strong signature schemes , 1983, STOC '83.

[139]  Alexander A. Razborov,et al.  Natural Proofs , 1997, J. Comput. Syst. Sci..

[140]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[141]  Johan Håstad,et al.  Pseudo-random generators under uniform assumptions , 1990, STOC '90.

[142]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[143]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[144]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[145]  Larry J. Stockmeyer,et al.  The complexity of approximate counting , 1983, STOC.

[146]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[147]  Moti Yung,et al.  Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols , 1991, Theor. Comput. Sci..

[148]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[149]  Jean-Marc Robert,et al.  How to reduce your enemy's information , 1986, CRYPTO 1986.

[150]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[151]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[152]  Silvio Micali,et al.  Fair Public-Key Cryptosystems , 1992, CRYPTO.

[153]  Luca Trevisan,et al.  Constructions of Near-Optimal Extractors Using Pseudo-Random Generators , 1998, Electron. Colloquium Comput. Complex..

[154]  Russell Impagliazzo,et al.  Limits on the provable consequences of one-way permutations , 1988, STOC '89.

[155]  Donald Beaver,et al.  Foundations of Secure Interactive Computing , 1991, CRYPTO.

[156]  Michael Sipser,et al.  Expanders, Randomness, or Time versus Space , 1988, J. Comput. Syst. Sci..

[157]  Silvio Micali,et al.  Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.

[158]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[159]  Amnon Ta-Shma,et al.  On Extracting Randomness From Weak Random Sources , 1995, Electron. Colloquium Comput. Complex..

[160]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[161]  Daniel R. Simon,et al.  Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.

[162]  Silvio Micali,et al.  How To Sign Given Any Trapdoor Function , 1988, CRYPTO.

[163]  Hugo Krawczyk,et al.  Robust Threshold DSS Signatures , 1996, EUROCRYPT.

[164]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[165]  Amos Fiat,et al.  Zero-knowledge proofs of identity , 1988, Journal of Cryptology.

[166]  Richard J. Lipton,et al.  On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract) , 1997, EUROCRYPT.

[167]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[168]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[169]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[170]  Rafail Ostrovsky,et al.  Security of blind digital signatures , 1997 .

[171]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[172]  Oded Goldreich,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (Preliminary Version) , 1997, STOC 1994.

[173]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[174]  Adi Shamir,et al.  Fully Parallelized Multi-Prover Protocols for NEXP-Time , 1997, J. Comput. Syst. Sci..

[175]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[176]  Russell Impagliazzo,et al.  Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[177]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[178]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[179]  Ivan Damgård,et al.  New Generation of Secure and Practical RSA-Based Signatures , 1996, CRYPTO.

[180]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[181]  Ivan Damgård,et al.  Collision Free Hash Functions and Public Key Signature Schemes , 1987, EUROCRYPT.

[182]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[183]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[184]  Mihir Bellare,et al.  Entity Authentication and Key Distribution , 1993, CRYPTO.

[185]  Hugo Krawczyk,et al.  A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract) , 1998, STOC '98.

[186]  李幼升,et al.  Ph , 1989 .

[187]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[188]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[189]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).