Constant-round leakage-resilient zero-knowledge from collision resistance

DOI10.1007/s00145-022-09426-2zbMath1487.94126OpenAlexW3029673330MaRDI QIDQ2135523

Susumu Kiyoshima

Publication date: 9 May 2022

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-022-09426-2

zbMATH Keywords

zero-knowledgeleakage resilienceinstance-dependent commitmentnon-black-box simulation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Bit commitment using pseudorandomness
• Minimum disclosure proofs of knowledge
• How to construct constant-round zero-knowledge proof systems for NP
• Leakage-resilient coin tossing
• Leakage resilient secret sharing and applications
• Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
• Secure Computation against Adaptive Auxiliary Information
• Leakage-Tolerant Computation with Input-Independent Preprocessing
• Interactive Proofs under Continual Memory Leakage
• Leakage-Tolerant Interactive Protocols
• Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Impossibility of Black-Box Simulation Against Leakage Attacks
• Concurrent Nonmalleable Commitments
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Universally composable two-party and multi-party secure computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• Universal Arguments and their Applications
• The Knowledge Complexity of Interactive Proof Systems
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Statistical secrecy and multibit commitments
• Foundations of Cryptography
• Equivocating Yao
• Leakage-Resilient Zero Knowledge
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Multiparty computation secure against continual memory leakage
• Better Two-Round Adaptive Multi-party Computation
• Achieving Constant Round Leakage-Resilient Zero-Knowledge
• On the local leakage resilience of linear secret sharing schemes