Person

Alessandro Chiesa

Related publications (19)

zkSNARKs in the ROM with Unconditional UC-Security

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

Security Bounds for Proof-Carrying Data from Straightline Extractors

Alessandro Chiesa

Proof-carrying data (PCD) is a powerful cryptographic primitive that allows mutually distrustful parties to perform distributed computation in an efficiently verifiable manner. Real-world deployments of PCD have sparked keen interest within the applied com ...

Springer Science and Business Media Deutschland GmbH2025

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

Alessandro Chiesa

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

Untangling the Security of Kilian’s Protocol: Upper and Lower Bounds

Alessandro Chiesa

Sigma protocols are elegant cryptographic proofs that have become a cornerstone of modern cryptography. A notable example is Schnorr’s protocol, a zero-knowledge proof-of-knowledge of a discrete logarithm. Despite extensive research, the security of Schnor ...

Springer Science and Business Media Deutschland GmbH2025

STIR: Reed-Solomon Proximity Testing with Fewer Queries

Alessandro Chiesa

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

On Parallel Repetition of PCPs

Alessandro Chiesa

Parallel repetition refers to a set of valuable techniques used to reduce soundness error of probabilistic proofs while saving on certain efficiency measures. Parallel repetition has been studied for interactive proofs (IPs) and multi-prover interactive pr ...

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2024

EOS: Efficient Private Delegation of zkSNARK Provers

Alessandro Chiesa, Yinuo Zhang

Succinct zero knowledge proofs (i.e. zkSNARKs) are powerful cryptographic tools that enable a prover to convince a verifier that a given statement is true without revealing any additional information. Their attractive privacy properties have led to much ac ...

Usenix Assoc2023

IOPs with Inverse Polynomial Soundness Error

Alessandro Chiesa

We show that every language in NP has an Interactive Oracle Proof (IOP) with inverse polynomial soundness error and small query complexity. This achieves parameters that surpass all previously known PCPs and IOPs. Specifically, we construct an IOP with per ...

Ieee Computer Soc2023

Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification

Alessandro Chiesa

Succinct arguments that rely on the Merkle-tree paradigm introduced by Kilian (STOC 92) suffer from larger proof sizes in practice due to the use of generic cryptographic primitives. In contrast, succinct arguments with the smallest proof sizes in practice ...

Springer Nature2023

Proof-Carrying Data from Arithmetized Random Oracles

Alessandro Chiesa

Proof-carrying data (PCD) is a powerful cryptographic primitive that allows mutually distrustful parties to perform distributed computation in an efficiently verifiable manner. Known constructions of PCD are obtained by recursively-composing SNARKs or rela ...

Springer2023