.- Multi-Party Computation.
.- Traceable Secret Sharing Schemes for General Access Structures.
.- Traceable Secret Sharing Revisited.
.- Client-Server Homomorphic Secret Sharing in the CRS Model.
.- Simultaneous-Message and Succinct Secure Computation: Reusable and Multiparty Protocols.
.- Non-Interactive Secure Computation with Constant Communication Overhead.
.- On the Communication Complexity of PSM and CDS for Symmetric Functions.
.- Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation.
.- BitGC Made (More) Efficient.
.- Succinct Garbled Circuits with Low Depth Garbling Algorithms.
.- Zebra: Arithmetic Garbled RAM for Large Words from DCR.
.- Information-Theoretic Network-Agnostic MPC with Polynomial Communication.
.- Perfectly Secure Network-Agnostic MPC Comes for Free.
.- New Upper and Lower Bounds for Perfectly Secure MPC.
.- Optimal Good-Case Latency for Sleepy Consensus.
.- Round-Optimal Byzantine Agreement without Trusted Setup.
.- When Trying to Catch Cheaters Breaks the MPC: Breaking and Fixing Delayed Consistency Checks in Trident, Fantastic Four, SWIFT, and Quad.
.- Game Theory Does Not Always Help: The Case of Statistical Multi-Party Coin Tossing.
.- PUFF: Maximally Proactive Security for Free in Perfectly Secure MPC with Guaranteed Output Delivery.
.- Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph.
.- On Succinct Non-Interactive Secure Computation with Malicious Security.