Privacy Amplification from Non-malleable Codes-Reference-Cited by-同舟云学术

Privacy Amplification from Non-malleable Codes

Published:2019 Issue: Volume: Page:318-337
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chattopadhyay Eshan,Kanukurthi Bhavana,Obbattu Sai Lakshmi Bhavana,Sekar Sruthi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-35423-7_16

Reference36 articles.

1. Lecture Notes in Computer Science;D Aggarwal,2016

2. Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14–17 June 2015, pp. 459–468 (2015). https://doi.org/10.1145/2746539.2746544

3. Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May–03 June 2014, pp. 774–783 (2014). https://doi.org/10.1145/2591796.2591804

4. Aggarwal, D., Obremski, M.: Inception makes non-malleable codes shorter as well! IACR Cryptology ePrint Archive 2019/399 (2019). https://eprint.iacr.org/2019/399

5. Lecture Notes in Computer Science;S Agrawal,2015

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

1. Extractors: Low Entropy Requirements Colliding with Non-malleability;Advances in Cryptology – CRYPTO 2023;2023

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

3. Rate one-third non-malleable codes;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. Nonmalleable Extractors and Codes, with Their Many Tampered Extensions;SIAM Journal on Computing;2020-01