Minimal complete primitives for secure multi-party computation

DOI10.1007/S00145-004-0150-YMaRDI QIDQ1777285zbMATH OpenOpenAlexFDO

Authors Matthias Fitzi, Juan Garay, Rafail Ostrovsky, Ueli M. Maurer

Publication date 13 May 2005

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/311729/files/145_2004_Article_150.pdf

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 1848306
• scientific article; zbMATH DE number 1583776
• scientific article; zbMATH DE number 1952886
• Secure multi-party computation made simple
• On the message complexity of secure multiparty computation

Cited in

(10)

• On complete primitives for fairness
• On fully secure MPC with solitary output
• On the power of an honest majority in three-party computation without broadcast
• TinyKeys: a new approach to efficient multi-party computation
• On secure computation of solitary output functionalities with and without broadcast
• Synchronizable fair exchange
• Just how fair is an unreactive world?
• scientific article; zbMATH DE number 1848306 (Why is no real title available?)
• Cryptanalysis and improvement of the novel quantum scheme for secure two-party distance computation
• Quantum detectable Byzantine agreement for distributed data trust management in blockchain

This page was built for publication: Minimal complete primitives for secure multi-party computation

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