Single-prover concurrent zero knowledge in almost constant rounds

DOI10.1007/11523468_19MaRDI QIDQ5716776zbMATH OpenOpenAlexFDO

Authors Giuseppe Persiano, Ivan Visconti

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A note on the round-complexity of concurrent zero-knowledge
• scientific article; zbMATH DE number 1775426
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• On the concurrent composition of zero-knowledge proofs
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds

Cited in

(9)

• Hybrid commitments and their applications to zero-knowledge proof systems
• Resettably-sound resettable zero knowledge in constant rounds
• Random walks and concurrent zero-knowledge
• Constant-round concurrent zero knowledge in the bounded player model
• Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• Responsive round complexity and concurrent zero knowledge
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• On Constant-Round Concurrent Zero-Knowledge

This page was built for publication: Single-prover concurrent zero knowledge in almost constant rounds

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