Theses most similar to those of author Virza, Madars

SNARKs for C : verifying program executions succinctly and in zero knowledge (2014) read it

Relativization of the theory of computational complexity.

Lynch, Nancy A. (Nancy Ann), 1948- (1972)

  • Advisor: Albert Meyer
  • Department of Mathematics
Read it

Local list decoding of homomorphisms

Grigorescu, Elen (2006)

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

Quantum computation beyond the circuit model

Jordan, Stephen Paul (2008)

  • Advisor: Edward H. Farhi
  • Department of Physics
Read it

Delegating computation reliably : paradigms and constructions

Rothblum, Guy N (2009)

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

Testability of linear-invariant properties

Bhattacharyya, Arnab (2011)

  • Advisor: Ronitt Rubinfeld
  • 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

Adaptive security in the threshold setting : from cryptosystems to signatures

Peikert, Christioher Jason, 1978- (2001)

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

Succinct non-Interactive arguments

Chiesa, Alessandro (2014)

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

A study of efficient secret sharing

Vasudevan, Prashant (2015)

  • Advisor: Vinod Vaikuntanathan
  • Department of Electrical Engineering and Computer Science
Read it

Entangled protocols and non-local games for testing quantum systems.

Coudron., Matthew Ryan (2017)

  • Advisor: Peter W. Shor
  • Department of Electrical Engineering and Computer Science
Read it