Capacity of Non-Malleable Codes

DOI10.1109/TIT.2015.2511784zbMath1359.94884OpenAlexW2569930253MaRDI QIDQ2976946

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

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

Related Items (4)

Non-malleable codes for bounded parallel-time tampering ⋮ Interactive non-malleable codes ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions

This page was built for publication: Capacity of Non-Malleable Codes