Logo - springer
Slogan - springer

Computer Science - Security and Cryptology | A Study of Statistical Zero-Knowledge Proofs

A Study of Statistical Zero-Knowledge Proofs

Vadhan, Salil P.

2014, Approx. 190 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


ISBN 978-3-540-71374-6

digitally watermarked, no DRM

The eBook version of this title will be available soon

learn more about Springer eBooks

add to marked items


Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

approx. $79.95

(net) price for USA

ISBN 978-3-540-71373-9

free shipping for individuals worldwide

Due: July 10, 2016

add to marked items

  • About this textbook

  • The author won the ACM Doctoral Dissertation Award (2000) for the best Ph.D. thesis in Electrical Engineering and Computer Science, and this book is based on that Ph.D.

Zero-knowledge interactive proofs play a central role in the design and study of cryptographic protocols and are rich objects for complexity-theoretic study. Statistical zero-knowledge (SZK) proofs achieve strong information-theoretic "security", and can provide a clean test bed for the study of more general notions that incorporate computational security.

This monograph is a revised and extended version of the author's PhD thesis, the winning thesis of the 2000 ACM Doctoral Dissertation Competition. It is a comprehensive investigation of statistical zero-knowledge (SZK) proofs. It begins by showing that SZK has two natural complete problems, and then uses these complete problems to address a wide variety of fundamental questions about SZK. It also includes a chapter that surveys recent developments in the area, in particular how the results and techniques of this thesis have been extended to computational zero-knowledge proofs and arguments.

The presentation offers clarity and intuition, assuming only a basic background in computational complexity and cryptography, and thus the book can bring a graduate student or a researcher in a related area up to date on this topic. At the same time, it includes clear statements of numerous open problems and research directions, which are likely to interest experts in the area.

Content Level » Research

Keywords » Computational complexity - Cryptography - Entropy - Security - Statistical difference - Zero-knowledge interactive proofs

Related subjects » Security and Cryptology - Theoretical Computer Science

Table of contents 

Introduction.- Definitions.- Complete Problems.- Applications of the Complete Problems.- Private Coins vs. Public Coins.- Coping with Cheating Verifiers.- Noninteractive SZK.- Subsequent Work and Conclusions.- App. A, Chernoff Bounds.- App. B, Hashing Lemmas.- References

Popular Content within this publication 



Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Data Structures, Cryptology and Information Theory.