Constant-round maliciously secure two-party computation in the RAM model

Carmit Hazay; Avishay Yanai

doi:10.1007/978-3-662-53641-4_20

Constant-round maliciously secure two-party computation in the RAM model

Carmit Hazay, Avishay Yanai

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Bar-Ilan University

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

8 Scopus citations

Abstract

The random-access memory (RAM) model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important algorithms. This is in contrast to the classic setting of secure 2-party computation (2PC) that mostly follows the approach for which the desired functionality must be represented as a boolean circuit. In this work we design the first constant round maliciously secure two-party protocol in the RAM model. Our starting point is the garbled RAM construction of Gentry et al. [16] that readily induces a constant round semi-honest two-party protocol for any RAM program assuming identity-based encryption schemes. We show how to enhance the security of their construction into the malicious setting while facing several challenges that stem due to handling the data memory. Next, we show how to apply our techniques to a more recent garbled RAM construction by Garg et al. [13] that is based on one-way functions.

Original language	English
Title of host publication	Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings
Editors	Adam Smith, Martin Hirt
Publisher	Springer Verlag
Pages	521-553
Number of pages	33
ISBN (Print)	9783662536407
DOIs	https://doi.org/10.1007/978-3-662-53641-4_20
State	Published - 2016
Event	14th International Conference on Theory of Cryptography, TCC 2016-B - Beijing, China Duration: 31 Oct 2016 → 3 Nov 2016

Publication series

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

Conference

Conference	14th International Conference on Theory of Cryptography, TCC 2016-B
Country/Territory	China
City	Beijing
Period	31/10/16 → 3/11/16

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2016.

Funding

Supported by the European Research Council under the ERC consolidators grant agreement no. 615172 (HIPS) and by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office. First author’s research partially supported by a grant from the Israel Ministry of Science and Technology (grant No. 3-10883).

Funders	Funder number
European Commission	615172
Ministry of science and technology, Israel	3-10883

Access to Document

10.1007/978-3-662-53641-4_20

Cite this

Hazay, C., & Yanai, A. (2016). Constant-round maliciously secure two-party computation in the RAM model. In A. Smith, & M. Hirt (Eds.), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (pp. 521-553). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9985 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-53641-4_20

Hazay, Carmit ; Yanai, Avishay. / Constant-round maliciously secure two-party computation in the RAM model. Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. editor / Adam Smith ; Martin Hirt. Springer Verlag, 2016. pp. 521-553 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{490bc59f05704fceb4f32a4fa88a75af,

title = "Constant-round maliciously secure two-party computation in the RAM model",

abstract = "The random-access memory (RAM) model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important algorithms. This is in contrast to the classic setting of secure 2-party computation (2PC) that mostly follows the approach for which the desired functionality must be represented as a boolean circuit. In this work we design the first constant round maliciously secure two-party protocol in the RAM model. Our starting point is the garbled RAM construction of Gentry et al. [16] that readily induces a constant round semi-honest two-party protocol for any RAM program assuming identity-based encryption schemes. We show how to enhance the security of their construction into the malicious setting while facing several challenges that stem due to handling the data memory. Next, we show how to apply our techniques to a more recent garbled RAM construction by Garg et al. [13] that is based on one-way functions.",

author = "Carmit Hazay and Avishay Yanai",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2016.; 14th International Conference on Theory of Cryptography, TCC 2016-B ; Conference date: 31-10-2016 Through 03-11-2016",

year = "2016",

doi = "10.1007/978-3-662-53641-4_20",

language = "אנגלית",

isbn = "9783662536407",

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

publisher = "Springer Verlag",

pages = "521--553",

editor = "Adam Smith and Martin Hirt",

booktitle = "Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings",

address = "גרמניה",

}

Hazay, C & Yanai, A 2016, Constant-round maliciously secure two-party computation in the RAM model. in A Smith & M Hirt (eds), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9985 LNCS, Springer Verlag, pp. 521-553, 14th International Conference on Theory of Cryptography, TCC 2016-B, Beijing, China, 31/10/16. https://doi.org/10.1007/978-3-662-53641-4_20

Constant-round maliciously secure two-party computation in the RAM model. / Hazay, Carmit; Yanai, Avishay.
Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. ed. / Adam Smith; Martin Hirt. Springer Verlag, 2016. p. 521-553 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9985 LNCS).

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

TY - GEN

T1 - Constant-round maliciously secure two-party computation in the RAM model

AU - Hazay, Carmit

AU - Yanai, Avishay

PY - 2016

Y1 - 2016

N2 - The random-access memory (RAM) model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important algorithms. This is in contrast to the classic setting of secure 2-party computation (2PC) that mostly follows the approach for which the desired functionality must be represented as a boolean circuit. In this work we design the first constant round maliciously secure two-party protocol in the RAM model. Our starting point is the garbled RAM construction of Gentry et al. [16] that readily induces a constant round semi-honest two-party protocol for any RAM program assuming identity-based encryption schemes. We show how to enhance the security of their construction into the malicious setting while facing several challenges that stem due to handling the data memory. Next, we show how to apply our techniques to a more recent garbled RAM construction by Garg et al. [13] that is based on one-way functions.

AB - The random-access memory (RAM) model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important algorithms. This is in contrast to the classic setting of secure 2-party computation (2PC) that mostly follows the approach for which the desired functionality must be represented as a boolean circuit. In this work we design the first constant round maliciously secure two-party protocol in the RAM model. Our starting point is the garbled RAM construction of Gentry et al. [16] that readily induces a constant round semi-honest two-party protocol for any RAM program assuming identity-based encryption schemes. We show how to enhance the security of their construction into the malicious setting while facing several challenges that stem due to handling the data memory. Next, we show how to apply our techniques to a more recent garbled RAM construction by Garg et al. [13] that is based on one-way functions.

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

U2 - 10.1007/978-3-662-53641-4_20

DO - 10.1007/978-3-662-53641-4_20

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

AN - SCOPUS:84994462222

SN - 9783662536407

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

SP - 521

EP - 553

BT - Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings

A2 - Smith, Adam

A2 - Hirt, Martin

PB - Springer Verlag

T2 - 14th International Conference on Theory of Cryptography, TCC 2016-B

Y2 - 31 October 2016 through 3 November 2016

ER -

Hazay C, Yanai A. Constant-round maliciously secure two-party computation in the RAM model. In Smith A, Hirt M, editors, Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. Springer Verlag. 2016. p. 521-553. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-53641-4_20

Constant-round maliciously secure two-party computation in the RAM model

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this