scientific article; zbMATH DE number 1842487
From MaRDI portal
Publication:4783721
zbMath1002.94523MaRDI QIDQ4783721
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390101
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
ATLAS: efficient and scalable MPC in the honest majority setting ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Batch secret sharing for secure multi-party computation in asynchronous network ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Multi-party computation with conversion of secret sharing ⋮ Robust encryption ⋮ Secure multi-party computation made simple ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ OT-Combiners via Secure Computation ⋮ Counting Method for Multi-party Computation over Non-abelian Groups ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
This page was built for publication:
