Non-malleable Codes from Two-Source Extractors

DOI10.1007/978-3-642-40084-1_14zbMath1316.94068MaRDI QIDQ2849399

Tomasz Kazana, Stefan Dziembowski, Maciej Obremski

Publication date: 17 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_14

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Non-Malleable Codes from Additive Combinatorics, Non-malleable Codes with Split-State Refresh, Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes, Continuously non-malleable codes with split-state refresh, Four-state non-malleable codes with explicit constant rate, Affine-evasive sets modulo a prime, Bounded tamper resilience: how to go beyond the algebraic barrier, Non-malleable coding against bit-wise and split-state tampering, Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments, Continuously non-malleable secret sharing for general access structures, Interactive non-malleable codes, Strong continuous non-malleable encoding schemes with tamper-detection, 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, Non-Malleable Encryption: Simpler, Shorter, Stronger, Information-Theoretic Local Non-malleable Codes and Their Applications, Optimal Computational Split-state Non-malleable Codes, Codes for Detection of Limited View Algebraic Tampering