Zero-Knowledge Extension of PARI
IACR Communications in Cryptology · 03.08.2026 · 3 (2)
DOI: 10.62056/ahjb0l2hd ↗Kurz gefasst
Fachartikel in der Zeitschrift IACR Communications in Cryptology, online erschienen am 03.08.2026. Verfasst von Shubham Khurana und 2 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
PARI is a recent SNARK based on equifficient polynomial commitments, giving an exceptionally compact proof of just 1280 bits over the BLS12-381 curve, which is the smallest among all the known SNARKs in the literature. However, PARI does not achieve the zero-knowledge property; despite being very efficient, it is therefore less suitable for applications requiring witness privacy. In this work, we propose a zero-knowledge extension of PARI making it ideal for privacy-centric applications yet keeping the proof size compact. We prove perfect completeness, perfect zero-knowledge in the random-oracle model with challenge space 𝔽 ⧵ K , and knowledge soundness in the algebraic group model with random oracles under the SDH assumption.
Zitieren
APA
Khurana, S., Padhye, S., & Sahu, R. (2026). Zero-Knowledge Extension of PARI. IACR Communications in Cryptology, 3(2). https://doi.org/10.62056/ahjb0l2hd
Vancouver
Khurana S, Padhye S, Sahu R. Zero-Knowledge Extension of PARI. IACR Communications in Cryptology. 2026;3(2). doi:10.62056/ahjb0l2hd
BibTeX
@article{Khurana2026,
author = {Khurana, Shubham and Padhye, Sahadeo and Sahu, Rajeev},
title = {Zero-Knowledge Extension of PARI},
journal = {IACR Communications in Cryptology},
year = {2026},
volume = {3},
number = {2},
doi = {10.62056/ahjb0l2hd}
}
EUVIMED