Security through rigorous computation.
Our work connects cryptography, distributed computing and randomized algorithms, with emphasis on efficiency, privacy, correctness and scalability.
Secure multi-party computation
Secure multi-party computation provides a general framework for parties that do not fully trust one another to jointly evaluate a function while preserving privacy and correctness. We study protocols for both two-party and multi-party settings and the algorithmic structures that make them efficient.
Electronic voting, online transactions, blockchain systems, federated learning and privacy-preserving data processing.
Cryptographic foundations
Cryptographic protocols
Design and analysis of protocols with strong security and privacy guarantees.
Post-quantum directions
Cryptographic approaches intended to remain secure in the presence of quantum-capable adversaries.
Randomness & pseudorandomness
Foundational tools used throughout modern cryptography and randomized computation.
Distributed and randomized algorithms
We study communication and coordination in decentralized systems, including deterministic and randomized algorithms, shared-access channels, conflict resolution, consensus-related questions and fault-tolerant distributed computation.
Distributed computation
Coordination among processes in decentralized and potentially faulty environments.
Randomized algorithms
Algorithms that exploit randomness to achieve efficiency, robustness or simplicity.
Combinatorial structures
Advanced combinatorial tools for efficient communication and scalable protocol design.