Papers
Topics
Authors
Recent
2000 character limit reached

Servicifying zk-SNARKs Execution for Verifiable Off-chain Computations (2404.16915v1)

Published 25 Apr 2024 in cs.SE and cs.CR

Abstract: Zk-SNARKs help scale blockchains with Verifiable Off-chain Computations (VOC). zk-SNARK DSL toolkits are key when designing arithmetic circuits but fall short of automating the subsequent proof-generation step in an automated manner. We emphasize the need for portability, interoperability, and manageability in VOC-based solutions and introduce a Proving Service that is designed to provide a scalable and reusable solution for generating zk-SNARK proofs leveraging clouds.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (5)
  1. E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza, “Scalable zero knowledge via cycles of elliptic curves,” Algorithmica, vol. 79, pp. 1102–1160, 2017.
  2. J. Eberhardt and S. Tai, “Zokrates - scalable privacy-preserving off-chain computations,” in IEEE International Conference on Blockchain.   IEEE, 2018.
  3. M. Bellés-Muñoz, M. Isabel, J. L. Muñoz-Tapia, A. Rubio, and J. Baylina, “Circom: A circuit description language for building zero-knowledge applications,” IEEE Transactions on Dependable and Secure Computing, 2022.
  4. J. Heiss, A. Busse, and S. Tai, “Trustworthy pre-processing of sensor data in data on-chaining workflows for blockchain-based iot applications,” in Service-Oriented Computing: 19th International Conference, ICSOC 2021, Virtual Event, November 22–25, 2021, Proceedings 19.   Springer, 2021, pp. 133–149.
  5. A. Chiesa, R. Lehmkuhl, P. Mishra, and Y. Zhang, “Eos: Efficient private delegation of zksnark provers,” in USENIX Security Symposium. USENIX Association, 2023.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.