Chenkai Weng

Orcid: 0000-0003-2436-9366

According to our database1, Chenkai Weng authored at least 15 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

SUPERPACK: Dishonest Majority MPC with Constant Online Communication.
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

2022
AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication.
IACR Cryptol. ePrint Arch., 2022

2021
QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field.
IACR Cryptol. ePrint Arch., 2021

Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning.
IACR Cryptol. ePrint Arch., 2021

Constant-Overhead Zero-Knowledge for RAM Programs.
IACR Cryptol. ePrint Arch., 2021

Aggregate Measurement via Oblivious Shuffling.
IACR Cryptol. ePrint Arch., 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

2020
Ferret: Fast Extension for coRRElated oT with small communication.
IACR Cryptol. ePrint Arch., 2020

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

2019
Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting).
IACR Cryptol. ePrint Arch., 2019


  Loading...