Zhengzhong Jin

Research Interest: I have a broad interest in cryptography and related topics in theoretical computer science. Currently, I'm working on succinct cryptographic proofs, zero-knowledge protocols, and secure multi-party computation. I am a postdoctoral researcher at MIT CSAIL, hosted by Vinod Vaikuntanathan. Previously, I received my Ph.D. from Johns Hopkins University, where I was fortunately co-advised by Abhishek Jain and Xin Li. Before that, I received my bachelor's degree from Mathematics Department at Fudan University, and was fortunately advised by Yunlei Zhao. Contact: zzjin (AT) mit (DOT) edu, albusmath at gmail dot com. I will join Northeastern University as an Assistant Professor in Fall 2024! I'm looking for talented students to join my group.

Publications

• Correlation Intractability and SNARGs from Sub-exponential DDH
  Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang
  CRYPTO 2023

• A Note on Non-Interactive Zero-Knowledge Proofs for NP from CDH
  Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach
  CRYPTO 2023

• Credibility in Private Set Membership
  Sanjam Garg, Mohammad Hajibadi, Abhishek Jain, Zhengzhong Jin, Omkant Pandey, Sina Shiehian
  PKC 2023

• Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes
  Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, Yu Zheng
  ICALP 2023

• Succinct Zero Knowledge for Floating Point Computations
  Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Yinuo Zhang
  CCS 2022

• Indistinguishability Obfuscation via Mathematical Proofs of Equivalence
  Abhishek Jain, Zhengzhong Jin
  FOCS 2022 [eprint][Slides at Complexity Meeting][Slides for Cryptographers]

• Pre-Constrained Encryption
  Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta
  ITCS 2022

• Compact and Flexible KEM From Ideal Lattice
  Zhengzhong Jin, Shiyu Shen, Yunlei Zhao
  IEEE TIT 2022

• SNARGs for from LWE
  Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin
  FOCS 2021 [eprint]
  Invited to the SIAM Journal of Computing Special Issue

• Non-Interactive Batch Arguments for NP from Standard Assumptions
  Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin
  CRYPTO 2021 [eprint]

• Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence
  Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng
  ICALP 2021

• Non-Interactive Zero Knowledge from Sub-exponential DDH
  Abhishek Jain, Zhengzhong Jin
  EUROCRYPT 2021 [eprint][slides (long)]
  Best Paper Award. Invited to Journal of Cryptology

• Unbounded Multi-party Computation from Learning with Errors
  Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta
  EUROCRYPT 2021 [eprint]

• Multi-key Fully-Homomorphic Encryption in the Plain Model
  Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta
  TCC 2020 [eprint][slides]

• Statistical Zaps and New Oblivious Transfer Protocols
  Vipul Goyal, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta
  EUROCRYPT 2020 [eprint], subsumes [eprint], [slides]

• Public-Key Function-Private Hidden Vector Encryption (and More)
  James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova
  ASIACRYPT 2019 [eprint]

• Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes
  Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu
  ICALP 2019 [arXiv][slides]

• Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors
  Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu
  FOCS 2018 [arXiv][slides], Journal of the ACM 2022

• Generic and Practical Key Establishment from Lattice
  Zhengzhong Jin, Yunlei Zhao
  ACNS 2019 [Proceeding]
  Best Student Paper Award

Talks

• Indistinguishability Obfuscation via Mathematical Proofs of Equivalence
  Oxford-Warwick Complexity Meetings, Oct 2022.
  63rd IEEE Symposium on Foundations of Computer Science, Nov 2022.
  Charles River Crypto Day, Dec 2022.
  CMU CyLab Crypto Seminar, Feb 2023.
  Simons Institute, Proof Complexity and Meta-Mathematics, March 2023.

• SNARGs for P from LWE
  Charles River Crypto Day, July 2021.
  DC Area Crypto Day (virtual), November 2021.
  UCLA, December 2021.
  62nd IEEE Symposium on Foundations of Computer Science (virtual), 2021.
  Chinese Academy of Sciences, Nov 2022.

• Non-Interactive Batch Arguments for NP from Standard Assumptions
  41st Annual International Cryptology Conference, live talk, August 2021.

• Non-Interactive Zero Knowledge from Sub-exponential DDH
  UC Berkeley Crypto Seminar (virtual), March 2021.
  MIT CIS Seminar (virtual), April 2021.
  Cornell Crypto Seminar (virtual), April 2021.
  IIT Madras Crypto Seminar (virtual), July 2021.
  40th Annual International Conference on the Theory and Applications of Cryptographic Techniques (virtual), October 2021.
  ENSL/CWI/RHUL joint online seminar (virtual), May 2022.

• Multi-key Fully-Homomorphic Encryption in the Plain Model
  Theory of Cryptography Conference, November 2020.

• Statistical Zaps and New Oblivious Transfer Protocols
  39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2020.

• Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes
  46th International Colloquium on Automata, Languages and Programming, July 2019.

• Generic and Practical Key Establishment from Lattice
  17th International Conference on Applied Cryptography and Network Security, June 2019.

• Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors
  Johns Hopkins University, Theory Seminar, September 2018.
  Also at 59th Annual IEEE Symposium on Foundations of Computer Science, October 2018.

Other Awards

• Gold Medal, ACM-ICPC Asia Regional Contest Guangzhou site, 2014

• Gold Medal, ACM-ICPC Asia Regional Contest Anshan site, 2014