Adaptive versus non-adaptive security of multi-party protocols
From MaRDI portal
Recommendations
Cited in
(18)- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- scientific article; zbMATH DE number 1722683 (Why is no real title available?)
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Understanding adaptivity: random systems revisited
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- Adaptive versus Static Security in the UC Model
- Completeness theorems for adaptively secure broadcast
- Perfect MPC over layered graphs
- Constant round adaptively secure protocols in the tamper-proof hardware model
- On the Power of Secure Two-Party Computation
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Adaptively Secure Two-Party Computation with Erasures
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Adaptively secure MPC with sublinear communication complexity
- On the power of secure two-party computation
- Efficient one-sided adaptively secure computation
This page was built for publication: Adaptive versus non-adaptive security of multi-party protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882568)