Concurrent Zero-Knowledge With Additional Background by Oded Goldreich /
Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory de?nition; ze- knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of cryptog...
Call Number: | Libro Electrónico |
---|---|
Main Author: | |
Corporate Author: | |
Format: | Electronic eBook |
Language: | Inglés |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2006.
|
Edition: | 1st ed. 2006. |
Series: | Information Security and Cryptography,
|
Subjects: | |
Online Access: | Texto Completo |
Table of Contents:
- A Brief Introduction to Zero-Knowledge (by Oded Goldreich)
- to Concurrent Zero-Knowledge
- Preliminaries
- c Proof Systems for
- c in Logarithmically Many Rounds
- A Simple Lower Bound
- Black-Box c Requires Logarithmically Many Rounds
- Conclusions and Open Problems
- A Brief Account of Other Developments (by Oded Goldreich).