Implementing two-party computation efficiently with security against malicious adversaries. (English) Zbl 1180.68152

Ostrovsky, Rafail (ed.) et al., Security and cryptography for networks. 6th international conference, SCN 2008, Amalfi, Italy, September 10–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85854-6/pbk). Lecture Notes in Computer Science 5229, 2-20 (2008).
Summary: We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [Y. Lindell and B. Pinkas, “An efficient protocol for secure two-party computation in the presence of malicious adversaries”, Lect. Notes Comput. Sci. 4515, 52–78 (2007; Zbl 1141.94362)]. This is the first running system which provides security against malicious adversaries according to rigorous security definition and without using the random oracle model. We ran experiments showing that the protocol is practical. In addition we show that there is little benefit in replacing subcomponents secure in the standard model with those which are only secure in the random oracle model. Throughout we pay particular attention to using the most efficient subcomponents in the protocol, and we select parameters for the encryption schemes, commitments and oblivious transfers which are consistent with a security level equivalent to AES-128.
For the entire collection see [Zbl 1148.68006].


68P25 Data encryption (aspects in computer science)
94A60 Cryptography


Zbl 1141.94362
Full Text: DOI Link