Cryptography is one of the most active areas in current mathematics research and applications. This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.
Modern Cryptography, Probalistic Proofs and Pseudorandomness
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
Review
From the reviews:
"This book is intended for a reader with some knowledge of the theory of computing. It is divided into three chapters, each a survey of one of the topics mentioned in the title. The chapters may be read independently, and are somewhat different in nature. ...The book ends with four appendices. The first summarises the probability theory, complexity theory and cryptography that is used in the body of the book. The second gives examples of randomisation in algorithmic problems, complexity theory and distributed computing. The third contains two proofs, not to be found in the literature, of well-known results. The last appendix lists other surveys by the author." (Simon R. Blackburn, Mathematical Reviews)
"Modern cryptography, probabilistic proofs and pseudorandomness are three areas in theoretical computer science that demonstrate the interplay between randomness and computations. … This book is informative and rich in content. … the most appealing feature of this book is that it leans toward the intuition and historical motivations around these topics. … it is an excellent resource for students and researchers … . this book will probably give you a good collection of background motivations and nice discussions as well." (Andrew C. Lee, SIGACT News, Vol. 34 (4), 2003)
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
5 of 5 people found the following review helpful:
4.0 out of 5 stars
Excellent survey,
By Yoad Lustig (Israel) - See all my reviews
This review is from: Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Algorithms and Combinatorics) (Hardcover)
The book contains an broad overview of the 3 fields in the title (probabilistic proofs stands for both Interactive Proofs, Zero-Knowledge & Probabilisticly Checkable Proofs).While definitions are accurate (therefore technical), most proof are only given in sketches which enables the reader to understand the basic ideas behind them with out getting lost in the details. I (as a graduate student in theoretical CS) felt it is non-technical enough as to be readable and yet improved both my knowledge of the field and its techniques, and my "maturity" regarding the concepts involved.
4 of 4 people found the following review helpful:
5.0 out of 5 stars
Good book for a better understanding of cryptography,
By Pedro (V.N.Gaia Portugal) - See all my reviews
This review is from: Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Algorithms and Combinatorics) (Hardcover)
This boook is not an introductory one although it could be read by almost everyone. It cover many facets of cryptography as randomness, zero knowledge proofs and interactive proofs. It also gives a good background of this ideas.The book can be read by everyone who is interested on cryptography, secure intrnet and alike. But needs a background on CS.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
Cryptography is concerned with the construction of schemes which are robust against malicious attempts to make these schemes deviate from their prescribed functionality. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
space pseudorandom generators, logarithmic randomness, probabilistic proof systems, probabilistic checkable proofs, pcp systems, independence generator, theoretic secrecy, prover strategy, internal coin tosses, computational indistinguishability, global coin, pseudorandom functions, interactive proof systems, intractability assumptions, soundness error, probability ensembles, stretch function, minimum weight perfect matching, definitional activity, interactive proofs, randomness complexity, uniformly selects, trapdoor permutation, archetypical case, stretching function Key Phrases - Capitalized Phrases (CAPs): (learn more)
Modern Cryptography, Nisan's Generator, Threshold Cryptography New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Cryptography is concerned with the construction of schemes which are robust against malicious attempts to make these schemes deviate from their prescribed functionality. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
space pseudorandom generators, logarithmic randomness, probabilistic proof systems, probabilistic checkable proofs, pcp systems, independence generator, theoretic secrecy, prover strategy, internal coin tosses, computational indistinguishability, global coin, pseudorandom functions, interactive proof systems, intractability assumptions, soundness error, probability ensembles, stretch function, minimum weight perfect matching, definitional activity, interactive proofs, randomness complexity, uniformly selects, trapdoor permutation, archetypical case, stretching function Key Phrases - Capitalized Phrases (CAPs): (learn more)
Modern Cryptography, Nisan's Generator, Threshold Cryptography New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 19
books:
See all 19 books this book cites
16
books
cite this book:
See all 16 books citing this book
- Computer Science: A Breadth-First Approach with C by John Impagliazzo in Back Matter (1), Back Matter (2), and Back Matter (3)
- Randomized Algorithms by Rajeev Motwani in Back Matter (1), and Back Matter (2)
- Foundations of Computer Science by Ashok Arora in Back Matter (1), and Back Matter (2)
- Communication Complexity by Eyal Kushilevitz in Back Matter (1), and Back Matter (2)
- Computer Science (Watts Library) by Robert L. Perry in Back Matter
See all 19 books this book cites
- Foundations of Cryptography Volume II Basic Applications by Oded Goldreich in Front Matter, and Back Matter
- Foundations of Cryptography: Volume 1, Basic Tools (Vol 1) by Oded Goldreich in Front Matter, and Back Matter
- A Classical Introduction to Cryptography: Applications for Communications Security by Serge Vaudenay in Back Matter (1), and Back Matter (2)
- Introduction to Cryptography (Undergraduate Texts in Mathematics) by Johannes Buchmann in Back Matter
- Introduction to Coding Theory (Discrete Mathematics and Its Applications) by Juergen Bierbrauer in Back Matter
See all 16 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
