Zhengzhong Jin

IACR Cryptol. ePrint Arch., 2024

2023

A Note on Non-Interactive Zero-Knowledge from CDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Scalable Multiparty Garbling.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Credibility in Private Set Membership.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Compact and Flexible KEM From Ideal Lattice.

[BibT_eX]

[DOI]

Shiyu Shen

IEEE Trans. Inf. Theory, 2022

Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors.

[BibT_eX]

[DOI]

J. ACM, 2022

Indistinguishability Obfuscation via Mathematical Proofs of Equivalence.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Correlation Intractability and SNARGs from Sub-exponential DDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Pre-Constrained Encryption.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Succinct Zero Knowledge for Floating Point Computations.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Non-Interactive Zero Knowledge from Sub-exponential DDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

SNARGs for <i>P</i> from LWE.

[BibT_eX]

[DOI]

Arka Rai Choudhuri

IACR Cryptol. ePrint Arch., 2021

Non-Interactive Batch Arguments for NP from Standard Assumptions.

[BibT_eX]

[DOI]

Arka Rai Choudhuri

IACR Cryptol. ePrint Arch., 2021

Unbounded Multi-Party Computation from Learning with Errors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.

[BibT_eX]

[DOI]

Kuan Cheng

Alireza Farhadi

MohammadTaghi Hajiaghayi

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

SNARGs for $\mathcal{P}$ from LWE.

[BibT_eX]

[DOI]

Arka Rai Choudhuri

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

AKCN-E8: Compact and Flexible KEM from Ideal Lattice.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Statistical Zaps and New Oblivious Transfer Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Multikey FHE in the Plain Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE).

[BibT_eX]

[DOI]

Prabhanjan Ananth

IACR Cryptol. ePrint Arch., 2020

Space Efficient Deterministic Approximation of String Measures.

[BibT_eX]

[DOI]

CoRR, 2020

Multi-key Fully-Homomorphic Encryption in the Plain Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019

Statistical Zap Arguments from Quasi-Polynomial LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Public-Key Function-Private Hidden Vector Encryption (and More).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Generic and Practical Key Establishment from Lattice.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

Optimal Key Consensus in Presence of Noise.

[BibT_eX]

[DOI]