Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters

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]

Authors

Divesh Aggarwal

This author has not been identified. Look up 'Divesh Aggarwal' in Google

Bhavana Kanukurthi

This author has not been identified. Look up 'Bhavana Kanukurthi' in Google

Sai Lakshmi Bhavana Obbattu

This author has not been identified. Look up 'Sai Lakshmi Bhavana Obbattu' in Google

Maciej Obremski

This author has not been identified. Look up 'Maciej Obremski' in Google

Sruthi Sekar

This author has not been identified. Look up 'Sruthi Sekar' in Google