Alessandro Chiesa

Writeup”: In anticipation of a package submission to the NIST Threshold Call Title

Succinct Arguments for QMA in the Quantum Random Oracle Model

Succinct arguments are a fundamental cryptographic primitive for verifying computational claims with small communication. In the classical setting, succinct arguments for NP can be constructed from unstructured hardness alone (e.g., hash functions) by compiling probabilistically checkable proofs (PCPs) or interactive o...

Can AI Oversight Be Zero Knowledge?

AI systems increasingly produce outputs from confidential data, such as a fitness-for-duty assessment from medical records or the predicted properties of a drug candidate from its secret structure. It is important to verify that such outputs are correct without revealing the underlying data. A recent line of work studi...