An Algebraic Framework for Universal and Updatable SNARKs-Reference-Cited by-同舟云学术

An Algebraic Framework for Universal and Updatable SNARKs

Published:2021 Issue: Volume: Page:774-804
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2021
language:
Short-container-title:

Author:

Ràfols Carla,Zapico Arantxa

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-84242-0_27

Reference40 articles.

1. Abdolmaleki, B., Baghery, K., Lipmaa, H., Zajac, M.: A subversion-resistant SNARK. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part III. LNCS, vol. 10626, pp. 3–33. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70700-6_1

2. Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds) ACM CCS 2017, Dallas, TX, USA, 31 October–2 November 2017, pp. 2087–2104. ACM Press (2017)

3. Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018/046 (2018). https://eprint.iacr.org/2018/046

4. Lecture Notes in Computer Science;E Ben-Sasson,2019

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

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

1. hinTS: Threshold Signatures with Silent Setup;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

2. How to Make Rational Arguments Practical and Extractable;IACR Communications in Cryptology;2024-04-09

3. Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees;Lecture Notes in Computer Science;2024

4. Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions;Lecture Notes in Computer Science;2024

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