Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions: Rachel Huijia Lin, BU/MIT
- Starts: 10:00 am on Monday, November 19, 2012
- Ends: 12:00 pm on Monday, November 19, 2012
Abstract: 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.
- MCS 137