Non-Malleable Encryption: Simpler, Shorter, Stronger

DOI10.1007/978-3-662-49096-9_13zbMath1388.94043OpenAlexW2293462456MaRDI QIDQ2796130

Sandro Coretti, Björn Tackmann, Yevgeniy Dodis, Daniele Venturi

Publication date: 23 March 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

Non-malleable codes for bounded parallel-time tampering ⋮ Practical continuously non-malleable randomness encoders in the random oracle model ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Interactive non-malleable codes ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ 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 ⋮ Naor-Yung Paradigm with Shared Randomness and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-malleable coding against bit-wise and split-state tampering
• Probabilistic encryption
• Non-malleable Codes from Two-Source Extractors
• Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
• Bounded CCA2-Secure Encryption
• Relations Among Notions of Non-malleability for Encryption
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Practical Chosen Ciphertext Secure Encryption from Factoring
• A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
• Nonmalleable Cryptography
• Bit Encryption Is Complete
• Non-malleable codes from additive combinatorics
• From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
• Advances in Cryptology - CRYPTO 2003
• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Continuous Non-malleable Codes
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One

This page was built for publication: Non-Malleable Encryption: Simpler, Shorter, Stronger