Rate one-third non-malleable codes

DOI10.1145/3519935.3519972MaRDI QIDQ6083592zbMATH OpenOpenAlexFDO

Authors Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar

Publication date 8 December 2023

Published in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3519935.3519972

zbMATH Keywords

non-malleable codesrandomness extractors

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Capacity of non-malleable codes
• Capacity of non-malleable codes
• Optimal ternary linear rate 1/2 codes
• Non-Malleable Codes from Additive Combinatorics
• On quasi-cyclic codes with rate l m (Corresp.)
• Continuous non-malleable codes
• Non-malleable codes
• Block-wise non-malleable codes
• A new upper bound on the rate of non-binary codes
• Explicit rate-1 non-malleable codes for local tampering

Cited in

(6)

• High Sum-Rate Three-Write and Nonbinary WOM Codes
• Extractors: low entropy requirements colliding with non-malleability
• Non-malleable codes with optimal rate for poly-size circuits
• Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
• Split-state non-malleable codes and secret sharing schemes for quantum messages
• On split-state quantum tamper detection

This page was built for publication: Rate one-third non-malleable codes

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