Modern Cryptography, Probabilistic Proofs and Pseudorandomness...

Features

• Cover Type: Hard Cover with 182 pages
• Published by: Springer
• Edition: 1st Edition December 4, 1998
• Written in: English
• ISBN 10 Number: 354064766X
• ISBN 13 Number: 978-3540647669
• Book Dimensions: 9.4 x 6.3 x 0.6 inches
• Weighs: 14.6 ounces

Product Review


"This book is intended for a reader with some knowledge of the theory of computing. It is divided into three chapters, each a survey of one of the topics mentioned in the title. The chapters may be read independently, and are somewhat different in nature. The book ends with four appendices. The first summarises the probability theory, complexity theory and cryptography that is used in the body of the book. The second gives examples of randomisation in algorithmic problems, complexity theory and distributed computing. The third contains two proofs, not to be found in the literature, of well-known results. The last appendix lists other surveys by the author." (Simon R. Blackburn, Mathematical Reviews)




Product Description
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.

Reader Reviews
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.