Skip to main content
SpringerLink
Log in
Book cover

Concurrent Zero-Knowledge

With Additional Background by Oded Goldreich

  • Book
  • © 2006

Overview

Authors:
  1. Alon Rosen

    1. Harvard University DEAS, Cambridge, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • The first monograph treatment of this subject
  • Includes supplementary material: sn.pub/extras

Part of the book series: Information Security and Cryptography (ISC)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. A Brief Introduction to Zero-Knowledge (by Oded Goldreich)

    Pages 1-24

  3. Introduction to Concurrent Zero-Knowledge

    Pages 25-38

  4. Preliminaries

    Pages 39-47

  5. c\( \mathcal{Z}\mathcal{K} \) Proof Systems for \( \mathcal{N}\mathcal{P} \)

    Pages 49-65

  6. c\( \mathcal{Z}\mathcal{K} \) in Logarithmically Many Rounds

    Pages 67-99

  7. A Simple Lower Bound

    Pages 101-110

  8. Black-Box c\( \mathcal{Z}\mathcal{K} \) Requires Logarithmically Many Rounds

    Pages 111-159

  9. Conclusions and Open Problems

    Pages 161-163

  10. A Brief Account of Other Developments (by Oded Goldreich)

    Pages 165-178

  11. Back Matter

    Pages 179-184
    Download chapter PDF
Back to top

Keywords

About this book

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 cryptography is vast; they are typically used to force malicious parties to behave according to a predetermined protocol. In addition to their direct applicability in cr- tography, zero-knowledge proofs serve as a good benchmark for the study of variousproblemsregardingcryptographicprotocols(e.g.,“securecomposition of protocols”). A fundamental question regarding zero-knowledge protocols refers to the preservation of security (i.e., of the zero-knowledge feature) when many - stances are executed concurrently, and in particular under a purely as- chronous model. The practical importance of this question, in the days of extensive Internet communication, seems clear. It turned out that this qu- tion is also very interesting from a theoretical point of view. In particular, this question served as a benchmark for the study of the security of concurrent executions of protocols and led to the development of techniques for coping with the problems that arise in that setting.

Reviews

From the reviews:

"Protocols that remain zero-knowledge when many instances are executed concurrently are called concurrent zero-knowledge. This book is very well suited for the reader who wants to know the state of the art of concurrent zero-knowledge proofs. … The book could be used as a textbook on advanced topics in cryptography. It is highly recommended to the newcomer in the field who wants technical information, and to the researcher in the area who would like a survey on concurrent zero-knowledge." (Yongge Wang, Mathematical Reviews, Issue 2007 m)

Authors and Affiliations

  • Harvard University DEAS, Cambridge, USA

    Alon Rosen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation