Tutorials on the Foundations of Cryptography : Dedicated to Oded Goldreich / edited by Yehuda Lindell.

Format:

Book

Contributor:

Lindell, Yehuda, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Information security and cryptography 1619-7100

Information Security and Cryptography, 1619-7100

Language:

English

Subjects (All):

Data structures (Computer science).

Computers.

Data Structures and Information Theory.

Theory of Computation.

Local Subjects:

Data Structures and Information Theory.

Theory of Computation.

Physical Description:

1 online resource (XV, 450 pages) : 26 illustrations, 5 illustrations in color.

Edition:

First edition 2017.

Contained In:

Springer eBooks

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2017.

System Details:

text file PDF

Summary:

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.

Contents:

Garbled Circuits as Randomized Encodings of Functions: A Primer

The Complexity of Public-Key Cryptography

Pseudorandom Functions: Three Decades Later

The Many Entropies in One-Way Functions

Homomorphic Encryption

How to Simulate It: A Tutorial on the Simulation Proof Technique

The Complexity of Differential Privacy.

Other Format:

Printed edition:

ISBN:

978-3-319-57048-8

9783319570488

Access Restriction:

Restricted for use by site license.