Capacity of non-malleable codes

DOI10.1109/TIT.2015.2511784MaRDI QIDQ2976946zbMATH OpenOpenAlexFDO

Authors Mahdi Cheraghchi, Venkatesan Guruswami

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2015.2511784

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Recommendations

• Capacity of non-malleable codes
• Non-malleable codes
• Non-malleable codes for bounded depth, bounded fan-in circuits
• Non-malleable reductions and applications
• Efficient non-malleable codes and key-derivation for poly-size tampering circuits

Cited in

(13)

• Non-malleable codes for bounded parallel-time tampering
• Interactive non-malleable codes
• Continuously non-malleable codes in the split-state model
• Capacity of non-malleable codes
• The capacity of coded systems
• The capacity and coding gain of certain checkerboard codes
• Non-Malleable Codes from Additive Combinatorics
• Nonmalleable extractors and codes, with their many tampered extensions
• Rate one-third non-malleable codes
• Non-malleable codes with optimal rate for poly-size circuits
• Split-state non-malleable codes and secret sharing schemes for quantum messages
• Codes for adversaries: between worst-case and average-case jamming
• On split-state quantum tamper detection

This page was built for publication: Capacity of non-malleable codes

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