From single-bit to multi-bit public-key encryption via non-malleable codes

DOI10.1007/978-3-662-46494-6_22zbMATH Open1359.94581OpenAlexW2264903995MaRDI QIDQ5261643FDOQ5261643

Björn Tackmann, Sandro Coretti, Ueli M. Maurer, D. 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

Recommendations

• Non-malleable encryption: simpler, shorter, stronger
• Non-malleable encryption: simpler, shorter, stronger
• Continuously non-malleable codes in the split-state model
• Efficient completely non-malleable public key encryption
• Automata, Languages and Programming

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (25)

• 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
• Continuously non-malleable codes against bounded-depth tampering
• The Chaining Lemma and Its Application
• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
• Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
• Query-Complexity Amplification for Random Oracles
• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Non-malleable codes for bounded parallel-time tampering
• Strong continuous non-malleable encoding schemes with tamper-detection
• Non-Malleable Encryption: Simpler, Shorter, Stronger
• Practical continuously non-malleable randomness encoders in the random oracle model
• An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
• Non-Malleable Codes from Additive Combinatorics
• Optimal Computational Split-state Non-malleable Codes
• Information-Theoretic Local Non-malleable Codes and Their Applications
• Interactive non-malleable codes
• Continuously non-malleable codes with split-state refresh
• Four-state non-malleable codes with explicit constant rate
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
• Non-malleability against polynomial tampering
• Bounded tamper resilience: how to go beyond the algebraic barrier
• A black-box construction of non-malleable encryption from semantically secure encryption

This page was built for publication: From single-bit to multi-bit public-key encryption via non-malleable codes

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