Table of Contents

Front Matter; A Brief Introduction to Zero-Knowledge (by Oded Goldreich); Introduction to Concurrent Zero-Knowledge; Preliminaries; c ZK Proof Systems for NP; c ZK in Logarithmically Many Rounds; A Simple Lower Bound; Black-Box c ZK Requires Logarithmically Many Rounds; Conclusions and Open Problems; A Brief Account of Other Developments (by Oded Goldreich); Back Matter. Protocols that remain zero-knowledge when many instances are executed concurrently are called concurrent zero-knowledge. Devoted to their study, this book presents constructions of concurrent zero-knowledge protocols, along with proofs. It also shows why "traditional" proof techniques are not suitable for establishing the protocol's property.