Preprint Article Version 1 This version is not peer-reviewed

Evaluating the Efficiency of zk-SNARK, zk-STARK, and Bulletproof in Real-World Scenarios: A Benchmark Study

Version 1 : Received: 3 July 2024 / Approved: 4 July 2024 / Online: 4 July 2024 (09:55:35 CEST)

How to cite: El-Hajj, M.; Oude Roelink, B. Evaluating the Efficiency of zk-SNARK, zk-STARK, and Bulletproof in Real-World Scenarios: A Benchmark Study. Preprints 2024, 2024070397. https://doi.org/10.20944/preprints202407.0397.v1 El-Hajj, M.; Oude Roelink, B. Evaluating the Efficiency of zk-SNARK, zk-STARK, and Bulletproof in Real-World Scenarios: A Benchmark Study. Preprints 2024, 2024070397. https://doi.org/10.20944/preprints202407.0397.v1

Abstract

This study builds on our previous Systematic Literature Review (SLR) that assessed the applications and performance of zk-SNARK, zk-STARK, and Bulletproof Non-Interactive Zero-Knowledge Proof (NIZKP) protocols. To address identified research gaps, we designed and implemented a benchmark comparing these three protocols using a dynamic MiMC hash application. We evaluated performance across four general-purpose programming libraries and two programming languages. Our results show that zk-SNARK produced the smallest proofs, while zk-STARK generated the largest. In terms of proof generation and verification times, zk-STARK was the fastest, and Bulletproof the slowest. Interestingly, zk-SNARK proofs verified marginally faster than zk-STARK, contrary to other findings. These insights enhance our understanding of the functionality, security, and performance of NIZKP protocols, providing valuable guidance for selecting the most suitable protocol for specific applications.

Keywords

Non-Interactive Zero-Knowledge Proof; zk-SNARK; zk-STARK; Bulletproofs; privacy-preserving; Authentication performance; )

Subject

Computer Science and Mathematics, Security Systems

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.