Aggarwal, D and Kanukurthi, B and Obbattu, SLB and Obremski, M and Sekar, S (2022) Rate one-third non-malleable codes. In: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 20 - 24 June 2022, Rome, pp. 1364-1377.
|
PDF
STOC_2022.pdf - Published Version Download (1MB) | Preview |
Abstract
At ITCS 2010, Dziembowski, Pietrzak, and Wichs introduced Non-malleable Codes (NMCs) which protect against tampering of a codeword of a given message into the codeword of a related message. A well-studied model of tampering is the 2-split-state model where the codeword consists of two independently tamperable states. As with standard error-correcting codes, it is of great importance to build codes with high rates. Following a long line of work, Aggarwal and Obremski (FOCS 2020) showed the first constant rate non-malleable code in the 2-split state model; however, this constant was a minuscule 10-6! In this work, we build a Non-malleable Code with rate 1/3. This nearly matches the rate 1/2 lower bound for this model due to Cheraghchi and Guruswami (ITCS 2014). Our construction is simple, requiring just an inner-product extractor, a seeded extractor, and an affine-evasive function.
| Item Type: | Conference Poster |
|---|---|
| Publication: | Proceedings of the Annual ACM Symposium on Theory of Computing |
| Publisher: | Association for Computing Machinery |
| Additional Information: | The copyright for this article belongs to the Author(s). |
| Keywords: | Code-words; Constant rate; Error correcting code; High rate; Long line; Low bound; Non-malleable codes; Randomness extractors; Split-state models; Standard errors |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 17 Sep 2022 03:30 |
| Last Modified: | 17 Sep 2022 03:30 |
| URI: | https://eprints.iisc.ac.in/id/eprint/76583 |
Actions (login required)
 |
View Item |
