Efficient implementation of the Orlandi protocol. (English) Zbl 1350.94038

Zhou, Jianying (ed.) et al., Applied cryptography and network security. 8th international conference, ACNS 2010, Beijing, China, June 22–25, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13707-5/pbk). Lecture Notes in Computer Science 6123, 255-272 (2010).
Summary: We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is secure against up to \(n - 1\) static, active adversaries. An efficient implementation of an actively secure self-trust protocol enables a number of multiparty computation where one or more of the parties only trust himself. Examples includes auctions, negotiations, and online gaming. The efficiency of the implementation is largely obtained through an efficient implementation of the Paillier cryptosystem, also described in this paper.
For the entire collection see [Zbl 1190.94005].


94A60 Cryptography
68M12 Network protocols
Full Text: DOI