Modern Cryptography, Probabilistic Proofs and Pseudorandomness
By: by Oded Goldreich
Series: Algorithms and Combinatorics -- 17; Algorithms and Combinatorics -- 17
Publisher: Springer Berlin Heidelberg
Published: 1999
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 183
ISBN-13: 9783642084324; 9783662125212
Subjects: Data encryption (Computer science); Combinatorics; Mathematics; Distribution (Probability theory); Information theory; Computer science
Description: The book focuses on three related areas in the theory of computation. The areas are modern cryptography, the study of probabilistic proof systems, and the theory of computational pseudorandomness. The common theme is the interplay between randomness and computation. The book offers an introduction and extensive survey to each of these areas, presenting both the basic notions and the most important (sometimes advanced) results. The presentation is focused on the essentials and does not elaborate on details. In some cases it offers a novel and illuminating perspective. The reader may obtain from the book 1. A clear view of what each of these areas is all above. 2. Knowledge of the basic important notions and results in each area. 3. New insights into each of these areas. It is believed that the book may thus be useful both to a beginner (who has only some background in the theory of computing), and an expert in any of these areas.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.
Table of contents: title: Preface; title: Chapter 1: The Foundations of Modern Cryptography; title: Chapter 2: Probabilistic Proof Systems; title: Chapter 3: Pseudorandom Generators; title: Appendix A: Background on Randomness and Computation; title: Appendix B: Randomized Computations; title: Appendix C: Notes on two proofs; title: Appendix D: Related Surveys by the Author; title: Bibliography.