| Modern Cryptography, Probabilistic Proofs and Pseudorandomness 1999 Edition Contributor(s): Goldreich, Oded (Author) |
|
 |
ISBN: 354064766X ISBN-13: 9783540647669 Publisher: Springer OUR PRICE: $132.99 Product Type: Hardcover - Other Formats Published: November 1998 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Applied - Computers | Security - Cryptography - Mathematics | Probability & Statistics - General |
| Dewey: 005.8 |
| LCCN: 98050548 |
| Series: Algorithms and Combinatorics |
| Physical Information: 0.58" H x 6.31" W x 9.45" (0.91 lbs) 183 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas- cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the focal of the computational approach to randomness. This book provides an introduction to these three, somewhat interwoven domains (i.e., cryptography, proofs and randomness). Modern Cryptography. Whereas classical cryptography was confined to the art of designing and breaking encryption schemes (or "secrecy codes"), Modern Cryptography is concerned with the rigorous analysis of any system which should withstand malicious attempts to abuse it. We emphasize two aspects of the transition from classical to modern cryptography: ( 1) the wide- ning of scope from one specific task to an utmost wide general class of tasks; and (2) the move from an engineering-art which strives on ad-hoc tricks to a scientific discipline based on rigorous approaches and techniques. |