Statistical layered MPC
From MaRDI portal
Cites work
- Fluid MPC: secure multiparty computation with dynamic participants
- How to share a secret
- How to withstand mobile virus attacks (extended abstract)
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 2086727 (Why is no real title available?)
- Nearly optimal robust secret sharing against rushing adversaries
- Perfect MPC over layered graphs
- Perfectly secure message transmission
- Player simulation and general adversary structures in perfect multiparty computation
- Security and composition of multiparty cryptographic protocols
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Synchronous constructive cryptography
- The Byzantine generals problem
- The round complexity of verifiable secret sharing and secure multicast
- Theory of Cryptography
- Universally composable synchronous computation
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
Cited in
(4)- Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
- Towards scalable YOSO MPC via packed secret-sharing
- Rumors MPC: GOD for dynamic committees, low communication via constant-round chat
- PUFF: maximally \underline{p}roactive sec\underline{u}rity \underline{f}or \underline{f}ree in perfectly secure mpc with guaranteed output delivery
This page was built for publication: Statistical layered MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955262)
