Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)

DOI10.1145/301250.301313zbMATH Open1345.68017OpenAlexW2004436277MaRDI QIDQ2819552FDOQ2819552

Authors: Ran Canetti, Rafail Ostrovsky 

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301313

Recommendations

• scientific article; zbMATH DE number 1256784
• scientific article; zbMATH DE number 2013820
• Universally composable two-party and multi-party secure computation
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network protocols (68M12)

Cited In (5)

• Broadcast-optimal two-round MPC
• Impossibility results for universal composability in public-key models and with fixed inputs
• Security against covert adversaries: Efficient protocols for realistic adversaries
• When is a semi-honest secure multiparty computation valuable?
• On succinct arguments and witness encryption from groups

This page was built for publication: Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)

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