Efficient three-party computation from cut-and-choose

Seung Geol Choi; Jonathan Katz; Alex J. Malozemoff; Vassilis Zikas

doi:10.1007/978-3-662-44381-1_29

Efficient three-party computation from cut-and-choose

Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, Vassilis Zikas

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

Abstract

With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols - in particular, the cut-and-choose approach - can be adapted to the multi-party setting. In this work we explore the possibility of using cut-and-choose for practical secure three-party computation. The three-party case has been studied in prior work in the semi-honest setting, and is motivated by the observation that real-world deployments of multi-party computation are likely to involve few parties. We propose a constant-round protocol for three-party computation tolerating any number of malicious parties, whose computational cost is only a small constant worse than that of state-of-the-art two-party protocols.

Original language	English
Title of host publication	Advances in Cryptology - CRYPTO 2014
Subtitle of host publication	34th Annual Cryptology Conference, Proceedings
Editors	Juan A. Garay, Rosario Gennaro
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	513-530
Number of pages	18
Edition	PART 2
ISBN (Electronic)	978-3-662-44381-1
ISBN (Print)	978-3-662-44380-4
DOIs	https://doi.org/10.1007/978-3-662-44381-1_29
Publication status	Published - 21 Aug 2014
Event	34rd Annual International Cryptology Conference - Santa Barbara, United States Duration: 17 Aug 2014 → 21 Aug 2014 https://www.iacr.org/conferences/crypto2014/index.html

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer, Berlin, Heidelberg
Number	Part II
Volume	8617
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	34rd Annual International Cryptology Conference
Abbreviated title	CRYPTO 2014
Country/Territory	United States
City	Santa Barbara
Period	17/08/14 → 21/08/14
Internet address	https://www.iacr.org/conferences/crypto2014/index.html

Access to Document

10.1007/978-3-662-44381-1_29Licence: All Rights Reserved

https://link.springer.com/chapter/10.1007%2F978-3-662-44381-1_29Licence: All Rights Reserved

Cite this

Choi, S. G., Katz, J., Malozemoff, A. J., & Zikas, V. (2014). Efficient three-party computation from cut-and-choose. In J. A. Garay, & R. Gennaro (Eds.), Advances in Cryptology - CRYPTO 2014 : 34th Annual Cryptology Conference, Proceedings (PART 2 ed., pp. 513-530). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8617, No. Part II). Springer. https://doi.org/10.1007/978-3-662-44381-1_29

Choi, Seung Geol ; Katz, Jonathan ; Malozemoff, Alex J. et al. / Efficient three-party computation from cut-and-choose. Advances in Cryptology - CRYPTO 2014 : 34th Annual Cryptology Conference, Proceedings. editor / Juan A. Garay ; Rosario Gennaro. PART 2. ed. Berlin, Heidelberg : Springer, 2014. pp. 513-530 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Part II).

@inproceedings{8fd550c96bb64322a992c66636ace1e1,

title = "Efficient three-party computation from cut-and-choose",

abstract = "With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols - in particular, the cut-and-choose approach - can be adapted to the multi-party setting. In this work we explore the possibility of using cut-and-choose for practical secure three-party computation. The three-party case has been studied in prior work in the semi-honest setting, and is motivated by the observation that real-world deployments of multi-party computation are likely to involve few parties. We propose a constant-round protocol for three-party computation tolerating any number of malicious parties, whose computational cost is only a small constant worse than that of state-of-the-art two-party protocols.",

author = "Choi, {Seung Geol} and Jonathan Katz and Malozemoff, {Alex J.} and Vassilis Zikas",

year = "2014",

month = aug,

day = "21",

doi = "10.1007/978-3-662-44381-1_29",

language = "English",

isbn = "978-3-662-44380-4",

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

publisher = "Springer",

number = "Part II",

pages = "513--530",

editor = "Garay, {Juan A.} and Rosario Gennaro",

booktitle = "Advances in Cryptology - CRYPTO 2014",

address = "United Kingdom",

edition = "PART 2",

note = "34rd Annual International Cryptology Conference, CRYPTO 2014 ; Conference date: 17-08-2014 Through 21-08-2014",

url = "https://www.iacr.org/conferences/crypto2014/index.html",

}

Choi, SG, Katz, J, Malozemoff, AJ & Zikas, V 2014, Efficient three-party computation from cut-and-choose. in JA Garay & R Gennaro (eds), Advances in Cryptology - CRYPTO 2014 : 34th Annual Cryptology Conference, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. Part II, vol. 8617, Springer, Berlin, Heidelberg, pp. 513-530, 34rd Annual International Cryptology Conference, Santa Barbara, California, United States, 17/08/14. https://doi.org/10.1007/978-3-662-44381-1_29

Efficient three-party computation from cut-and-choose. / Choi, Seung Geol; Katz, Jonathan; Malozemoff, Alex J. et al.
Advances in Cryptology - CRYPTO 2014 : 34th Annual Cryptology Conference, Proceedings. ed. / Juan A. Garay; Rosario Gennaro. PART 2. ed. Berlin, Heidelberg: Springer, 2014. p. 513-530 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8617, No. Part II).

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

TY - GEN

T1 - Efficient three-party computation from cut-and-choose

AU - Choi, Seung Geol

AU - Katz, Jonathan

AU - Malozemoff, Alex J.

AU - Zikas, Vassilis

PY - 2014/8/21

Y1 - 2014/8/21

N2 - With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols - in particular, the cut-and-choose approach - can be adapted to the multi-party setting. In this work we explore the possibility of using cut-and-choose for practical secure three-party computation. The three-party case has been studied in prior work in the semi-honest setting, and is motivated by the observation that real-world deployments of multi-party computation are likely to involve few parties. We propose a constant-round protocol for three-party computation tolerating any number of malicious parties, whose computational cost is only a small constant worse than that of state-of-the-art two-party protocols.

AB - With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols - in particular, the cut-and-choose approach - can be adapted to the multi-party setting. In this work we explore the possibility of using cut-and-choose for practical secure three-party computation. The three-party case has been studied in prior work in the semi-honest setting, and is motivated by the observation that real-world deployments of multi-party computation are likely to involve few parties. We propose a constant-round protocol for three-party computation tolerating any number of malicious parties, whose computational cost is only a small constant worse than that of state-of-the-art two-party protocols.

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

U2 - 10.1007/978-3-662-44381-1_29

DO - 10.1007/978-3-662-44381-1_29

M3 - Conference contribution

AN - SCOPUS:84905399102

SN - 978-3-662-44380-4

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

SP - 513

EP - 530

BT - Advances in Cryptology - CRYPTO 2014

A2 - Garay, Juan A.

A2 - Gennaro, Rosario

PB - Springer

CY - Berlin, Heidelberg

T2 - 34rd Annual International Cryptology Conference

Y2 - 17 August 2014 through 21 August 2014

ER -

Choi SG, Katz J, Malozemoff AJ, Zikas V. Efficient three-party computation from cut-and-choose. In Garay JA, Gennaro R, editors, Advances in Cryptology - CRYPTO 2014 : 34th Annual Cryptology Conference, Proceedings. PART 2 ed. Berlin, Heidelberg: Springer. 2014. p. 513-530. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Part II). doi: 10.1007/978-3-662-44381-1_29

Efficient three-party computation from cut-and-choose

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this