Modern Cryptography, Probabilistic Proofs and Pseudorandomness

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read


Download Options

Buy this book

Last edited by ImportBot
December 25, 2021 | History

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

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.

Publish Date
Language
English
Pages
183

Buy this book

Previews available in: English

Edition Availability
Cover of: Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
1999, Springer Berlin Heidelberg
electronic resource / in English

Add another edition?

Book Details


Table of Contents

Preface
Chapter 1: The Foundations of Modern Cryptography
Chapter 2: Probabilistic Proof Systems
Chapter 3: Pseudorandom Generators
Appendix A: Background on Randomness and Computation
Appendix B: Randomized Computations
Appendix C: Notes on two proofs
Appendix D: Related Surveys by the Author
Bibliography.

Edition Notes

Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.

Published in
Berlin, Heidelberg
Series
Algorithms and Combinatorics -- 17, Algorithms and Combinatorics -- 17

Classifications

Dewey Decimal Class
511.6
Library of Congress
QA164-167.2, QA1-939

The Physical Object

Format
[electronic resource] /
Pagination
1 online resource (xv, 183 p.)
Number of pages
183

ID Numbers

Open Library
OL27075541M
Internet Archive
moderncryptograp00gold_375
ISBN 10
364208432X, 3662125218
ISBN 13
9783642084324, 9783662125212
OCLC/WorldCat
851389639

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
December 25, 2021 Edited by ImportBot import existing book
July 5, 2019 Created by MARC Bot import new book