Secure computation with honest-looking parties (extended abstract)

DOI10.1145/301250.301313zbMath1345.68017OpenAlexW2004436277MaRDI QIDQ2819552

Rafail Ostrovsky, Ran Canetti

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

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

Related Items (4)

Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ On succinct arguments and witness encryption from groups ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Secure computation with honest-looking parties (extended abstract)