Precise zero-knowledge arguments with poly-logarithmic efficiency

DOI10.1007/s12204-009-0584-3zbMath1202.94180OpenAlexW1538794869MaRDI QIDQ615245

Ning Ding, Da-Wu 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-009-0584-3

zbMATH Keywords

cryptographyzero-knowledgeprecise zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Bit commitment using pseudorandomness
• Minimum disclosure proofs of knowledge
• Local zero knowledge
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Precise zero-knowledge arguments with poly-logarithmic efficiency