Parallel Repetition of $$(k_1,\dots ,k_{\mu })$$-Special-Sound Multi-round Interactive Proofs-Reference-Cited by-同舟云学术

Parallel Repetition of $$(k_1,\dots ,k_{\mu })$$-Special-Sound Multi-round Interactive Proofs

Published:2022 Issue: Volume: Page:415-443
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2022
language:
Short-container-title:

Author:

Attema Thomas,Fehr Serge

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-15802-5_15

Reference25 articles.

1. Lecture Notes in Computer Science;T Attema,2020

2. Lecture Notes in Computer Science;T Attema,2021

3. Attema, T., Cramer, R., Kohl, L.: A compressed $$\Sigma $$-protocol theory for lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 549–579. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-84245-1_19

4. Lecture Notes in Computer Science;T Attema,2021

5. Attema, T., Cramer, R., Xing, C.: A note on short invertible ring elements and applications to cyclotomic and trinomials number fields. Math. Cryptology 1, 45–70 (2021)

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

1. Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency;Journal of Cryptology;2024-07

2. PERK: compact signature scheme based on a new variant of the permuted kernel problem;Designs, Codes and Cryptography;2024-03-27

3. SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions;Lecture Notes in Computer Science;2024

4. Greyhound: Fast Polynomial Commitments from Lattices;Lecture Notes in Computer Science;2024

5. Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup;Lecture Notes in Computer Science;2024