Gradual GRAM and secure computation for RAM programs1

Autor:	Carmit Hazay, Mor Lilintal
Rok vydání:	2022
Předmět:	Theoretical computer science Similarity (geometry) Computer Networks and Communications Computer science Computation Boolean circuit Domain (software engineering) Tree (data structure) Consistency (database systems) Constant (computer programming) Hardware and Architecture ComputingMethodologies_DOCUMENTANDTEXTPROCESSING Secure multi-party computation Safety Risk Reliability and Quality Software
Zdroj:	Journal of Computer Security. 30:197-229
ISSN:	1875-8924 0926-227X
Popis:	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 for 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 (In STOC (2015) 449–458) and improve it in two orthogonal aspects: match it directly with tree-based ORAMs and explore its consistency with gradual ORAM.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e7cfdb780fc6502ec8d0e09f2378f69b https://doi.org/10.3233/jcs-200107 Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.