20222022 International Conference on Big Data, Information and Computer Network (BDICN)Requires access

Analysis and comparison of the main zero-knowledge proof scheme

Yinjie Gong, Y. J. Jin, Yuchan Li, Ziyi Liu, Zhiyi Zhu

Open publisher page 22 citations

Abstract

Thanks to the development in encryption technology and blockchain, cryptocurrency has already proven feasible and applicable. However, blockchain requires massive information including details of every transaction, the information of the dealer and buyer, which makes the privacy of every user on blockchain vulnerable. With the presence of Zcash, a new concept called Zero-Knowledge proof which focuses on proving and verifying identities appears in front of every researcher and engineer working on blockchain. Because of the enormous quantity of the ZKP schemes and the limited time, in this article, we have compared four main ZKP algorithms-ZK-SNARK, ZK-STARK, MPC protocol-based algorithms, and Bulletproof. By comparing these algorithms, we intend to give relevant engineers and researchers a general understanding of the advantages and disadvantages of these algorithms. In addition, we try to make the relevant people aware of the application scenarios of each ZKP.

About this research paper

What this paper is about

Thanks to the development in encryption technology and blockchain, cryptocurrency has already proven feasible and applicable. However, blockchain requires massive information including details of every transaction, the information of the dealer and buyer, which makes the privacy of every user on blockchain vulnerable. With the presence of Zcash, a new concept called Zero-Knowledge proof which focuses on proving and verifying identities appears in front of every researcher and engineer working on blockchain. Because of the enormous quantity of the ZKP schemes and the limited time, in this article, we have compared four main ZKP algorithms-ZK-SNARK, ZK-STARK, MPC protocol-based algorithms, and Bulletproof. By comparing these algorithms, we intend to give relevant engineers and researchers a general understanding of the advantages and disadvantages of these algorithms. In addition, we try to make the relevant people aware of the application scenarios of each ZKP.

Why it matters

OpenAlex reports 22 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Thanks to the development in encryption technology and blockchain, cryptocurrency has already proven feasible and applicable. However, blockchain requires massive information including details of every transaction, the information of the dealer and buyer, which makes the privacy of every user on blockchain vulnerable. With the presence of Zcash, a new concept called Zero-Knowledge proof which focuses on proving and verifying identities appears in front of every researcher and engineer working on blockchain. Because of the enormous quantity of the ZKP schemes and the limited time, in this article, we have compared four main ZKP algorithms-ZK-SNARK, ZK-STARK, MPC protocol-based algorithms, and Bulletproof. By comparing these algorithms, we intend to give relevant engineers and researchers a general understanding of the advantages and disadvantages of these algorithms. In addition, we try to make the relevant people aware of the application scenarios of each ZKP.

Key concepts: Zero-knowledge proof, Blockchain, Computer science, Scheme (mathematics), Cryptocurrency, Proof-of-work system, Protocol (science), Database transaction

Related papers

Back to paper searchBrowse research topicsOriginal source
Analysis and comparison of the main zero-knowledge proof scheme — Research Paper | ScholarLens