A new paradigm for server-aided MPC

DOI10.62056/AB3WA0L5VTMaRDI QIDQ7326413zbMATH OpenFDO

Authors Alessandra Scafuro, Tanner Verber

Publication date 9 September 2026

Published in Unnamed Author (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AB3WA0L5VT

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• A minimal model for secure computation (extended abstract)
• ATLAS: efficient and scalable MPC in the honest majority setting
• Bringing people of different beliefs together to do UC
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Cryptography in the multi-string model
• Cryptography with weights: MPC, encryption and signatures
• Efficient fully homomorphic encryption from (standard) LWE
• Fiat-Shamir: from practice to theory
• Fluid MPC: secure multiparty computation with dynamic participants
• How to delegate computations publicly
• How to simulate it -- a tutorial on the simulation proof technique
• Le Mans: dynamic and fluid MPC for dishonest majority
• Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
• Multi-client non-interactive verifiable computation
• Multi-key fully-homomorphic encryption in the plain model
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On linear communication complexity for (maximally) fluid MPC
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Perfect MPC over layered graphs
• Phoenix: secure computation in an unstable network with dropouts and comebacks
• Secure computation on the web: computing without simultaneous interaction
• SNARGs for \(\mathcal{P}\) from LWE
• SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
• SNARGs for P from sub-exponential DDH and QR
• The hunting of the SNARK
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally composable security: a new paradigm for cryptographic protocols
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles

This page was built for publication: A new paradigm for server-aided MPC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326413)