scientific article; zbMATH DE number 1302842
From MaRDI portal
Publication:4249325
zbMath0938.68037MaRDI QIDQ4249325
Martin Hirt, Matthias Fitzi, Ueli M. Maurer
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity ⋮ On minimal connectivity requirements for secure message transmission in directed networks ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Secure MPC: laziness leads to GOD ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Multi-party computation with conversion of secret sharing ⋮ Player-Centric Byzantine Agreement ⋮ Secure multi-party computation made simple ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ MPC vs. SFE : Unconditional and Computational Security ⋮ Efficient Simultaneous Broadcast ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
This page was built for publication:
