Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability-Reference-Cited by-同舟云学术

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability

Published:2017 Issue: Volume: Page:336-365
ISSN:0302-9743
Container-title:Advances in Cryptology – ASIACRYPT 2017
language:
Short-container-title:

Author:

Bootle Jonathan,Cerulli Andrea,Ghadafi Essam,Groth Jens,Hajiabadi Mohammad,Jakobsen Sune K.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-70700-6_12

Reference50 articles.

1. Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. Cryptology ePrint Archive, Report 2017/036 (2017). http://eprint.iacr.org/2017/036

2. Lecture Notes in Computer Science;J Bootle,2016

3. Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Innovations in Theoretical Computer Science Conference-ITCS. ACM (2012)

4. Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: ACM Symposium on Theory of Computing-STOC. ACM (2013)

5. Lecture Notes in Computer Science;E Ben-Sasson,2013

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

1. Efficient Zero-Knowledge Arguments For Paillier Cryptosystem;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

2. Hadamard Product Argument from Lagrange-Based Univariate Polynomials;Lecture Notes in Computer Science;2024

3. Field-Agnostic SNARKs from Expand-Accumulate Codes;Lecture Notes in Computer Science;2024

4. How to Prove Statements Obliviously?;Lecture Notes in Computer Science;2024

5. More Efficient Zero-Knowledge Protocols over $$\mathbb {Z}_{2^k}$$ via Galois Rings;Lecture Notes in Computer Science;2024