1. The Round Complexity of Statistical MPC with Optimal Resiliency;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. One-out-of-q OT Combiners;IEEE Transactions on Information Theory;2023
3. Randomized Functions with High Round Complexity;Theory of Cryptography;2023
4. Geometry of Secure Two-party Computation;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols;Advances in Information and Computer Security;2022