Chenkai Weng

Orcid: 0000-0003-2436-9366

According to our database1, Chenkai Weng authored at least 28 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Collusion Resistant DNS With Private Information Retrieval.
CoRR, July, 2025

Efficient Mixed-Mode Oblivious RAMs.
IACR Cryptol. ePrint Arch., 2025

BitGC Made (More) Efficient.
IACR Cryptol. ePrint Arch., 2025

On Large Language Model Continual Unlearning.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Committed Vector Oblivious Linear Evaluation and Its Applications.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024
Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers.
IACR Cryptol. ePrint Arch., 2024

AES-based CCR Hash with High Security and Its Application to Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2024

Practical Unlearning for Large Language Models.
CoRR, 2024

Scalable Zero-knowledge Proofs for Non-linear Functions in Machine Learning.
Proceedings of the 33rd USENIX Security Symposium, 2024

Privacy-Preserving Regular Expression Matching Using TNFA.
Proceedings of the Computer Security - ESORICS 2024, 2024

Precio: Private Aggregate Measurement via Oblivious Shuffling.
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.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Dishonest Majority Constant-Round MPC with Linear Communication from DDH.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems.
IEEE Trans. Dependable Secur. Comput., 2023

ZKSQL: Verifiable and Efficient Query Evaluation with Zero-Knowledge Proofs.
Proc. VLDB Endow., 2023

Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata.
IACR Cryptol. ePrint Arch., 2023

An Efficient ZK Compiler from SIMD Circuits to General Circuits.
IACR Cryptol. ePrint Arch., 2023

Demo: PDNS: A Fully Privacy-Preserving DNS.
Proceedings of the ACM SIGCOMM 2023 Conference, 2023

SuperPack: Dishonest Majority MPC with Constant Online Communication.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Aggregate Measurement via Oblivious Shuffling.
IACR Cryptol. ePrint Arch., 2021

Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning.
Proceedings of the 30th USENIX Security Symposium, 2021

Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Constant-Overhead Zero-Knowledge for RAM Programs.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2020

Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting).
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Ferret: Fast Extension for Correlated OT with Small Communication.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020


  Loading...