Gradual gram and secure computation for ram programs

Carmit Hazay; Mor Lilintal

doi:10.1007/978-3-030-57990-6_12

Gradual gram and secure computation for ram programs

Carmit Hazay, Mor Lilintal

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

2 Scopus citations

Abstract

Despite the fact that the majority of applications encountered in practice today are captured more efficiently by RAM programs, the area of secure two-party computation (2PC) has seen tremendous improvement mostly when the function is represented by Boolean circuits. One of the most studied objects in this domain is garbled circuits. Analogously, garbled RAM (GRAM) provide similar security guarantees for RAM programs with applications to constant round 2PC. In this work we consider the notion of gradual GRAM which requires no memory garbling algorithm. Our approach provides several qualitative advantages over prior works due to the conceptual similarity to the analogue garbling mechanism for Boolean circuits. We next revisit the GRAM construction from[11] and improve it in two orthogonal aspects: match it directly with tree-based ORAMs and explore its consistency with gradual ORAM.

Original language	English
Title of host publication	Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings
Editors	Clemente Galdi, Vladimir Kolesnikov
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	233-252
Number of pages	20
ISBN (Print)	9783030579890
DOIs	https://doi.org/10.1007/978-3-030-57990-6_12
State	Published - 2020
Event	12th International Conference on Security and Cryptography for Networks, SCN 2020 - Amalfi, Italy Duration: 14 Sep 2020 → 16 Sep 2020

Publication series

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

Conference

Conference	12th International Conference on Security and Cryptography for Networks, SCN 2020
Country/Territory	Italy
City	Amalfi
Period	14/09/20 → 16/09/20

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2020.

Access to Document

10.1007/978-3-030-57990-6_12

Cite this

Hazay, C., & Lilintal, M. (2020). Gradual gram and secure computation for ram programs. In C. Galdi, & V. Kolesnikov (Eds.), Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings (pp. 233-252). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12238 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-57990-6_12

Hazay, Carmit ; Lilintal, Mor. / Gradual gram and secure computation for ram programs. Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings. editor / Clemente Galdi ; Vladimir Kolesnikov. Springer Science and Business Media Deutschland GmbH, 2020. pp. 233-252 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1812810ee0604abfb9a1ef1bb87d2d36,

title = "Gradual gram and secure computation for ram programs",

abstract = "Despite the fact that the majority of applications encountered in practice today are captured more efficiently by RAM programs, the area of secure two-party computation (2PC) has seen tremendous improvement mostly when the function is represented by Boolean circuits. One of the most studied objects in this domain is garbled circuits. Analogously, garbled RAM (GRAM) provide similar security guarantees for RAM programs with applications to constant round 2PC. In this work we consider the notion of gradual GRAM which requires no memory garbling algorithm. Our approach provides several qualitative advantages over prior works due to the conceptual similarity to the analogue garbling mechanism for Boolean circuits. We next revisit the GRAM construction from[11] and improve it in two orthogonal aspects: match it directly with tree-based ORAMs and explore its consistency with gradual ORAM.",

author = "Carmit Hazay and Mor Lilintal",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.; 12th International Conference on Security and Cryptography for Networks, SCN 2020 ; Conference date: 14-09-2020 Through 16-09-2020",

year = "2020",

doi = "10.1007/978-3-030-57990-6_12",

language = "אנגלית",

isbn = "9783030579890",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "233--252",

editor = "Clemente Galdi and Vladimir Kolesnikov",

booktitle = "Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings",

address = "גרמניה",

}

Hazay, C & Lilintal, M 2020, Gradual gram and secure computation for ram programs. in C Galdi & V Kolesnikov (eds), Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12238 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 233-252, 12th International Conference on Security and Cryptography for Networks, SCN 2020, Amalfi, Italy, 14/09/20. https://doi.org/10.1007/978-3-030-57990-6_12

Gradual gram and secure computation for ram programs. / Hazay, Carmit; Lilintal, Mor.
Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings. ed. / Clemente Galdi; Vladimir Kolesnikov. Springer Science and Business Media Deutschland GmbH, 2020. p. 233-252 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12238 LNCS).

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

TY - GEN

T1 - Gradual gram and secure computation for ram programs

AU - Hazay, Carmit

AU - Lilintal, Mor

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2020.

PY - 2020

Y1 - 2020

N2 - Despite the fact that the majority of applications encountered in practice today are captured more efficiently by RAM programs, the area of secure two-party computation (2PC) has seen tremendous improvement mostly when the function is represented by Boolean circuits. One of the most studied objects in this domain is garbled circuits. Analogously, garbled RAM (GRAM) provide similar security guarantees for RAM programs with applications to constant round 2PC. In this work we consider the notion of gradual GRAM which requires no memory garbling algorithm. Our approach provides several qualitative advantages over prior works due to the conceptual similarity to the analogue garbling mechanism for Boolean circuits. We next revisit the GRAM construction from[11] and improve it in two orthogonal aspects: match it directly with tree-based ORAMs and explore its consistency with gradual ORAM.

AB - Despite the fact that the majority of applications encountered in practice today are captured more efficiently by RAM programs, the area of secure two-party computation (2PC) has seen tremendous improvement mostly when the function is represented by Boolean circuits. One of the most studied objects in this domain is garbled circuits. Analogously, garbled RAM (GRAM) provide similar security guarantees for RAM programs with applications to constant round 2PC. In this work we consider the notion of gradual GRAM which requires no memory garbling algorithm. Our approach provides several qualitative advantages over prior works due to the conceptual similarity to the analogue garbling mechanism for Boolean circuits. We next revisit the GRAM construction from[11] and improve it in two orthogonal aspects: match it directly with tree-based ORAMs and explore its consistency with gradual ORAM.

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

U2 - 10.1007/978-3-030-57990-6_12

DO - 10.1007/978-3-030-57990-6_12

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

AN - SCOPUS:85091187212

SN - 9783030579890

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

SP - 233

EP - 252

BT - Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings

A2 - Galdi, Clemente

A2 - Kolesnikov, Vladimir

PB - Springer Science and Business Media Deutschland GmbH

T2 - 12th International Conference on Security and Cryptography for Networks, SCN 2020

Y2 - 14 September 2020 through 16 September 2020

ER -

Hazay C, Lilintal M. Gradual gram and secure computation for ram programs. In Galdi C, Kolesnikov V, editors, Security and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2020. p. 233-252. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-57990-6_12

Gradual gram and secure computation for ram programs

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this