Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier-Reference-Cited by-同舟云学术

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Published:2022 Issue: Volume: Page:275-304
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2022
language:
Short-container-title:

Author:

Bootle Jonathan^ORCID,Chiesa Alessandro,Liu Siqi

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-07085-3_10

Reference55 articles.

1. Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: Proceedings of the 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, pp. 7:1–7:31 (2017)

2. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998). Preliminary version in FOCS ’92

3. Lecture Notes in Computer Science;E Ben-Sasson,2017

4. Ben-Sasson, E., Chiesa, A., Gabizon, A., Riabzev, M., Spooner, N.: Interactive oracle proofs with constant rate and query complexity. In: Proceedings of the 44th International Colloquium on Automata, Languages and Programming, ICALP 2017, pp. 40:1–40:15 (2017)

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

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

1. Local Proofs Approaching the Witness Length;Journal of the ACM;2024-06-11

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

3. Zero-Knowledge IOPs Approaching Witness Length;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