Robustness for free in unconditional multi-party computation

DOI10.1007/3-540-44647-8_6MaRDI QIDQ4783721zbMATH OpenFDO

Authors Martin Hirt, Ueli M. Maurer

Publication date 8 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2139/21390101

zbMATH Keywords

multi-party computation protocolsecurity

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Scalable and Unconditionally Secure Multiparty Computation
• Robust Multiparty Computation with Linear Communication Complexity
• Efficient secure multi-party computation. (Extended Abstract)
• General adversaries in unconditional multi-party computation
• Round Efficient Unconditionally Secure Multiparty Computation Protocol

Cited in

(23)

• Robust encryption
• Guaranteed output delivery comes free in honest majority MPC
• Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
• ATLAS: efficient and scalable MPC in the honest majority setting
• High throughput secure MPC over small population in hybrid networks (extended abstract)
• Secure multi-party computation made simple
• Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
• Efficient secure multi-party computation. (Extended Abstract)
• Linear overhead optimally-resilient robust MPC using preprocessing
• Active security in multiparty computation over black-box groups
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups
• Scalable and Unconditionally Secure Multiparty Computation
• scientific article; zbMATH DE number 1952911 (Why is no real title available?)
• OT-Combiners via Secure Computation
• Counting Method for Multi-party Computation over Non-abelian Groups
• Robust Multiparty Computation with Linear Communication Complexity
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Batch secret sharing for secure multi-party computation in asynchronous network
• Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
• Multi-party computation with conversion of secret sharing
• Scalable agreement protocols with optimal optimistic efficiency
• Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
• Proximity gaps for Reed-Solomon codes

This page was built for publication: Robustness for free in unconditional multi-party computation

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