Leakage-Tolerant Interactive Protocols

DOI10.1007/978-3-642-28914-9_15zbMath1296.94088OpenAlexW1601062705MaRDI QIDQ2891488

Ran Canetti, Nir Bitansky, Shai Halevi

Publication date: 15 June 2012

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_15

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (20)

Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation ⋮ Leakage-resilient cryptography from minimal assumptions ⋮ Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption ⋮ Adaptively secure computation for RAM programs ⋮ Strong authenticated key exchange with auxiliary inputs ⋮ A more complete analysis of the signal double ratchet algorithm ⋮ Leakage-resilient cryptography from puncturable primitives and obfuscation ⋮ On the Connection between Leakage Tolerance and Adaptive Security ⋮ Leakage-resilient coin tossing ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Predictable Arguments of Knowledge ⋮ Fully Leakage-Resilient Codes ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model

This page was built for publication: Leakage-Tolerant Interactive Protocols