Unprovability of leakage-resilient cryptography beyond the information-theoretic limit

DOI10.1007/978-3-030-57990-6_31zbMATH Open1506.94058OpenAlexW3083746739MaRDI QIDQ2106672FDOQ2106672

Authors: Rafael Pass 

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-57990-6_31

Recommendations

• Limits of a conjecture on a leakage-resilient cryptosystem
• Leakage-resilient cryptography from minimal assumptions
• Leakage-resilient cryptography from minimal assumptions
• Leakage-resilient symmetric cryptography under empirically verifiable assumptions
• Quantifying information leakage of randomized protocols
• Quantifying information leakage of randomized protocols
• Unconditionally secure computation against low-complexity leakage
• Unconditionally secure computation against low-complexity leakage
• Leakage-resilient cryptography from puncturable primitives and obfuscation

zbMATH Keywords

cryptographic protocolscollision-resistant hash functions

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60)

Cited In (3)

• The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Leakage-resilient storage

This page was built for publication: Unprovability of leakage-resilient cryptography beyond the information-theoretic limit

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