A Study of Statistical Zero-Knowledge Proofs

Vadhan, Salil P.

  • 出版商: Springer
  • 出版日期: 2024-08-07
  • 售價: $3,130
  • 貴賓價: 9.5$2,974
  • 語言: 英文
  • 頁數: 190
  • 裝訂: Hardcover - also called cloth, retail trade, or trade
  • ISBN: 3540713735
  • ISBN-13: 9783540713739
  • 尚未上市,歡迎預購

商品描述

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.

商品描述(中文翻譯)

零知識互動證明在密碼學協議的設計和研究中扮演著核心角色,並且是複雜性理論研究的豐富對象。統計零知識(SZK)證明實現了強信息理論上的“安全性”,並且可以為包含計算安全性的更一般概念的研究提供一個清晰的測試平台。

本專著是作者博士論文的修訂和擴展版本,該論文獲得了2000年ACM博士論文競賽的獲獎論文。它是對統計零知識(SZK)證明的全面研究。首先,它展示了SZK具有兩個自然的完全問題,然後利用這些完全問題來解決關於SZK的各種基本問題。它還包括一章對該領域最近的發展進行了調查,特別是該論文的結果和技術如何擴展到計算零知識證明和論證。

該專著的呈現清晰易懂,僅需基本的計算複雜性和密碼學背景,因此可以使研究生或相關領域的研究人員對這個主題有所了解。同時,它還包含了許多開放問題和研究方向的清晰陳述,這些問題和方向可能會引起該領域的專家的興趣。