Secure Computation 2025
2025-08-04..2025-08-08
Berkeley, United States
who it's for
secure multi-party computation researchers, cryptographers, privacy engineers, applied cryptography engineers, distributed systems researchers, security engineers in finance
topics
garbled circuits optimizations; bit-level garbling (BitGC); information-theoretic MPC communication complexity; constant-round MPC in the plain model; super-rushing adversary models; broadcast versus point-to-point rounds; succinct garbling from homomorphic secret sharing; private information retrieval (PIR) techniques; private set intersection and union at scale; vectorized modular arithmetic on CPUs and GPUs
| title | author | length |
|---|---|---|
| Geometry of Secure Computation | Hemanta Maji | 33m |
Answers whether a two‑party randomized function is information‑theoretically securely computable by giving a finite procedure that reduces the problem to… | ||
| Beyond Boolean Circuits in Garbled Circuits | David Heath | 01h 03m |
Claims that garbled circuits compile arithmetic gates and RAM to a small set of primitives and that, using only symmetric cryptography (a random oracle)… | ||
| BitGC: Garbled Circuits with 1 Bit per Gate | Xiao Wang | 33m |
BitGC claims a rate-one garbling that sends a SWHE-encrypted seed plus one-bit per gate stitching data under ring‑RLWE with key‑dependent‑message security… | ||
| The Communication Complexity Landscape of Information-theoretic MPC | Arpita Patra | 58m |
Draws a clear map: proofs show optimal-resiliency information-theoretic MPC needs Θ(n/s) communication per multiplication when n = 3t+s (synchronous) or n =… | ||
| On the Optimal Round Complexity of Multi-Party Computation in the Plain Model | Luisa Siniscalchi | 30m |
Claims a black-box construction of general MPC in the plain model that matches the known four rounds lower bound for unanimous abort security against up to n−1… | ||
| Peeking into the Future: MPC Resilient to Super-Rushing Adversaries | Ran Cohen | 32m |
Defines a super-rushing adversary that forces some honest parties into round r+1, reads their round r+1 messages, then crafts remaining round r messages. Shows… | ||
| Broadcast Optimal Multi-Party Computation | Divya Ravi | 31m |
Asks which broadcast rounds can be replaced by point-to-point and what guarantees remain: many round‑optimal protocols keep the same round count if all rounds… | ||
| Towards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing | Vipul Goyal | 29m |
A compiler collapses a nonconstant-round secret-sharing MPC into a five-round MPC in the random oracle model, secure against fully malicious adversaries up to… | ||
| How to Share an NP Statement or Combiners for Zero-Knowledge Proofs | Benny Applebaum | 33m |
Claims an information-theoretic construction of t-out-of-n NPSS for arbitrary t and n, built from a new MPC primitive realizable in the OT hybrid model, and… | ||
| Secure Computation and Low-Complexity Cryptography | Yuval Ishai | 01h 06m |
Claims that semi-honest two‑party computation attains constant overhead for semi-honest 2PC by reducing general Boolean circuits to long‑string OTs and… | ||
| A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing | Rachel Lin | 35m |
Framework claims a path between fast symmetric garbling and fully succinct lattice-based schemes by using algebraic homomorphic MACs plus linear homomorphic… | ||
| Private information retrieval at 30: Achievements, disappointments, and open problems | Henry Corrigan-Gibbs | 58m |
Survey of PIR’s 30-year arc: communication shrinks via private polynomial evaluation and homomorphic tools (communication ≈ n^{1/D}), and the derivatives trick… | ||
| Lower-Bounds on Public-Key Operations in PIR | Mohammad Hajiabadi | 35m |
Proves a concrete barrier: any PIR without preprocessing that treats group/HomEnc-style primitives as a simulatable oracle forces the server to do a nearly… | ||
| The Concrete Security of Two-Party Computation: Simple Definitions, and Tight Proofs for PSI and... | Mihir Bellare | 34m |
Proposes a concrete, indistinguishability-based definition called input indistinguishability (InI) and proves it is equivalent to standard simulation for a… | ||
| PULSE: Parallel Private Set Union for Large-Scale Entities | Ni Trieu | 29m |
PULSE presents a PKE-based mPSU that parallelizes all party work so no participants sit idle, uses membership-OT plus additive homomorphic (ElGamal)… | ||
| Distance-Aware OT with Application to Fuzzy PSI | Jaspal Singh | 31m |
Presents a modular, symmetric-key framework that reduces semi-honest fuzzy PSI to a new primitive distance-aware OT and implements it with shared one-out-of-T… | ||
| Updatable Private Set Intersection | Peihan Miao | 32m |
Defines updatable PSI protocols that make per-run cost scale with the update size, presenting three semi-honest constructions: two addition-only (two-sided… | ||
| Efficient Modular Arithmetic using Vectorization on CPUs and GPUs | Srini Devadas | 33m |
Claims a simplified RNS Montgomery method that eliminates unnecessary elementwise modular multiplies and turns a single large-field modular multiply into a… | ||
| Optimizing Pseudorandom Correlation Generators from LPN | Peter Rindal | 32m |
Describes concrete PCG constructions that expand tiny setup keys into millions of correlated values by building VOLE→OT via hash from sparse secret-shared unit… | ||
| Multi-Party Distributed Point Functions | Mingyuan Wang | 35m |
Constructs a multi‑party distributed point function in minicrypt by replacing BGI15’s deterministic combinatorial design with a randomized combinatorial… | ||
| Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols | Juan Garay | 34m |
Shows that generic black-box parallel composition of asynchronous MPC is impossible: both functionally black-box (FBB) and standard protocol black-box (PBB)… | ||
| On the Adaptive Security of Key-Unique Threshold Signatures | Chelsea Komlo | 31m |
Proves two impossibility results about key-unique threshold signatures using metareduction arguments: under any non-interactive computational assumption one… | ||
| Recent Advances in Asynchronous Multi-Party Computation | Chen-Da Liu-Zhang | 34m |
Claims linear communication C·n with optimal resilience n/3, post‑quantum security, and practical implementation called Velox that runs a 200,000‑gate circuit… | ||
| New Techniques for Building Information-Theoretic Asynchronous MPC with Linear Communication | Yifan Song | 32m |
Constructs information‑theoretic asynchronous MPC with malicious security and guaranteed delivery at resilience n = 3t + 1 and reduces prior astronomical costs… | ||
| The modern anonymous credential (how ZK landed in Google Wallet) | Abhi Shelat | 01h 03m |
A modern anonymous credential appears in shipping wallets as a two‑round mdoc that signs salted hashes of CBOR attributes and packs a secure‑element public key… | ||
| Privacy Preserving Aggregation of Ad Conversions using MPC | Daniel Masny | 34m |
Prototype implements a three-party honest-majority MPC with malicious security (abort), using Boolean secret shares, vectorized bitwise operations, a shuffle… | ||
| From 10,000-Party Protocols to Vibe Coding ZK: Engineering Cryptography Through Black-Box Design | Muthu Venkitasubramaniam | 01h 00m |
Startup Ligero implements black-box primitives and ships working systems: 10,000-party RSA key generation uses threshold additively homomorphic encryption… | ||
| Secure Computation in Action: Real-World Deployments in Finance | Antigoni Polychroniadou | 26m |
JP Morgan runs Prime Match and Atlas‑X in production: Prime Match performs encrypted inventory matching, Atlas‑X adds differential privacy to hide concentrated… | ||
| Willow: Secure Aggregation with One-Shot Clients | Mariana Raykova | 40m |
Protocol lets each client send a one-shot clients ciphertext (single message, dynamic join) and offloads setup/verification to a small committee so client work… | ||
| nothing matches | ||