Abstract is missing.
- PrefaceOded Goldreich 0001. [doi]
- A story behind every problem: a brief biography of Shafi Goldwasser1-24 [doi]
- One obsession at a time: a brief biography of Silvio Micali25-52 [doi]
- An interview with Shafi Goldwasser53-99 [doi]
- An interview with Silvio Micali101-138 [doi]
- The cryptographic lens: Shafi Goldwasser's Turing lecture139-156 [doi]
- Proofs, according to Silvio: Silvio Micali's Turing lecture157-171 [doi]
- Probabilistic encryption & how to play mental poker keeping secret all partial informationShafi Goldwasser, Silvio Micali. 173-201 [doi]
- The knowledge complexity of interactive proof-systemsShafi Goldwasser, Silvio Micali, Charles Rackoff. 203-225 [doi]
- How to generate cryptographically strong sequences of pseudo random bitsManuel Blum 0001, Silvio Micali. 227-240 [doi]
- How to construct random functionsOded Goldreich 0001, Shafi Goldwasser, Silvio Micali. 241-264 [doi]
- A "paradoxical" solution to the signature problemShafi Goldwasser, Silvio Micali, Ronald L. Rivest. 265-284 [doi]
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designOded Goldreich 0001, Silvio Micali, Avi Wigderson. 285-306 [doi]
- How to play any mental game, or a completeness theorem for protocols with honest majorityOded Goldreich 0001, Silvio Micali, Avi Wigderson. 307-328 [doi]
- Non-interactive zero-knowledge and its applicationsManuel Blum 0001, Paul Feldman, Silvio Micali. 329-349 [doi]
- Completeness theorems for non-cryptographic fault-tolerant distributed computationMichael Ben-Or, Shafi Goldwasser, Avi Wigderson. 351-371 [doi]
- Multi-prover interactive proofs: how to remove intractability assumptionsMichael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson. 373-410 [doi]
- On the foundations of cryptographyOded Goldreich 0001. 411-496 [doi]
- On the impact of cryptography on complexity theoryOded Goldreich 0001. 497-526 [doi]
- On some noncryptographic works of Goldwasser and MicaliOded Goldreich 0001. 527-542 [doi]
- Fundamentals of fully homomorphic encryptionZvika Brakerski. 543-563 [doi]
- Interactive proofs for lattice problemsDaniele Micciancio. 565-597 [doi]
- Following a tangent of proofsJohan Håstad. 599-622 [doi]
- A tutorial on concurrent zero-knowledgeRafael Pass. 623-648 [doi]
- Doubly efficient interactive proofsGuy N. Rothblum. 649-691 [doi]
- Computational entropySalil P. Vadhan. 693-726 [doi]
- A survey of leakage-resilient cryptographyYael Tauman Kalai, Leonid Reyzin. 727-794 [doi]
- Editor and author biographies795-800 [doi]