CSAIL Event Calendar
Constant-Round Concurrent Zero Knowledge From Falsifiable AssumptionsSpeaker: Huijia Rachel Lin, MIT Date: Friday, March 8 2013 Time: 10:30AM to 12:00PM Location: 32-G449 (PATIL/KIVA) Host: Shafi Goldwasser, MIT CSAIL Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Relevant URL: http://toc.csail.mit.edu/?q=node/60Abstract: We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol is sound against uniform polynomial-time attackers, and relies on the existence of families of collision-resistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly speaking, that Micali's non-interactive CS-proofs are sound for languages in P.  
|