A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence-Reference-Cited by-同舟云学术

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence

Published:2020 Issue: Volume: Page:544-573
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2020
language:
Short-container-title:

Author:

Berman Itay,Haitner Iftach,Tsfadia Eliad

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-56877-1_19

Reference25 articles.

1. Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19–22 October 1997, pp. 374–383 (1997)

2. Berman, I., Haitner, I., Tsfadia, E.: A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence. Cryptology ePrint Archive, Report 2019/393 (2019). https://eprint.iacr.org/2019/393

3. Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. J. ACM 43(2), 831–871 (2014)

4. Lecture Notes in Computer Science;R Canetti,2005

5. Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6, 125–145 (2002). https://doi.org/10.1007/PL00012580

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

1. An Efficient Quantum Parallel Repetition Theorem and Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Smooth and Stepwise Self-Distillation for Object Detection;2023 IEEE International Conference on Image Processing (ICIP);2023-10-08

3. Tight State-Restoration Soundness in the Algebraic Group Model;Advances in Cryptology – CRYPTO 2021;2021