Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW

DOI10.4230/LIPICS.ITC.2022.15MaRDI QIDQ6561698zbMATH OpenFDO

Authors Gilad Asharov, Ran Cohen, Oren Shochat

Publication date 25 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2022.15

zbMATH Keywords

adaptive securityBGW protocolperfect securitysecure multiparty computation

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Adaptive versus Static Security in the UC Model
• Adaptive security of multi-party protocols, revisited
• scientific article; zbMATH DE number 1722683
• On adaptively secure protocols
• Adaptively secure multi-party computation with dishonest majority

Cited in

(6)

• Universally composable almost-everywhere secure computation
• Peeking into the future: MPC resilient to super-rushing adversaries
• Asymptotically free broadcast in constant expected time via packed VSS
• General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
• Is it even possible? On the parallel composition of asynchronous MPC protocols
• Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph

This page was built for publication: Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW

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