Zhengzhong Jin

Orcid: 0000-0002-2233-3768

Affiliations:
  • MIT CSAIL, USA
  • Johns Hopkins University, USA (former)


According to our database1, Zhengzhong Jin authored at least 28 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Note on Non-Interactive Zero-Knowledge from CDH.
IACR Cryptol. ePrint Arch., 2023

Scalable Multiparty Garbling.
IACR Cryptol. ePrint Arch., 2023

Credibility in Private Set Membership.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Compact and Flexible KEM From Ideal Lattice.
IEEE Trans. Inf. Theory, 2022

Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors.
J. ACM, 2022

Indistinguishability Obfuscation via Mathematical Proofs of Equivalence.
IACR Cryptol. ePrint Arch., 2022

Correlation Intractability and SNARGs from Sub-exponential DDH.
IACR Cryptol. ePrint Arch., 2022

Pre-Constrained Encryption.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Succinct Zero Knowledge for Floating Point Computations.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Non-Interactive Zero Knowledge from Sub-exponential DDH.
IACR Cryptol. ePrint Arch., 2021

SNARGs for <i>P</i> from LWE.
IACR Cryptol. ePrint Arch., 2021

Non-Interactive Batch Arguments for NP from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2021

Unbounded Multi-Party Computation from Learning with Errors.
IACR Cryptol. ePrint Arch., 2021

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

SNARGs for $\mathcal{P}$ from LWE.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
AKCN-E8: Compact and Flexible KEM from Ideal Lattice.
IACR Cryptol. ePrint Arch., 2020

Statistical Zaps and New Oblivious Transfer Protocols.
IACR Cryptol. ePrint Arch., 2020

Multikey FHE in the Plain Model.
IACR Cryptol. ePrint Arch., 2020

Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE).
IACR Cryptol. ePrint Arch., 2020

Space Efficient Deterministic Approximation of String Measures.
CoRR, 2020

Multi-key Fully-Homomorphic Encryption in the Plain Model.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
Statistical Zap Arguments from Quasi-Polynomial LWE.
IACR Cryptol. ePrint Arch., 2019

Public-Key Function-Private Hidden Vector Encryption (and More).
IACR Cryptol. ePrint Arch., 2019

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

Generic and Practical Key Establishment from Lattice.
Proceedings of the Applied Cryptography and Network Security, 2019

2018
Edit Errors with Block Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes.
CoRR, 2018

2017
Optimal Key Consensus in Presence of Noise.
IACR Cryptol. ePrint Arch., 2017


  Loading...