𝔖 Scriptorium
✦   LIBER   ✦
📁

Pseudorandomness and Cryptographic Applications

✍ Scribed by Michael Luby

Publisher
Princeton University Press
Year
2019
Tongue
English
Leaves
255
Series
Princeton Computer Science Notes; 1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack.


There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average.


The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.

📜 SIMILAR VOLUMES

Cryptographic Applications of Analytic N
📁 Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
✍ Igor Shparlinski 📂 Library 📅 2003 🏛 Birkhäuser Basel 🌐 English

<p><P>The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation.</P><P>Key topics and features:</P><P>- various lower bounds on the complexity of some number theoretic and cryptographic problems, assoc

Modern Cryptography, Probabilistic Proof
📁 Modern Cryptography, Probabilistic Proofs and Pseudorandomness
✍ Oded Goldreich 📂 Library 📅 1998 🏛 Springer 🌐 English

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 interp

Modern cryptography, probabilistic proof
📁 Modern cryptography, probabilistic proofs, and pseudorandomness
✍ Goldreich, Oded 📂 Library 📅 1998 🏛 Springer 🌐 English

Криптография, вероятностные доказательства и псевдослучайные процессы в теории вычислительной техники

Modern Cryptography, Probabilistic Proof
📁 Modern Cryptography, Probabilistic Proofs and Pseudorandomness
✍ Oded Goldreich (auth.) 📂 Library 📅 1999 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>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 fundame

Modern Cryptography, Probabilistic Proof
📁 Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Algorithms and Combinatorics)
✍ Oded Goldreich 📂 Library 📅 1998 🏛 Springer 🌐 English

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 interp