| Autor: |
Ganesh, Chaya, Khoshakhlagh, Hamidreza, Kohlweiss, Markulf, Nitulescu, Anca, Zając, Michał |
| Přispěvatelé: |
Galdi, Clemente, Jarecki, Stanislaw |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Zdroj: |
Ganesh, C, Khoshakhlagh, H, Kohlweiss, M, Nitulescu, A & Zając, M 2022, What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation Extractable? in C Galdi & S Jarecki (eds), Security and Cryptography for Networks . Springer, Cham, Lecture Notes in Computer Science, vol. 13409, pp. 735-760, 13th International Conference on Security and Cryptography for Networks, SCN 2022, Amalfi, Italy, 12/09/2022 . https://doi.org/10.1007/978-3-031-14791-3_32 |
| DOI: |
10.1007/978-3-031-14791-3_32 |
| Popis: |
We show that three popular universal zero-knowledge SNARKs (Plonk, Sonic, and Marlin) are updatable SRS simulation extractable NIZKs and signatures of knowledge (SoK) out-of-the-box avoiding any compilation overhead. Towards this we generalize results for the Fiat–Shamir (FS) transformation, which turns interactive protocols into signature schemes, non-interactive proof systems, or SoK in the random oracle model (ROM). The security of the transformation relies on rewinding to extract the secret key or the witness, even in the presence of signing queries for signatures and simulation queries for proof systems and SoK, respectively. We build on this line of work and analyze multi-round FS for arguments with a structured reference string (SRS). The combination of ROM and SRS, while redundant in theory, is the model of choice for the most efficient practical systems to date. We also consider the case where the SRS is updatable and define a strong simulation extractability notion that allows for simulated proofs with respect to an SRS to which the adversary can contribute updates. We define three properties (trapdoor-less zero-knowledge, rewinding-based knowledge soundness, and a unique response property) that are sufficient for argument systems based on multi-round FS to be also simulation extractable in this strong sense. We show that Plonk, Sonic, and Marlin satisfy these properties, and conjecture that many other argument systems such as Lunar, Basilisk, and transparent variants of Plonk fall within the reach of our main theorem. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
