Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption

DOI10.1007/978-3-319-19962-7_15zbMath1368.94139OpenAlexW1108912675MaRDI QIDQ3194601

Ting-Ting Zhang, Guifang Huang, Hongda Li

Publication date: 20 October 2015

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19962-7_15

zbMATH Keywords

bilinear mapknowledge of exponent assumptionleakage-resilient zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive Proofs under Continual Memory Leakage
• Leakage-Tolerant Interactive Protocols
• On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Perfect Non-interactive Zero Knowledge for NP
• Perfect NIZK with Adaptive Soundness
• Statistically Hiding Sets
• The knowledge complexity of interactive proof-systems
• Leakage-Resilient Zero Knowledge
• Advances in Cryptology – CRYPTO 2004
• Multiparty computation secure against continual memory leakage
• Concurrent zero-knowledge
• Achieving Constant Round Leakage-Resilient Zero-Knowledge
• Topics in Cryptology – CT-RSA 2006

This page was built for publication: Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption