Phantom

This paper proposes a novel version of path oblivious random access memory called radix path ORAM (R-Path ORAM) with a large root (radix) bucket size but a small fixed size for all the other buckets in the tree. A detailed analysis of the root bucket occupancy is conducted to provide a closed-form solution of the required root bucket size that maintains a negligible failure probability. The performance of the R-Path ORAM is evaluated and compared against the traditional Path ORAM using a unified platform. The conducted experiments clearly show that R-Path ORAM provides much lower server storage and average response time than the seminal Path ORAM. Furthermore, we propose a background eviction technique to eventually reduce the root bucket size and avoid system failure. The conducted experiments on the unified platform showed the usefulness and efficiency of the proposed two-way eviction technique in successfully reducing the root bucket size while incurring a very small overhead.

show abstract

“…Mass et al [27] were the first to introduce tree top caching. In tree top caching the top k levels of the ORAM tree are cached in the stash.…”

Section: Related Workmentioning

confidence: 99%

“…They proposed caching the top k levels of the tree. We will adopt the same technique proposed by Mass et al [27]. However, we will only cache the root bucket as we intend to make it larger than all the other buckets.…”

Section: Related Workmentioning

confidence: 99%

Radix Path: A Reduced Bucket Size ORAM for Secure Cloud Storage

Al-Saleh

Belghith

2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Maas et al [31] introduced the first Path ORAM implementation on hardware. They named it Parallel Hardware to make Applications Non-leaky Through Oblivious Memory (Phantom).…”

Section: Related Workmentioning

confidence: 99%

“…These top three levels only contain seven buckets. We could have just read the first three levels and saved them in the stash by using the tree-top caching technique proposed by Maas et al [31]. Moreover, the problem was formulated as a partition problem making it an NP-hard problem.…”

Section: Related Workmentioning

confidence: 99%

Locality Aware Path ORAM: Implementation, Experimentation and Analytical Modeling

Al-Saleh

Belghith

2018

Computers

View full text Add to dashboard Cite

In this paper, we propose an advanced implementation of Path ORAM to hide the access pattern to outsourced data into the cloud. This implementation takes advantage of eventual data locality and popularity by introducing a small amount of extra storage at the client side. Two replacement strategies are used to manage this extra storage (cache): the Least Recently Used (LRU) and the Least Frequently Used (LFU). Using the same test bed, conducted experiments clearly show the superiority of the advanced implementation compared to the traditional Path ORAM implementation, even for a small cache size and reduced data locality. We then present a mathematical model that provides closed form solutions when data requests follow a Zipf distribution with non-null parameter. This model is showed to have a small and acceptable relative error and is then well validated by the conducted experimental results.

show abstract

“…Protection from information leakage from memory access patterns is a long recognized issue that is solved by cryptographic techniques like oblivious RAM [21][22][23][24][25] and private information retrieval (PIR) [26][27][28][29]. Both can be used in a black-box manner to resolve the above issues, yet the concrete selection of a scheme and analysis of security and complexity impacts is beyond the scope of this article (subject of future research).…”

Section: Fixing Memory Access and Branching Leakagesmentioning

confidence: 99%

Private function evaluation by local two-party computation

Raß

Schartner

Brodbeck

2015

EURASIP J. on Info. Security

View full text Add to dashboard Cite

Information processing services are becoming increasingly pervasive, such as is demonstrated by the Internet of Things or smart grids. Given the importance that these services have reached in our daily life, the demand for security and privacy in the data processing appears equally large. Preserving the privacy of data during its processing is a challenging issue that has led to ingenious new cryptographic solutions, such as fully homomorphic encryption (to name only one). An optimal cryptographic support for private data processing must in any case be scalable and lightweight. To this end, we discuss the application of standard (off-the-shelf) cryptography to enable the computation of any function under permanent disguise (encryption). Using a local form of multiparty computation (essentially in a non-distributed fashion), we show how to execute any data processing algorithm in complete privacy. Our solution can, for example, be used with smart grid equipment, when small hardware security modules are locally available (such as in smart meters).

show abstract

Phantom

Cited by 143 publications

References 62 publications

Radix Path: A Reduced Bucket Size ORAM for Secure Cloud Storage

Radix Path: A Reduced Bucket Size ORAM for Secure Cloud Storage

Locality Aware Path ORAM: Implementation, Experimentation and Analytical Modeling

Private function evaluation by local two-party computation

Contact Info

Product

Resources

About