Publications de Giacomo Fenzi | EPFL Graph Search

Publications associées (6)

WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification

We introduce WHIR, a new IOP of proximity that offers small query complexity and exceptionally fast verification time. The WHIR verifier typically runs in a few hundred microseconds, whereas other verifiers in the literature require several milli seconds ( ...

Springer Science and Business Media Deutschland GmbH2025

zkSNARKs in the ROM with Unconditional UC-Security

Alessandro Chiesa, Giacomo Fenzi

The universal composability (UC) framework is a “gold standard” for security in cryptography. UC-secure protocols achieve strong security guarantees against powerful adaptive adversaries, and retain these guarantees when used as part of larger protocols. Z ...

Springer Science and Business Media Deutschland GmbH2025

STIR: Reed-Solomon Proximity Testing with Fewer Queries

Alessandro Chiesa, Giacomo Fenzi

We present STIR (Shift To Improve Rate), an interactive oracle proof of proximity (IOPP) for Reed–Solomon codes that achieves the best known query complexity of any concretely efficient IOPP for this problem. For λ bits of security, STIR has query complexi ...

Springer Science and Business Media Deutschland GmbH2024

Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency

Giacomo Fenzi, Hossein Moghaddas

Polynomial commitments schemes are a powerful tool that enables one party to commit to a polynomialpof degreed, and prove that the committed function evaluates to a certain valuezat a specified pointu, i.e.

p(u) = z

, without revealing any additional infor ...

Springer Science and Business Media LLC2024

SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions

Giacomo Fenzi

Recent works on lattice-based extractable polynomial commitments can be grouped into two classes: (i) non-interactive constructions that stem from the functional commitment by Albrecht, Cini, Lai, Malavolta and Thyagarajan (CRYPTO 2022), and (ii) lattice a ...

Springer Science and Business Media Deutschland GmbH2024

Lova: Lattice-Based Folding Scheme from Unstructured Lattices

Giacomo Fenzi, Christian Louis Knabenhans

Folding schemes (Kothapalli et al., CRYPTO 2022) are a conceptually simple, yet powerful cryptographic primitive that can be used as a building block to realise incrementally verifiable computation (IVC) with low recursive overhead without general-purpose ...

Springer2025