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

DOI10.1145/301250.301313MaRDI QIDQ2819552zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(6)

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

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)