Precise zero-knowledge arguments with poly-logarithmic efficiency

DOI10.1007/S12204-009-0584-3zbMATH Open1202.94180OpenAlexW1538794869MaRDI QIDQ615245FDOQ615245

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-009-0584-3

Recommendations

• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Zero-knowledge argument for simultaneous discrete logarithms
• Zero-knowledge argument for simultaneous discrete logarithms
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Zero knowledge with efficient provers
• Efficient batch zero-knowledge arguments for low degree polynomials
• On Efficient Zero-Knowledge PCPs
• Efficient zero-knowledge proofs. (Abstract)
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials

zbMATH Keywords

cryptographyzero-knowledgeprecise zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Bit commitment using pseudorandomness
• Minimum disclosure proofs of knowledge
• Title not available (Why is that?)
• Foundations of Cryptography
• The Knowledge Complexity of Interactive Proof Systems
• Local zero knowledge
• Advances in Cryptology - CRYPTO 2003

Cited In (3)

• On Efficient Zero-Knowledge PCPs
• Polynomial-Space Approximation of No-Signaling Provers
• Precise Concurrent Zero Knowledge

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

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