Leakage-resilient non-malleable codes
From MaRDI portal
Publication:5261638
DOI10.1007/978-3-662-46494-6_17zbMATH Open1359.94565OpenAlexW1912212934MaRDI QIDQ5261638FDOQ5261638
Maciej Obremski, Tomasz Kazana, Divesh Aggarwal, Stefan Dziembowski
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_17
Recommendations
Cited In (20)
- Continuously non-malleable codes in the split-state model
- Non-malleable encryption: simpler, shorter, stronger
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Locally decodable and updatable non-malleable codes and their applications
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
- Title not available (Why is that?)
- Capacity of non-malleable codes
- Strong continuous non-malleable encoding schemes with tamper-detection
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
- Continuously non-malleable secret sharing for general access structures
- On the round complexity of black-box secure MPC
- Practical continuously non-malleable randomness encoders in the random oracle model
- Non-Malleable Codes from Additive Combinatorics
- The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Short leakage resilient and non-malleable secret sharing schemes
- Continuously non-malleable codes with split-state refresh
- Fully Leakage-Resilient Codes
- Public key encryption resilient to leakage and tampering attacks
- Bounded tamper resilience: how to go beyond the algebraic barrier
This page was built for publication: Leakage-resilient non-malleable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261638)
