MPC vs. SFE: Perfect Security in a Unified Corruption Model

DOI10.1007/978-3-540-78524-8_14MaRDI QIDQ5445509zbMATH OpenOpenAlexFDO

Authors Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli M. Maurer, Vassilis Zikas

Publication date 5 March 2008

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78524-8_14

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• MPC vs. SFE : Unconditional and Computational Security
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Fully-secure MPC with minimal trust
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
• A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
• On fully secure MPC with solitary output
• Perfectly-Secure MPC with Linear Communication Complexity

Cited in

(12)

• MPC with friends and foes
• Secure MPC: laziness leads to GOD
• Information-theoretically secure MPC against mixed dynamic adversaries
• A unified characterization of completeness and triviality for secure function evaluation
• Player-centric Byzantine agreement
• MPC vs. SFE : Unconditional and Computational Security
• Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
• scientific article; zbMATH DE number 1759772 (Why is no real title available?)
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Fully-secure MPC with minimal trust
• Universally composable almost-everywhere secure computation
• General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption

This page was built for publication: MPC vs. SFE: Perfect Security in a Unified Corruption Model

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