General adversaries in unconditional multi-party computation

DOI10.1007/978-3-540-48000-6_19MaRDI QIDQ4502503zbMATH OpenFDO

Authors Matthias Fitzi, Martin Hirt, Ueli M. Maurer

Publication date 27 January 2002

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

Full work available at URL https://doi.org/10.1007/978-3-540-48000-6_19

zbMATH Keywords

general adversariesmixed modelmulti-party computationunconditional security

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• Trading correctness for privacy in unconditional multi-party computation. (Extended abstract)
• scientific article; zbMATH DE number 1256784
• Player simulation and general adversary structures in perfect multiparty computation
• Communication-efficient MPC for general adversary structures

Cited in

(26)

• Player simulation and general adversary structures in perfect multiparty computation
• MPC with friends and foes
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Secure multi-party computation made simple
• Secure MPC: laziness leads to GOD
• Tolerating generalized mobile adversaries in secure multiparty computation
• Efficient general-adversary multi-party computation
• Universally composable security with local adversaries
• Player-centric Byzantine agreement
• scientific article; zbMATH DE number 4191080 (Why is no real title available?)
• How to deal with malicious users in privacy‐preserving distributed data mining
• Secure Protocols with Asymmetric Trust
• MPC vs. SFE : Unconditional and Computational Security
• Scalable and Unconditionally Secure Multiparty Computation
• Multi-Party Computation with Omnipresent Adversary
• Trading correctness for privacy in unconditional multi-party computation. (Extended abstract)
• Robustness for free in unconditional multi-party computation
• All Classical Adversary Methods Are Equivalent for Total Functions
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Rationality and Adversarial Behavior in Multi-party Computation
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Fully-secure MPC with minimal trust
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
• The lazy adversary conjecture fails

This page was built for publication: General adversaries in unconditional multi-party computation

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