Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs-Reference-Cited by-同舟云学术

Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs

Published:2024-06-10 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 56th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Debris-Alazard Thomas¹^ORCID,Fallahpour Pouria²^ORCID,Stehlé Damien³^ORCID

Affiliation:

1. Inria and Laboratoire LIX, École Polytechnique, Palaiseau, France

2. ENS de Lyon and LIP (CNRS, U. Lyon, ENS de Lyon, Inria, UCBL), Lyon, France

3. ENS de Lyon and LIP (CNRS, U. Lyon, ENS de Lyon, Inria, UCBL), Lyon, France / CryptoLab Inc., Lyon, France

Funder

Agence Nationale de la Recherche

Publisher

ACM

Link

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

Reference36 articles.

1. Martin R. Albrecht Valerio Cini Russell W. F. Lai Giulio Malavolta and Sri Aravinda Krishnan Thyagarajan. 2022. Lattice-Based SNARKs: Publicly Verifiable Preprocessing and Recursively Composable. In CRYPTO.

2. Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, and Ngoc Khanh Nguyen. 2023. SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. Available at https://eprint.iacr.org/2023/1469

3. Eli Ben-Sasson Alessandro Chiesa and Nicholas Spooner. 2016. Interactive Oracle Proofs. In TCC-B.

4. SIAM J. Comput;Bitansky Nir

5. Nir Bitansky Alessandro Chiesa Yuval Ishai Rafail Ostrovsky and Omer Paneth. 2013. Succinct Non-interactive Arguments via Linear Interactive Proofs. In TCC.

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

1. Lattice-Based Post-Quantum Public Key Encryption Scheme Using ElGamal’s Principles;Cryptography;2024-07-08

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