Makriyannis, Nikolaos (Date of defense: 2016-09-20)
Secure two-party computation is a classic problem in cryptography. It involves two parties computing a function of their private inputs, and only revealing what the output suggests. Additional security ...
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 ...
Zapico Barrionuevo, Victoria Arantxa (Date of defense: 2022-10-13)
In this thesis, we make theoretical and practical contributions to the design of succinct arguments with universal setups in the pairing-based setting. We first introduce a new primitive, Checkable ...