When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems-Reference-Cited by-同舟云学术

When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Chen Lijie¹,Tell Roei²

Affiliation:

1. University of California at Berkeley, Berkeley, USA

2. Institute for Advanced Study, Princeton, USA / Rutgers University, USA

Funder

NSF

Publisher

ACM

Link

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

Reference41 articles.

1. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes

2. James Bartusek , Liron Bronfman , Justin Holmgren , Fermi Ma , and Ron D. Rothblum . 2019. On the (In)security of Kilian-Based SNARGs. In Theory of Cryptography - 17th International Conference , TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II, Dennis Hofheinz and Alon Rosen (Eds.) (Lecture Notes in Computer Science , Vol. 11892). Springer, 522– 551 . James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, and Ron D. Rothblum. 2019. On the (In)security of Kilian-Based SNARGs. In Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II, Dennis Hofheinz and Alon Rosen (Eds.) (Lecture Notes in Computer Science, Vol. 11892). Springer, 522–551.

3. Mihir Bellare and Phillip Rogaway . 1993 . Entity Authentication and Key Distribution. In Advances in Cryptology - CRYPTO ’93 , 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings, Douglas R. Stinson (Ed.) (Lecture Notes in Computer Science , Vol. 773). Springer, 232– 249 . Mihir Bellare and Phillip Rogaway. 1993. Entity Authentication and Key Distribution. In Advances in Cryptology - CRYPTO ’93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings, Douglas R. Stinson (Ed.) (Lecture Notes in Computer Science, Vol. 773). Springer, 232–249.

4. Eli Ben-Sasson , Alessandro Chiesa , and Nicholas Spooner . 2016 . Interactive Oracle Proofs. In Theory of Cryptography - 14th International Conference , TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, Martin Hirt and Adam D. Smith (Eds.) (Lecture Notes in Computer Science , Vol. 9986). 31– 60 . Eli Ben-Sasson, Alessandro Chiesa, and Nicholas Spooner. 2016. Interactive Oracle Proofs. In Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, Martin Hirt and Adam D. Smith (Eds.) (Lecture Notes in Computer Science, Vol. 9986). 31–60.

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

1. Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

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

3. Guest Column: New ways of studying the BPP = P conjecture;ACM SIGACT News;2023-06-13