Charles River Crypto Day – Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation

  • Huijia (Rachel) Lin | University of California, Santa Barbara

We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations, and indistinguishability obfuscators for P/poly (with slightly super-polynomial security).

Speaker Details

Huijia (Rachel) Lin is currently an Assistant Professor in the Computer Science department at the University of California, Santa Barbara. Previously, she was a post-doctoral researcher at the Computer Science and Artificial Intelligence Laboratory at MIT and the department of Computer Science at Boston University. Earlier, she obtained a PhD in Computer Science from Cornell University.

Watch Next