Non-malleable codes and extractors for small-depth circuits, and affine functions-Reference-Cited by-同舟云学术

Non-malleable codes and extractors for small-depth circuits, and affine functions

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Chattopadhyay Eshan¹,Li Xin²

Affiliation:

1. IAS, USA

2. Johns Hopkins University, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3055399.3055483

Reference55 articles.

1. D. Aggarwal Y. Dodis T. Kazana and M. Obremski. 2015. Non-malleable Reductions and Applications. (2015). D. Aggarwal Y. Dodis T. Kazana and M. Obremski. 2015. Non-malleable Reductions and Applications. (2015).

2. To appear in STOC. To appear in STOC.

3. Divesh Aggarwal Yevgeniy Dodis and Shachar Lovett. 2014. Divesh Aggarwal Yevgeniy Dodis and Shachar Lovett. 2014.

4. Non-malleable Codes from Additive Combinatorics. In STOC. Non-malleable Codes from Additive Combinatorics. In STOC.

5. Shashank Agrawal Divya Gupta Hemanta K. Maji Omkant Pandey and Manoj Prabhakaran. 2015. Shashank Agrawal Divya Gupta Hemanta K. Maji Omkant Pandey and Manoj Prabhakaran. 2015.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-malleable Fuzzy Extractors;Lecture Notes in Computer Science;2024

2. Non-malleable Codes with Optimal Rate for Poly-Size Circuits;Lecture Notes in Computer Science;2024

3. Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Efficiently Testable Circuits Without Conductivity;Theory of Cryptography;2023

5. Non-Malleable Code in the Split-State Model;Entropy;2022-07-28