<p><p>This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof techni
Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich
β Scribed by Yehuda Lindell (eds.)
- Publisher
- Springer International Publishing
- Year
- 2017
- Tongue
- English
- Leaves
- 461
- Series
- Information Security and Cryptography
- Edition
- 1st ed.
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study.
This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography.
β¦ Table of Contents
Front Matter....Pages i-xv
Garbled Circuits as Randomized Encodings of Functions: a Primer....Pages 1-44
The Complexity of Public-Key Cryptography....Pages 45-77
Pseudorandom Functions: Three Decades Later....Pages 79-158
The Many Entropies in One-Way Functions....Pages 159-217
Homomorphic Encryption....Pages 219-276
How to Simulate It β A Tutorial on the Simulation Proof Technique....Pages 277-346
The Complexity of Differential Privacy....Pages 347-450
β¦ Subjects
Computer science;Informatique;Data structures (Computer science);Structures de donnΓ©es (Informatique);Computers;Ordinateurs;Data structures (Computer science)
π SIMILAR VOLUMES
<span>Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory de?nition; ze- knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of c
<span>This cryptography tutorial book is a collection of notes and sample codes written by the author while he was learning cryptography technologies himself. Topics include MD5 and SHA1 message digest algorithms and implementations, DES, Blowfish and AES secret key cipher algorithms and implementat
Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. This book presents a rigorous and systematic treatment of the foundational issues: defining cryptographic tasks and solving new cryptographic problems using existin
Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. This book presents a rigorous and systematic treatment of the foundational issues: defining cr