From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
From MaRDI portal
Publication:5261643
DOI10.1007/978-3-662-46494-6_22zbMath1359.94581OpenAlexW2264903995MaRDI QIDQ5261643
Björn Tackmann, Sandro Coretti, Ueli M. Maurer, Daniele Venturi
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_22
Related Items (22)
Non-malleable codes for bounded parallel-time tampering ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Practical continuously non-malleable randomness encoders in the random oracle model ⋮ Interactive non-malleable codes ⋮ Query-Complexity Amplification for Random Oracles ⋮ The Chaining Lemma and Its Application ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes ⋮ 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 ⋮ Non-Malleable Encryption: Simpler, Shorter, Stronger ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Optimal Computational Split-state Non-malleable Codes ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Non-malleability against polynomial tampering
This page was built for publication: From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
