GP-ORAM: A Generalized Partition ORAM

Abstract

Oblivious RAM (ORAM) is a provable technique to protect a user's access pattern to outsourced data. Recently, many ORAM constructions have been proposed, but most of them are impractical due to high communication and user-side storage costs. Motivated by Partition ORAM (P-ORAM) [16], a stateof-the-art communication-efficient ORAM construction, this paper proposes GPORAM (Generalized Partition ORAM) as a new framework to assemble multiple ORAM partitions together while overcoming the limitations of the P-ORAM construction. GP-ORAM allows smaller and adjustable number of partitions, fully utilizes the available user-side storage to reduce communication cost, and can efficiently export the index table to the server. As a result, GP-ORAM incurs low bandwidth cost (i.e., O(logN) data blocks per query in practice) and has significantly less user-side storage cost than P-ORAM.We demonstrate the security and practicality of GP-ORAM through extensive performance analysis. , a stateof-the-art communication-efficient ORAM construction, this paper proposes GP-ORAM (Generalized Partition ORAM) as a new framework to assemble multiple ORAM partitions together while overcoming the limitations of the P-ORAM construction. GP-ORAM allows smaller and adjustable number of partitions, fully utilizes the available user-side storage to reduce communication cost, and can efficiently export the index table to the server. As a result, GP-ORAM incurs low bandwidth cost (i.e., O(log N ) data blocks per query in practice) and has significantly less user-side storage cost than P-ORAM. We demonstrate the security and practicality of GP-ORAM through extensive performance analysis.

Розробка Моделі Захищеного Інтерфейсу Передачі Даних При Роботі З Хмарними Сервісами

“…Кожен з розділів працює відповідно до інтерфейсу ORAM, а алгоритм розташування блоків відповідно до карти розділів при цьому утримує лише користувач. Алгоритми «Burst ORAM» [10], «Partition ORAM» [11,12],«Ring ORAM» [13] і «Path ORAM» [14] є типовими алгоритмами, що дозволяють оптимізувати запропонований підхід з метою зменшення затримки під час передачі даних у рамках захищеного протоколу класу ORAM. Проведений аналіз показав високу актуальність робіт у галузі оптимізації алгоритмів організації захищених інтерфейсів класуORAM.…”

Data access pattern protection in cloud storage

“…Therefore, researchers have been exploring ways to protect users' access patterns and various schemes have been proposed in the literature. Among them, Oblivious RAM (ORAM) [27,70,71,29,57,30,31,73,74,32,40,45,22,20,72,61,65,24,66,51,59,68,78,69,48,52,64,58,53,14,49,21,75,8,16,15,76,63,50,60,47,13,46] and Private Information Retrieval (PIR) [3,62,56,10,5,43,25,…”

“…As the first ORAM solution, Bucket Hash ORAM (BH-ORAM [27]) uses one normal hash function for each of its log N layers. Thus, the server-side storage for each layer is a hash In iORAMs [61,65,24,66,51,59,68,78,69,48,52,64,58,53,14,49,21,75,8,16,15,76,63,50,60,46], index is used to locate a user's desired data on the remote server. Due to the obliviousness requirement, index should be either stored at the user side or outsourced to the storage server as an oblivious data structure (e.g.…”

“…In the third work, we proposed a generalized partition ORAM, GP-ORAM [78], which is motivated by the design of P-ORAM [65]. P-ORAM construction was designed to achieve a low and thus practically acceptable communication cost.…”