Theses most similar to PCPs for Arthur-Merlin games and communication protocols (Drucker, Andrew Donald; 2010) read it

Efficient holographic proofs

Russell, Alexander Craig (1996)

  • Advisor: Michael Sipser
  • Department of Mathematics
Read it

Études in non-interactive zero-knowledge

Shelat, Abhi (2005)

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

Digital signatures from probabilistically checkable proofs

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

  • Advisor: Silvio Micali
  • Department of Mathematics
Read it

Space-time tradoffs for graph properties

Dodis, Yevgeniy, 1976- (1998)

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

Randomized algorithms for reliable broadcast

Vaikuntanathan, Vinod (2009)

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

Uses of randomness in algorithms and protocols

Kilian, Joe (1989)

  • Advisors: David Shmoys; Shafi Goldwasser
  • Department of Mathematics
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

A study of statistical zero-knowledge proofs

Vadhan, Salil Pravin, 1973- (1999)

  • Advisor: Shafi Goldwasser
  • Department of Mathematics
Read it

Succinct non-Interactive arguments

Chiesa, Alessandro (2014)

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