Pseudorandomness and Cryptographic Applications

Michael Luby

ISBN 10: 0691025460 / ISBN 13: 9780691025469

Published by Princeton University Press, 1996

About this Item

Pseudorandomness and Cryptographic Applications | Michael Luby | Taschenbuch | Einband - flex.(Paperback) | Englisch | 1996 | Princeton University Press | EAN 9780691025469 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 107492754

Bibliographic Details

• Title: Pseudorandomness and Cryptographic Applications
• Publisher: Princeton University Press
• Publication Date: 1996
• Language: English
• ISBN 10: 0691025460
• ISBN 13: 9780691025469
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 229W x 152H x 15D millimeters 229 millimeters width by 152 millimeters height by 15 millimeters depth
• Weight: 421 grams
• Seller catalogs:
  • Bücher

About this title

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.

About the Author

Michael Luby is the Leader of the Theory Group and a Research Scientist at the International Computer Science Institute in Berkeley, California. He is also an Adjunct Professor in the Computer Science Division at the University of California, Berkeley.