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

DOI10.1007/978-3-662-46494-6_22MaRDI QIDQ5261643zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(25)

• A black-box construction of non-malleable encryption from semantically secure encryption
• Query-complexity amplification for random oracles
• 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
• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
• 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
• Optimal computational split-state non-malleable codes
• Practical continuously non-malleable randomness encoders in the random oracle model
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
• Non-Malleable Codes from Additive Combinatorics
• Information-Theoretic Local Non-malleable Codes and Their Applications
• Interactive non-malleable codes
• Non-malleability against polynomial tampering
• 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
• The Chaining Lemma and its application
• Bounded tamper resilience: how to go beyond the algebraic barrier

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)