Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Algorithms and Combinatiorics, Vol 17)

Rating:
Summary: Excellent survey
Review: 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.

Rating:
Summary: Excellent survey
Review: 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.

Rating:
Summary: Good book for a better understanding of cryptography
Review: 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.
The author hass a webpage with some of the material that lead to the book. It is a good idea to read them first and them decide on the book.