Efficient implementation of the Orlandi protocol

DOI10.1007/978-3-642-13708-2_16MaRDI QIDQ3575052zbMATH OpenOpenAlexFDO

Authors Marc X. Makkes, Janus Dam Nielsen, Thomas Pelle Jakobsen

Publication date 6 July 2010

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13708-2_16

zbMATH Keywords

homomorphic encryptionMPCprotocolssecure multiparty computation

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• Efficient multiparty protocols using circuit randomization
• Multiparty computation for dishonest majority: from passive to active security at low cost
• Multiparty computation from threshold homomorphic encryption
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

Cited in

(3)

• Simple and efficient two-server ORAM
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces

This page was built for publication: Efficient implementation of the Orlandi protocol

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