Pseudorandomness and Cryptographic Applications

The book stresses rigorous definitions and proofs.

Pseudorandomness and Cryptographic Applications

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.

More Books:

Pseudorandomness and Cryptographic Applications
Language: en
Pages: 248
Authors: Michael Luby
Categories: Mathematics
Type: BOOK - Published: 2019-12-31 - Publisher: Princeton University Press

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
Cryptographic Applications of Analytic Number Theory
Language: en
Pages: 414
Authors: Igor Shparlinski
Categories: Mathematics
Type: BOOK - Published: 2013-03-07 - Publisher: Birkhäuser

The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial
Public Key Cryptography - PKC 2007
Language: en
Pages: 498
Authors: Tatsuaki Okamoto, Xiaoyun Wang
Categories: Computers
Type: BOOK - Published: 2007-06-21 - Publisher: Springer

This book constitutes the refereed proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography, PKC 2007, held in Beijing, China in April 2007. The 29 revised full papers presented together with two invited lectures are organized in topical sections on signatures, cryptanalysis, protocols, multivariate cryptosystems, encryption,
Trust, Privacy and Security in Digital Business
Language: en
Pages: 221
Authors: Steven Furnell, Costas Lambrinoudakis, Günther Pernul
Categories: Business & Economics
Type: BOOK - Published: 2011-08-19 - Publisher: Springer Science & Business Media

This book constitutes the refereed proceedings of the 8th International Conference on Trust and Privacy in Digital Business, TrustBus 2011, held in Toulouse, France, in August/September 2011 in conjunction with DEXA 2011. The 18 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are organized
Fast Software Encryption
Language: en
Pages: 316
Authors: Fse'9 1999
Categories: Business & Economics
Type: BOOK - Published: 1999-06-29 - Publisher: Springer Science & Business Media

This book constitutes the thoroughly refereed post-workshop proceedings of the 6th International Workshop on Fast Software Encryption, FSE'99, held in Rome, Italy, in March 1999. The 22 revised full papers presented were carefully selected from a total of 51 submissions during two rounds of reviewing and revision. The volume is