2026-04-14T05:42:04Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/4108862025-07-22T20:52:59Zcom_2072_1033col_2072_452951

00925njm 22002777a 4500 dc Vico Lora, Jesús author 2024-02-08 The Fiat-Shamir Heuristic is a crucial concept in cryptography used for non-interactive proofs. However, implementing it correctly comes with challenges: Randomness and Nonces: Secure randomness generation and proper handling of nonces are essential to prevent vulnerabilities. Security Assumptions: The heuristic relies on specific mathematical assumptions, which must be carefully validated for each use case. Technologies: Tools like Cairo, Circom, and Snarkjs are used for zk-SNARKs. Errors in their usage or circuit design can introduce security flaws. Frozen Hea This work explores SNARKs with a focus on the Marlin proof system. We investigate the implementation of compatible circuits, utilizing the official Marlin implementation in Arkworks. We execute some benchmarks to study the performance variations using different curves and circuits. Our findings showcase the performance impact of using different circuits and how splitting the addition gates between R1CS matrices improves the performance of both the indexer and prover. Additionally, we highlight the unique properties of the third prover round, emphasizing its suitability for delegation due to its independence from the witness. This study provides practical optimizations for SNARKs, addressing performance considerations and scalability concerns. Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia Cryptography cryptography snarks zk-snarks arkworks marlin zk-knowledge Criptografia Analyzing the Performance of the Marlin zk-SNARK