Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar. Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters. Electronic Colloquium on Computational Complexity (ECCC), 28:117, 2021. [doi]
@article{AggarwalKOOS21,
title = {Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters},
author = {Divesh Aggarwal and Bhavana Kanukurthi and Sai Lakshmi Bhavana Obbattu and Maciej Obremski and Sruthi Sekar},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/117},
researchr = {https://researchr.org/publication/AggarwalKOOS21},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {28},
pages = {117},
}