Upper and lower bounds for continuous non-malleable codes

DOI10.1007/978-3-030-17253-4_18MaRDI QIDQ2289220zbMATH OpenOpenAlexFDO

Authors Dana Dachman-Soled, Mukul Kulkarni

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17253-4_18

zbMATH Keywords

black-box impossibilitycontinuous non-malleable codessplit-state

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Continuously non-malleable codes in the split-state model from minimal assumptions
• Continuously non-malleable codes in the split-state model
• Continuous non-malleable codes
• Continuous non-malleable codes in the 8-split-state model
• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments

Cited in

(13)

• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Practical continuously non-malleable randomness encoders in the random oracle model
• Continuous space-bounded non-malleable codes from stronger proofs-of-space
• Non-malleable encryption: simpler, shorter, stronger
• Continuously non-malleable codes in the split-state model
• Capacity of non-malleable codes
• Non-Malleable Codes from Additive Combinatorics
• Continuously non-malleable codes against bounded-depth tampering
• On the limits of non-interactive blind signatures
• Continuously non-malleable codes in the split-state model from minimal assumptions
• A new upper bound on the rate of non-binary codes
• A new upper bound on nonbinary block codes

This page was built for publication: Upper and lower bounds for continuous non-malleable codes

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