Publications

Chosen-input VOLE with polylogarithmic communication, with applications to designated-verifier zero knowledge and garbled input labels.

An epochless, collision-free batched threshold encryption scheme for encrypted mempools with compact ciphertexts and fast batch decryption.

Extends batched threshold encryption to weighted validator committees while improving the concrete cost of encrypted mempool decryption.

Builds faster linear codes for pseudorandom correlation generators and zero knowledge, with large concrete speedups on CPU and GPU.

Makes distributed multi-point functions practical enough to replace sparse DPF bottlenecks in PCG pipelines.

Introduces a correlated-noise syndrome decoding assumption that reduces communication for OT, VOLE, and Beaver triple generation.

Adapts SQL-like secret-shared database joins to the two-party setting using efficient permutation correlations and PRF evaluation.

Develops permutation correlations and batched random-access primitives for efficient two-party computation over secret-shared data.

A concretely efficient near-linear secure merge protocol for random or distributionally similar sorted lists.

More communication-efficient fixed-point multiplication protocols for replicated, Shamir, and additive secret sharing.

Improves secure merge toward linear-time performance using a small logarithmic overhead in practical regimes.

Designs efficient MPC-friendly alternating-moduli PRFs and applies them to compact post-quantum signatures.

Approximates complex neural-network activations with MPC-friendly piecewise polynomials while preserving model accuracy.

Introduces fast LPN-friendly codes for pseudorandom correlation generators such as silent OT and VOLE.

Studies when outsourced batches of black-box computations can be verified with only a small number of oracle calls.

A framework for running private set intersection at billion-record scale by combining cryptographic and systems optimizations.

Strengthens fuzzy-extractor-style biometric authentication by hiding helper data access through oblivious extraction.

Surveys privacy-enhancing technologies for financial data sharing, including applications to CBDCs and tokenized deposits.

Computes SQL-style joins on secret-shared tables with duplicate keys using aggregation trees and logarithmic rounds.

A malicious-secure threshold authenticated encryption protocol with finer-grained security and control.

A high-performance PSI protocol using improved OKVS constructions and subfield VOLE to cut both time and communication.

Builds fast OPRF and circuit-PSI protocols from vector oblivious linear evaluation.

Builds silent VOLE and OT from structured LDPC decoding assumptions with concrete efficiency.

Studies multiparty threshold PSI and gives protocols whose communication can be sublinear in the universe size.

Scalable protocols for joins and set intersection over secret-shared data in the honest-majority setting.

Shows that carefully bounded differentially private leakage can substantially reduce the concrete cost of malicious PSI.

Analyzes and constructs efficient oblivious transfer protocols with security against endemic adversarial behavior.

Introduces silent OT-style techniques that reduce interaction and communication for secure computation correlations.

A three-party mixed-protocol framework for efficient privacy-preserving training and inference.

Introduces DiSE, an efficient threshold scheme for distributed authenticated encryption.

Combines private information retrieval and PSI to scale private contact discovery.

A fast unbalanced PSI protocol from homomorphic encryption, later used in Microsoft Edge password monitoring.

Applies dual execution to obtain practical malicious-secure PSI with strong concrete performance.

Improves malicious-secure PSI based on Bloom filters and fixes security subtleties in earlier constructions.