Latticefold: A lattice-based folding scheme and its applications to succinct proof systems
Folding is a recent technique for building efficient recursive SNARKs. Several elegant
folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and …
folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and …
Polymath: Groth16 is not the limit
H Lipmaa - Annual International Cryptology Conference, 2024 - Springer
Shortening the argument (three group elements or 1536/3072 bits over the BLS12-
381/BLS24-509 curves) of the Groth16 zk-SNARK for R1CS is a long-standing open …
381/BLS24-509 curves) of the Groth16 zk-SNARK for R1CS is a long-standing open …
Zero-knowledge proof vulnerability analysis and security auditing
X Tang, L Shi, X Wang, K Charbonnet… - Cryptology ePrint …, 2024 - eprint.iacr.org
Abstract Zero-Knowledge Proof (ZKP) technology marks a revolutionary advancement in the
field of cryptography, enabling the verification of certain information ownership without …
field of cryptography, enabling the verification of certain information ownership without …
Non-malleable Subvector Commitments
B Libert - International Conference on the Theory and …, 2024 - Springer
Vector commitments are compressing commitments to vectors allowing for short local
openings. Rotem and Segev (TCC'21) formalized a notion of non-malleability for vector …
openings. Rotem and Segev (TCC'21) formalized a notion of non-malleability for vector …
DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5 KB proofs from falsifiable assumptions
We construct the first polynomial commitment scheme (PCS) that has a transparent setup,
quasi-linear prover time, $\log N $ verifier time, and $\log\log N $ proof size, for multilinear …
quasi-linear prover time, $\log N $ verifier time, and $\log\log N $ proof size, for multilinear …
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions
Abstract Lipmaa, Parisella, and Siim [Eurocrypt, 2024] proved the extractability of the KZG
polynomial commitment scheme under the falsifiable assumption ARSDH. They also …
polynomial commitment scheme under the falsifiable assumption ARSDH. They also …
On extractability of bivariate KZG polynomial commitment
M Pastyřík - 2024 - dspace.cuni.cz
Zero-knowledge SNARKs have become an extremely studied topic in cryptography due to
their recent applications in modern cryptocurrencies. Most of these protocols are created …
their recent applications in modern cryptocurrencies. Most of these protocols are created …