Theses most similar to Succinct non-Interactive arguments (Chiesa, Alessandro; 2014) read it

Digital signatures from probabilistically checkable proofs

Sidney, Raymond M. (Raymond Mark) (1995)

  • Advisor: Silvio Micali
  • Department of Mathematics
Read it

A precise computational approach to knowledge

Pass, Rafael (Rafael Nat Josef) (2006)

  • Advisor: Silvio Micali
  • Department of Electrical Engineering and Computer Science
Read it

Theory and practice of secret commitment

Halevi, Shai (1997)

  • Advisor: Silvio Micali
  • Department of Electrical Engineering and Computer Science
Read it

Delegating computation reliably : paradigms and constructions

Rothblum, Guy N (2009)

  • Advisor: Shafi Goldwasser
  • Department of Electrical Engineering and Computer Science
Read it

Proof-carrying data

Chiesa, Alessandro (2010)

  • Advisors: Eran Tromer; Ronald L. Rivest
  • Department of Electrical Engineering and Computer Science
Read it

Query-efficient checking of proofs and improved PCP characterizations of NP

Guruswami, Venkatesan, 1976- (1999)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Improving the exact security of digital signature schemes

Reyzin, Leonid (Leonid Natanovich), 1975- (1999)

  • Advisor: Silvio Micali
  • Department of Electrical Engineering and Computer Science
Read it

Keeping secrets from those you work with : constructions and characterizations of encryption

Wilson, David A. (2014)

  • Advisor: Shafi Goldwasser
  • Department of Electrical Engineering and Computer Science
Read it

PCPs for Arthur-Merlin games and communication protocols

Drucker, Andrew Donald (2010)

  • Advisor: Scott Aaronson
  • Department of Electrical Engineering and Computer Science
Read it

SNARKs for C : verifying program executions succinctly and in zero knowledge

Virza, Madars (2014)

  • Advisors: Eli Ben-Sasson; Ronald L. Rivest
  • Department of Electrical Engineering and Computer Science
Read it