Geodesic
Efficiency analysis of cryptographic algorithms for applications in zk-SNARK
Prikladnaya Diskretnaya Matematika. Supplement, no. 16 (2023), pp. 50-52 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper presents a comparative efficiency analysis of various cryptographic algorithms in terms of applications in zk-SNARK based systems. To conduct experiments with measuring parameters, an infrastructure based on ZoKrates has been developed. A series of measurements with different input data was carried out for each algorithm. The number of constraints in the R1CS representation of the algorithm, the length of the proof key and the verification key, the running time of the setup phase of the protocol, and the proof generation time have been measured. As a result, we have obtained experimental data that allow us to determine the boundaries of the practical applicability of algorithms in distributed ledgers.
Keywords: distributed ledgers, zero-knowledge proof, zk-SNARK, R1CS, algorithm efficiency. 
@article{PDMA_2023_16_a12,
     author = {D. O. Kondyrev},
     title = {Efficiency analysis of cryptographic algorithms for applications in {zk-SNARK}},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {50--52},
     year = {2023},
     number = {16},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2023_16_a12/}
}
TY  - JOUR
AU  - D. O. Kondyrev
TI  - Efficiency analysis of cryptographic algorithms for applications in zk-SNARK
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2023
SP  - 50
EP  - 52
IS  - 16
UR  - http://geodesic.mathdoc.fr/item/PDMA_2023_16_a12/
LA  - ru
ID  - PDMA_2023_16_a12
ER  - 
%0 Journal Article
%A D. O. Kondyrev
%T Efficiency analysis of cryptographic algorithms for applications in zk-SNARK
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2023
%P 50-52
%N 16
%U http://geodesic.mathdoc.fr/item/PDMA_2023_16_a12/
%G ru
%F PDMA_2023_16_a12
D. O. Kondyrev. Efficiency analysis of cryptographic algorithms for applications in zk-SNARK. Prikladnaya Diskretnaya Matematika. Supplement, no. 16 (2023), pp. 50-52. http://geodesic.mathdoc.fr/item/PDMA_2023_16_a12/

[1] Ben-Sasson E., Chiesa A., Genkin D., et al., “SNARKs for C: Verifying program executions succinctly and in zero knowledge”, LNCS, 8043, 2013, 90–108 | MR | Zbl

[2] Eberhardt J., Scalable and Privacy-preserving Off-chain Computations, Thesis: Ph.D., Technical University of Berlin, Faculty IV — Electrical Engineering and Computer Science, 2021, 284 pp.

[3] Eberhardt J. and Tai S., “ZoKrates — scalable privacy-preserving off-chain computations”, IEEE Intern. Conf. Blockchain (Halifax, Canada, 2018), 1084–1091