Implementing two-party computation efficiently with security against malicious adversaries

Yehuda Lindell; Benny Pinkas; Nigel P. Smart

doi:10.1007/978-3-540-85855-3_2

Implementing two-party computation efficiently with security against malicious adversaries

Yehuda Lindell, Benny Pinkas, Nigel P. Smart

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

88 Scopus citations

Abstract

We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. 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.

Original language	English
Title of host publication	Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings
Pages	2-20
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-540-85855-3_2
State	Published - 2008
Event	6th International Conference on Security and Cryptography for Networks, SCN 2008 - Amalfi, Italy Duration: 10 Sep 2008 → 12 Sep 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5229 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Security and Cryptography for Networks, SCN 2008
Country/Territory	Italy
City	Amalfi
Period	10/09/08 → 12/09/08

Bibliographical note

Funding Information:
The first author was supported by The Israel Science Foundation (grant No. 781/07) and by an Infrastructures grant from the Israeli Ministry of Science. The other authors were supported by the European Union under the FP7-STREP project CACE. The second author was also supported by The Israel Science Foundation (grant No. 860/06).

Funding

The first author was supported by The Israel Science Foundation (grant No. 781/07) and by an Infrastructures grant from the Israeli Ministry of Science. The other authors were supported by the European Union under the FP7-STREP project CACE. The second author was also supported by The Israel Science Foundation (grant No. 860/06).

Funders	Funder number
Israeli Ministry of Science
Seventh Framework Programme	216499
European Commission	FP7-STREP, 860/06
Israel Science Foundation	781/07

Access to Document

10.1007/978-3-540-85855-3_2

Cite this

Lindell, Y., Pinkas, B., & Smart, N. P. (2008). Implementing two-party computation efficiently with security against malicious adversaries. In Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings (pp. 2-20). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5229 LNCS). https://doi.org/10.1007/978-3-540-85855-3_2

Lindell, Yehuda ; Pinkas, Benny ; Smart, Nigel P. / Implementing two-party computation efficiently with security against malicious adversaries. Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings. 2008. pp. 2-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{bc4e4aaa056a44bc9d57cc7451ab66d8,

title = "Implementing two-party computation efficiently with security against malicious adversaries",

abstract = "We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. 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.",

author = "Yehuda Lindell and Benny Pinkas and Smart, {Nigel P.}",

note = "Funding Information: The first author was supported by The Israel Science Foundation (grant No. 781/07) and by an Infrastructures grant from the Israeli Ministry of Science. The other authors were supported by the European Union under the FP7-STREP project CACE. The second author was also supported by The Israel Science Foundation (grant No. 860/06).; 6th International Conference on Security and Cryptography for Networks, SCN 2008 ; Conference date: 10-09-2008 Through 12-09-2008",

year = "2008",

doi = "10.1007/978-3-540-85855-3_2",

language = "אנגלית",

isbn = "3540858547",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "2--20",

booktitle = "Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings",

}

Lindell, Y , Pinkas, B & Smart, NP 2008, Implementing two-party computation efficiently with security against malicious adversaries. in Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5229 LNCS, pp. 2-20, 6th International Conference on Security and Cryptography for Networks, SCN 2008, Amalfi, Italy, 10/09/08. https://doi.org/10.1007/978-3-540-85855-3_2

Implementing two-party computation efficiently with security against malicious adversaries. / Lindell, Yehuda ; Pinkas, Benny; Smart, Nigel P.
Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings. 2008. p. 2-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5229 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Implementing two-party computation efficiently with security against malicious adversaries

AU - Lindell, Yehuda

AU - Pinkas, Benny

AU - Smart, Nigel P.

N1 - Funding Information: The first author was supported by The Israel Science Foundation (grant No. 781/07) and by an Infrastructures grant from the Israeli Ministry of Science. The other authors were supported by the European Union under the FP7-STREP project CACE. The second author was also supported by The Israel Science Foundation (grant No. 860/06).

PY - 2008

Y1 - 2008

N2 - We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. 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.

AB - We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. 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.

UR - http://www.scopus.com/inward/record.url?scp=52149120767&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85855-3_2

DO - 10.1007/978-3-540-85855-3_2

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:52149120767

SN - 3540858547

SN - 9783540858546

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 2

EP - 20

BT - Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings

T2 - 6th International Conference on Security and Cryptography for Networks, SCN 2008

Y2 - 10 September 2008 through 12 September 2008

ER -

Lindell Y , Pinkas B, Smart NP. Implementing two-party computation efficiently with security against malicious adversaries. In Security and Cryptography for Networks - 6th International Conference, SCN 2008, Proceedings. 2008. p. 2-20. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-85855-3_2

Implementing two-party computation efficiently with security against malicious adversaries

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this