Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits-Reference-Cited by-同舟云学术

Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits

Published:2018 Issue: Volume: Page:669-699
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Baum Carsten,Bootle Jonathan,Cerulli Andrea,del Pino Rafael,Groth Jens,Lyubashevsky Vadim

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96881-0_23

Reference57 articles.

1. Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham et al. [TEMX17], pp. 2087–2104

2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99–108. ACM Press, May 1996

3. Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296, 625–635 (1993)

4. Bunz, B., Bootle, J., Boneh, D., Poelstra, A., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. Cryptology ePrint Archive, Report 2017/1066 (2017). https://eprint.iacr.org/2017/1066

5. Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin and Coron [FC16], pp. 327–357

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

1. Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

2. Decreasing Proof Size of BLS Scheme;The Computer Journal;2023-04-21

3. Functional Commitments for All Functions, with Transparent Setup and from SIS;Advances in Cryptology – EUROCRYPT 2023;2023

4. Short Paper: Verifiable Decryption for BGV;Financial Cryptography and Data Security. FC 2022 International Workshops;2023

5. LaBRADOR: Compact Proofs for R1CS from Module-SIS;Advances in Cryptology – CRYPTO 2023;2023