Impossibility of Black-Box Simulation Against Leakage Attacks
From MaRDI portal
Publication:3457063
DOI10.1007/978-3-662-48000-7_7zbMath1336.94068MaRDI QIDQ3457063
Ivan Visconti, Rafail Ostrovsky, Giuseppe Persiano
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_7
MPC; zero knowledge; impossibility results; succinct arguments; black-box vs non-black-box simulation; resettability
94A60: Cryptography
Related Items
Fully Leakage-Resilient Codes, Constructing tree decompositions of graphs with bounded gonality, Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model, Constant-round leakage-resilient zero-knowledge from collision resistance
Cites Work
- Leakage-resilient coin tossing
- Fully leakage-resilient signatures
- Secure Computation against Adaptive Auxiliary Information
- Leakage-Resilient Circuits without Computational Assumptions
- Leakage-Tolerant Interactive Protocols
- Leakage-Resilient Coin Tossing
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Securing Computation against Continuous Leakage
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Noninteractive Zero-Knowledge
- On the Composition of Zero-Knowledge Proof Systems
- Rate-Limited Secure Function Evaluation: Definitions and Constructions
- On the Connection between Leakage Tolerance and Adaptive Security
- Leakage-Resilient Zero Knowledge
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Achieving Constant Round Leakage-Resilient Zero-Knowledge
