Succinct arguments: efficiency, assumptions and trade-offs 

Zacharakis, Alexandros (Date of defense: 2022-10-10)

Succinct non-interactive arguments (snarks) are cryptographic constructions that allow a prover to convince a verifier about the validity of a statement regarding some computation. We consider these objects from the ...