scientific article
From MaRDI portal
Publication:2707411
zbMath0966.94010MaRDI QIDQ2707411
Ueli M. Maurer, Martin Hirt, Bartosz Przydatek
Publication date: 3 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Related Items (19)
ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ Secure message transmission in asynchronous networks ⋮ Multi-party computation with conversion of secret sharing ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Counting Method for Multi-party Computation over Non-abelian Groups ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Bit-Slice Auction Circuit
This page was built for publication:
