Chenkai Weng

Orcid: 0000-0003-2436-9366

According to our database¹, Chenkai Weng authored at least 23 papers between 2019 and 2025.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

An Efficient ZK Compiler from SIMD Circuits to General Circuits.

[BibT_eX]

[DOI]

J. Cryptol., March, 2025

2024

Dishonest Majority Constant-Round MPC with Linear Communication from DDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.

[BibT_eX]

[DOI]

Daniel Escudero

Antigoni Polychroniadou

Yifan Song

Chenkai Weng

IACR Cryptol. ePrint Arch., 2024

AES-based CCR Hash with High Security and Its Application to Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Practical Unlearning for Large Language Models.

[BibT_eX]

[DOI]

CoRR, 2024

Scalable Zero-knowledge Proofs for Non-linear Functions in Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the 33rd USENIX Security Symposium, 2024

Privacy-Preserving Regular Expression Matching Using TNFA.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2024, 2024

Precio: Private Aggregate Measurement via Oblivious Shuffling.

[BibT_eX]

[DOI]

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

Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.

[BibT_eX]

[DOI]

Daniel Escudero

Antigoni Polychroniadou

Yifan Song

Chenkai Weng

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

2023

More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems.

[BibT_eX]

[DOI]

IEEE Trans. Dependable Secur. Comput., 2023

ZKSQL: Verifiable and Efficient Query Evaluation with Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

SUPERPACK: Dishonest Majority MPC with Constant Online Communication.

[BibT_eX]

[DOI]

Daniel Escudero

Vipul Goyal

Antigoni Polychroniadou

Yifan Song

Chenkai Weng

IACR Cryptol. ePrint Arch., 2023

Demo: PDNS: A Fully Privacy-Preserving DNS.

[BibT_eX]

[DOI]

Aleksandar Kuzmanovic

Proceedings of the ACM SIGCOMM 2023 Conference, 2023

2022

AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Constant-Overhead Zero-Knowledge for RAM Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Aggregate Measurement via Oblivious Shuffling.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

2020

Ferret: Fast Extension for coRRElated oT with small communication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Chenkai Weng

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...