default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhengzhong Jin
Person information
- affiliation: MIT CSAIL, USA
- affiliation (former): Johns Hopkins University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j2]Kuan Cheng
, Zhengzhong Jin, Xin Li, Ke Wu:
Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors. J. ACM 69(6): 44:1-44:39 (2022)- [j1]Zhengzhong Jin, Shiyu Shen, Yunlei Zhao:
Compact and Flexible KEM From Ideal Lattice. IEEE Trans. Inf. Theory 68(6): 3829-3840 (2022)
Conference and Workshop Papers
- 2024
- [c21]Quang Dao, Aayush Jain, Zhengzhong Jin:
Non-interactive Zero-Knowledge from LPN and MQ. CRYPTO (9) 2024: 321-360 - [c20]Zhengzhong Jin, Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs under LWE via Propositional Proofs. STOC 2024: 1750-1757 - 2023
- [c19]Gabrielle Beck, Aarushi Goel, Aditya Hegde, Abhishek Jain, Zhengzhong Jin, Gabriel Kaptchuk:
Scalable Multiparty Garbling. CCS 2023: 2158-2172 - [c18]Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang:
Correlation Intractability and SNARGs from Sub-exponential DDH. CRYPTO (4) 2023: 635-668 - [c17]Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach:
A Note on Non-interactive Zero-Knowledge from CDH. CRYPTO (4) 2023: 731-764 - [c16]Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, Yu Zheng:
Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes. ICALP 2023: 41:1-41:17 - [c15]Sanjam Garg, Mohammad Hajiabadi, Abhishek Jain, Zhengzhong Jin, Omkant Pandey, Sina Shiehian:
Credibility in Private Set Membership. Public Key Cryptography (2) 2023: 159-189 - 2022
- [c14]Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Yinuo Zhang:
Succinct Zero Knowledge for Floating Point Computations. CCS 2022: 1203-1216 - [c13]Abhishek Jain, Zhengzhong Jin:
Indistinguishability Obfuscation via Mathematical Proofs of Equivalence. FOCS 2022: 1023-1034 - [c12]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Pre-Constrained Encryption. ITCS 2022: 4:1-4:20 - 2021
- [c11]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
Non-interactive Batch Arguments for NP from Standard Assumptions. CRYPTO (4) 2021: 394-423 - [c10]Abhishek Jain, Zhengzhong Jin:
Non-interactive Zero Knowledge from Sub-exponential DDH. EUROCRYPT (1) 2021: 3-32 - [c9]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Unbounded Multi-party Computation from Learning with Errors. EUROCRYPT (2) 2021: 754-781 - [c8]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
SNARGs for $\mathcal{P}$ from LWE. FOCS 2021: 68-79 - [c7]Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng:
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. ICALP 2021: 54:1-54:20 - 2020
- [c6]Vipul Goyal, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Statistical Zaps and New Oblivious Transfer Protocols. EUROCRYPT (3) 2020: 668-699 - [c5]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Multi-key Fully-Homomorphic Encryption in the Plain Model. TCC (1) 2020: 28-57 - 2019
- [c4]Zhengzhong Jin, Yunlei Zhao:
Generic and Practical Key Establishment from Lattice. ACNS 2019: 302-322 - [c3]James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova:
Public-Key Function-Private Hidden Vector Encryption (and More). ASIACRYPT (3) 2019: 489-519 - [c2]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. ICALP 2019: 37:1-37:15 - 2018
- [c1]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. FOCS 2018: 200-211
Informal and Other Publications
- 2024
- [i23]Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs under LWE via Propositional Proofs. IACR Cryptol. ePrint Arch. 2024: 956 (2024) - [i22]Quang Dao, Aayush Jain, Zhengzhong Jin:
Non-Interactive Zero-Knowledge from LPN and MQ. IACR Cryptol. ePrint Arch. 2024: 1254 (2024) - [i21]Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan:
Universal SNARGs for NP from Proofs of Correctness. IACR Cryptol. ePrint Arch. 2024: 2015 (2024) - 2023
- [i20]Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, Yu Zheng:
Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes. CoRR abs/2303.17370 (2023) - [i19]Gabrielle Beck, Aarushi Goel, Aditya Hegde, Abhishek Jain, Zhengzhong Jin, Gabriel Kaptchuk:
Scalable Multiparty Garbling. IACR Cryptol. ePrint Arch. 2023: 99 (2023) - [i18]Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach:
A Note on Non-Interactive Zero-Knowledge from CDH. IACR Cryptol. ePrint Arch. 2023: 970 (2023) - 2022
- [i17]Abhishek Jain, Zhengzhong Jin:
Indistinguishability Obfuscation via Mathematical Proofs of Equivalence. IACR Cryptol. ePrint Arch. 2022: 1430 (2022) - [i16]Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang:
Correlation Intractability and SNARGs from Sub-exponential DDH. IACR Cryptol. ePrint Arch. 2022: 1486 (2022) - 2021
- [i15]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Unbounded Multi-Party Computation from Learning with Errors. IACR Cryptol. ePrint Arch. 2021: 431 (2021) - [i14]Abhishek Jain, Zhengzhong Jin:
Non-Interactive Zero Knowledge from Sub-exponential DDH. IACR Cryptol. ePrint Arch. 2021: 514 (2021) - [i13]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
Non-Interactive Batch Arguments for NP from Standard Assumptions. IACR Cryptol. ePrint Arch. 2021: 807 (2021) - [i12]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
SNARGs for P from LWE. IACR Cryptol. ePrint Arch. 2021: 808 (2021) - 2020
- [i11]Kuan Cheng, Zhengzhong Jin, Xin Li, Yu Zheng:
Space Efficient Deterministic Approximation of String Measures. CoRR abs/2002.08498 (2020) - [i10]Zhengzhong Jin, Yunlei Zhao:
AKCN-E8: Compact and Flexible KEM from Ideal Lattice. IACR Cryptol. ePrint Arch. 2020: 56 (2020) - [i9]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin:
Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE). IACR Cryptol. ePrint Arch. 2020: 169 (2020) - [i8]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Multikey FHE in the Plain Model. IACR Cryptol. ePrint Arch. 2020: 180 (2020) - [i7]Vipul Goyal, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Statistical Zaps and New Oblivious Transfer Protocols. IACR Cryptol. ePrint Arch. 2020: 235 (2020) - 2019
- [i6]James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova:
Public-Key Function-Private Hidden Vector Encryption (and More). IACR Cryptol. ePrint Arch. 2019: 746 (2019) - [i5]Abhishek Jain, Zhengzhong Jin:
Statistical Zap Arguments from Quasi-Polynomial LWE. IACR Cryptol. ePrint Arch. 2019: 839 (2019) - 2018
- [i4]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. CoRR abs/1804.05776 (2018) - [i3]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Edit Errors with Block Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. CoRR abs/1809.00725 (2018) - 2017
- [i2]Zhengzhong Jin, Yunlei Zhao:
Optimal Key Consensus in Presence of Noise. IACR Cryptol. ePrint Arch. 2017: 1058 (2017) - 2016
- [i1]Zhengzhong Jin, Yunlei Zhao:
Optimal Key Consensus in Presence of Noise. CoRR abs/1611.06150 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
