A little honesty goes a long way. The two-tier model for secure multiparty computation

DOI10.1007/978-3-662-46494-6_7zbMATH Open1354.94029OpenAlexW189782339MaRDI QIDQ5261627FDOQ5261627

Ran Gelles, Moti Yung, Aggelos Kiayias, D. S. Johnson, Juan Garay

Publication date: 6 July 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_7

Recommendations

• Proactive secure multiparty computation with a dishonest majority
• Secure multiparty computation with minimal interaction
• Fast large-scale honest-majority MPC for malicious adversaries
• Round-optimal secure multiparty computation with honest majority
• On achieving the ``best of both worlds in secure multiparty computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (1)

• Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees

This page was built for publication: A little honesty goes a long way. The two-tier model for secure multiparty computation

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