Proof-Carrying Data from Accumulation Schemes
Linear-Time Arguments with Sublinear Verification from Tensor Codes
Barriers for Succinct Arguments in the Random Oracle Model
Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction
Batch Verification and Proofs of Proximity with Polylog Overhead
Batch Verification for Statistical Zero Knowledge Proofs
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads
On the Price of Concurrency in Group Ratcheting Protocols
Stronger Security and Constructions of Multi-Designated Verifier Signatures
Continuous Group Key Agreement with Active Security
Round Optimal Secure Multiparty Computation from Minimal Assumptions
Reusable Two-Round MPC from DDH
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation
Secure Massively Parallel Computation for Dishonest Majority
Towards Multiparty Computation Withstanding Coercion of All Parties
Synchronous Constructive Cryptography
Topology-Hiding Communication from Minimal Assumptions.
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More
On Statistical Security in Two-Party Computation
The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures
On the Power of an Honest Majority in Three-Party Computation Without Broadcast
A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity
On the Round Complexity of the Shuffle Model.