Parallel Repetition for Leakage Resilience Amplification Revisited

DOI10.1007/978-3-642-19571-6_5MaRDI QIDQ3000532zbMATH OpenOpenAlexFDO

Authors Abhishek Jain, Krzysztof Pietrzak

Publication date 19 May 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-19571-6_5

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A parallel repetition theorem for leakage resilience
• Leakage-resilient circuits without computational assumptions
• Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
• On the leakage of corrupted garbled circuits
• A Leakage-Resilient Mode of Operation
• Efficient leakage resilient circuit compilers
• Robust characterization of leakage errors
• Protecting circuits from computationally bounded and noisy leakage
• Simulatable leakage: analysis, pitfalls, and new constructions

Cited in

(7)

• Incompressible encodings
• A parallel repetition theorem for leakage resilience
• Multi-location leakage resilient cryptography
• Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
• Leakage-resilient cryptography from minimal assumptions
• On the connection between leakage tolerance and adaptive security
• IBE with incompressible master secret and small identity secrets

This page was built for publication: Parallel Repetition for Leakage Resilience Amplification Revisited

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