The knowledge tightness of parallel zero-knowledge

DOI10.1007/978-3-642-28914-9_29zbMATH Open1296.94102OpenAlexW2119477730MaRDI QIDQ2891503FDOQ2891503

Authors: Kai-Min Chung, Rafael Pass, Wei-Lung Dustin Tseng 

Publication date: 15 June 2012

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_29

Recommendations

• On the Composition of Zero-Knowledge Proof Systems
• scientific article; zbMATH DE number 1304087
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• scientific article; zbMATH DE number 177820
• Lower bounds for concurrent zero knowledge

zbMATH Keywords

Concrete SecurityConcurrent Zero-Knowledge Lower BoundsKnowledge TightnessZero-Knowledge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Cited In (6)

• Title not available (Why is that?)
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• On the Composition of Public-Coin Zero-Knowledge Protocols
• Perfect zero knowledge: new upperbounds and relativized separations
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Title not available (Why is that?)

This page was built for publication: The knowledge tightness of parallel zero-knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891503)