scientific article; zbMATH DE number 2013820

MaRDI QIDQ4437112zbMATH OpenFDO

Authors Yehuda Lindell, Shafi Goldwasser

Publication date 7 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2508/25080017.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Distributed systems (68M14)

Recommendations

• Secure multi-party computation without agreement
• On the composition of authenticated Byzantine Agreement
• Characterization of secure multiparty computation without broadcast
• Composition of secure multi-party protocols. A comprehensive study.
• Secure Computation Without Authentication

Cited in

(18)

• Composition of secure multi-party protocols. A comprehensive study.
• Oblivious transfer in incomplete networks
• Efficient constant-round multi-party computation combining BMR and SPDZ
• Secure multi-party computation without agreement
• Adaptive security of multi-party protocols, revisited
• On actively-secure elementary MPC reductions
• Characterization of secure multiparty computation without broadcast
• Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
• Information-Theoretic Security Without an Honest Majority
• Adaptively secure broadcast
• MPC vs. SFE : Unconditional and Computational Security
• scientific article; zbMATH DE number 2009948 (Why is no real title available?)
• scientific article; zbMATH DE number 2086726 (Why is no real title available?)
• Secure Computation Without Authentication
• How to obtain full privacy in auctions
• On the exact round complexity of secure three-party computation
• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
• Secure computation without authentication

This page was built for publication:

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