Interactive proofs under continual memory leakage

DOI10.1007/978-3-662-44381-1_10MaRDI QIDQ2874536zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Omkant Pandey, Prabhanjan Ananth

Publication date 7 August 2014

Published in Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44381-1_10

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)

Recommendations

• Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
• Leakage-resilient zero knowledge
• Noninteractive Zero-Knowledge
• Removing Interaction from Zero-Knowledge Proofs
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

Cited in

(7)

• Constant-round leakage-resilient zero-knowledge from collision resistance
• Fully homomorphic NIZK and NIWI proofs
• Continuous leakage-resilient certificate-based encryption
• Deterministic Public-Key Encryption Under Continual Leakage
• Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption
• Memory leakage-resilient secret sharing schemes
• Fully Leakage-Resilient Codes

This page was built for publication: Interactive proofs under continual memory leakage

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