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...

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Rosen, Alon (Auteur)
Collectivité auteur: SpringerLink (Online service)
Format: Électronique eBook
Langue:Inglés
Publié: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Édition:1st ed. 2006.
Collection:Information Security and Cryptography,
Sujets:
Computer programming.
Data structures (Computer science).
Information theory.
Computer science.
Programming Techniques.
Data Structures and Information Theory.
Theory of Computation.
Accès en ligne:Texto Completo
Table des matières:
  • 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).

Documents similaires