LEADER 04024nam 22005173 450 001 9910838221303321 005 20230817184951.0 010 $a1-4503-7269-4 035 $a(CKB)4100000011919184 035 $a(MiAaPQ)EBC6954878 035 $a(Au-PeEL)EBL6954878 035 $a(OCoLC)1314629252 035 $a(MiAaPQ)EBC31086554 035 $a(Au-PeEL)EBL31086554 035 $a(EXLCZ)994100000011919184 100 $a20220421d2019 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aProviding Sound Foundations for Cryptography $eOn the Work of Shafi Goldwasser and Silvio Micali 205 $a1st ed. 210 1$aSan Rafael :$cMorgan & Claypool Publishers,$d2019. 210 4$dİ2019. 215 $a1 online resource (838 pages) 225 1 $aACM Bks. 327 $aIntro -- Contents -- Preface -- Acknowledgments -- Photo and Text Credits -- PART I. BIOGRAPHIES, INTERVIEWS, AND AWARD LECTURES -- 1. A Story Behind Every Problem: A Brief Biography of Shafi Goldwasser -- 2. One Obsession at a Time: A Brief Biography of Silvio Micali -- 3. An Interview with Shafi Goldwasser -- 4. An Interview with Silvio Micali -- 5. The Cryptographic Lens: Shafi Goldwasser'sTuring Lecture -- 6. Proofs, According to Silvio: Silvio Micali's Turing Lecture -- PART II. ORIGINAL PAPERS -- 7. Probabilistic Encryption -- 8. The Knowledge Complexity of Interactive Proof Systems -- 9. How to Generate Cryptographically Strong Sequences of Pseudorandom Bits -- 10. How to Construct Random Functions -- 11. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks -- 12. Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems -- 13. How to Play Any Mental Game: A Completeness Theorem for Protocols with Honest Majority -- 14. Non-Interactive Zero-Knowledge (NIZK) Proof Systems -- 15. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation -- 16. Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions -- PART III. PERSPECTIVES -- 17. On the Foundations of Cryptography -- 18. On the Impact of Cryptography on Complexity Theory -- 19. On Some Noncryptographic Works of Goldwasser and Micali -- 20. Fundamentals of Fully Homomorphic Encryption -- 21. Interactive Proofs for Lattice Problems -- 22. Following a Tangent of Proofs -- 23. A Tutorial on Concurrent Zero-Knowledge -- 24. Doubly Efficient Interactive Proofs -- 25. Computational Entropy -- 26. A Survey of Leakage-Resilient Cryptography -- Editor and Author Biographies -- Blank Page. 330 $aCryptography is concerned with the construction of schemes that withstand any abuse. A cryptographic scheme is constructed so as to maintain a desired functionality, even under malicious attempts aimed at making it deviate from its prescribed behavior. The design of cryptographic systems must be based on firm foundations, whereas ad hoc approaches and heuristics are a very dangerous way to go. These foundations were developed mostly in the 1980s, in works that are all co-authored by Shafi Goldwasser and/or Silvio Micali. These works have transformed cryptography from an engineering discipline, lacking sound theoretical foundations, into a scientific field possessing a well-founded theory, which influences practice as well as contributes to other areas of theoretical computer science. 410 0$aACM Bks. 517 $aProviding Sound Foundations for Cryptography 606 $aAlgorithms 606 $aComputer algorithms 606 $aComputer scientists 615 0$aAlgorithms. 615 0$aComputer algorithms. 615 0$aComputer scientists. 676 $a005.824 700 $aGoldreich$b Oded$066329 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910838221303321 996 $aProviding Sound Foundations for Cryptography$94140419 997 $aUNINA