BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
H Zeilberger, B Chen, B Fisch - Annual International Cryptology …, 2024 - Springer
This works introduces BaseFold, a new field-agnostic Polynomial Commitment Scheme
(PCS) for multilinear polynomials that has O (log 2 (n)) verifier costs and O (n log n) prover …
(PCS) for multilinear polynomials that has O (log 2 (n)) verifier costs and O (n log n) prover …
zk-bench: A toolset for comparative evaluation and performance benchmarking of snarks
Abstract Zero-Knowledge Proofs (ZKPs), especially Succinct Non-interactive ARguments of
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …
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 …
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them
Lookup arguments allow an untrusted prover to commit to a vector f∈ F n and show that its
entries reside in a predetermined table t∈ FN. One of their key applications is to augment …
entries reside in a predetermined table t∈ FN. One of their key applications is to augment …
FLI: Folding Lookup Instances
A Garreta, I Manzur - International Conference on the Theory and …, 2025 - Springer
We introduce two folding schemes for lookup instances: FLI and FLI+ SOS. Both use a PIOP
to check that a matrix has elementary basis vectors as rows, with FLI+ SOS adding a twist …
to check that a matrix has elementary basis vectors as rows, with FLI+ SOS adding a twist …
SNARKs for virtual machines are non-malleable
Cryptographic proof systems have a plethora of applications: from building other
cryptographic tools (eg, malicious security for MPC protocols) to concrete settings such as …
cryptographic tools (eg, malicious security for MPC protocols) to concrete settings such as …
Arke: Scalable and Byzantine fault tolerant privacy-preserving contact discovery
N Mohnblatt, A Sonnino, K Gurkan… - Proceedings of the 2024 …, 2024 - dl.acm.org
Contact discovery is a crucial component of social applications, facilitating interactions
between registered contacts. This work introduces Arke, a novel contact discovery scheme …
between registered contacts. This work introduces Arke, a novel contact discovery scheme …
SoK: Trusted setups for powers-of-tau strings
Many cryptographic protocols rely upon an initial\emph {trusted setup} to generate public
parameters. While the concept is decades old, trusted setups have gained prominence with …
parameters. While the concept is decades old, trusted setups have gained prominence with …
Simulation-Extractable KZG Polynomial Commitments and Applications to HyperPlonk
B Libert - IACR International Conference on Public-Key …, 2024 - Springer
HyperPlonk is a recent SNARK proposal (Eurocrypt'23) that features a linear-time prover
and supports custom gates of larger degree than Plonk. For the time being, its instantiations …
and supports custom gates of larger degree than Plonk. For the time being, its instantiations …
How to Make Rational Arguments Practical and Extractable
We investigate proof systems where security holds against rational parties instead of
malicious ones. Our starting point is the notion of rational arguments, a variant of rational …
malicious ones. Our starting point is the notion of rational arguments, a variant of rational …