Advanced Encryption Scheme from Pairing-based Succinct Argument
In this talk, I will present two of our recent works that construct encryption schemes with advanced features (1) threshold encryption with silent setup and (2) batch (threshold) decryption. In particular, I will introduce a unified framework in our constructions, which builds on a witness encryption scheme tailored for pairing product equations. This witness encryption allows us to utilize the succinctness of pairing-based arguments, which enables key efficiency features of the corresponding encryption schemes. This talk is based mostly on works joint with Arka Rai Choudhuri, Sanjam Garg, Dimitris Kolonelos, and Guru-Vamsi Policharla.
Speaker Biography
Mingyuan Wang is an Assistant Professor of Computer Science at NYU Shanghai. Previously, he was a Postdoctoral Researcher at UC Berkeley,hosted by Sanjam Garg. He received his PhD from Purdue University, advised by Hemanta K. Maji. He is interested in cryptography and its interplay with theoretical computer science and security. His research covers a wide range of topics including secure multiparty computation, information-theoretic cryptography, and leakage-resilient cryptography. His works have been published at top venues such as CRYPTO, EUROCRYPT, S&P, CCS, TCC, etc.
