On sequential composition of precise zero-knowledge

DOI10.1007/S12204-010-9720-3MaRDI QIDQ615298zbMATH OpenOpenAlexFDO

Authors Ning Ding, Dawu Gu

Publication date 5 January 2011

Published in Journal of Shanghai Jiaotong University (Science) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12204-010-9720-3

zbMATH Keywords

cryptographyzero-knowledgeprecise zero-knowledge

Mathematics Subject Classification ID

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

Recommendations

• Precise Concurrent Zero Knowledge
• Precise time and space simulatable zero-knowledge
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• On the Composition of Zero-Knowledge Proof Systems
• scientific article; zbMATH DE number 1304087

Cites work

• Definitions and properties of zero-knowledge proof systems
• Local zero knowledge
• Minimum disclosure proofs of knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(6)

• On the Composition of Zero-Knowledge Proof Systems
• scientific article; zbMATH DE number 1676657 (Why is no real title available?)
• Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work
• Precise Concurrent Zero Knowledge
• Precise time and space simulatable zero-knowledge

This page was built for publication: On sequential composition of precise zero-knowledge

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