Minimal complete primitives for secure multi-party computation
From MaRDI portal
Publication:1777285
DOI10.1007/S00145-004-0150-YzbMath1075.68025OpenAlexW2046757939MaRDI QIDQ1777285
Juan A. Garay, Rafail Ostrovsky, Matthias Fitzi, 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
Related Items (5)
On fully secure MPC with solitary output ⋮ Quantum detectable Byzantine agreement for distributed data trust management in blockchain ⋮ Cryptanalysis and improvement of the novel quantum scheme for secure two-party distance computation ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ On Complete Primitives for Fairness
This page was built for publication: Minimal complete primitives for secure multi-party computation
