[PDF] Top 20 PanORAMa: Oblivious RAM with Logarithmic Overhead

... an oblivious data structure in the level of capacity 2 i+1 ...the oblivious data structure need to be extracted and included in the larger capacity level for future ...a oblivious hash table for the ... See full document

... With sensitive data being increasingly stored on mobile devices and laptops, hard disk encryption is more important than ever. In partic- ular, being able to plausibly deny that a hard disk contains certain information ... See full document

... using Oblivious RAM (ORAM) ...guarantee oblivious- ness in a trusted client and an untrusted server ...perform oblivious shuffling and re-encryption of the encrypted ...communication ... See full document

... In this study, we show how Ring ORAM improves the performance of secure processors over Path ORAM. We assume the same processor/cache architecture as [5], given in Table 4 of that work. We evaluate a 4 GigaByte ORAM with ... See full document

... We now look at the efficiency of our PORAM construction, when instantiated with the ORAM scheme from section 6 (we assume the rebuild phases are implemented via the Goodrich-Mitzemacher algorithm [15] with the worst-case ... See full document

... simulation overhead for OPRAM: if an OPRAM’s simulation overhead is X , it means that if the original PRAM consumes m CPUs and completes in parallel runtime T, then the oblivious counterpart must ... See full document

... the logarithmic lower bound on ORAM bandwidth blowup shown by Goldreich and Ostrovsky [18, 19, 32], it is now well-understood that this lower bound can be circumvented by leveraging server-side ... See full document

... (larger) RAM stored on a server, where the access pattern is observed by the ...standard RAM model can be transformed using an ”obliv- ious RAM simulator” into a program for the oblivious ... See full document

... bandwidth overhead is at least linear in n, due to an expensive reshuffling procedure that requires downloading a linear number of ...an overhead could make oblivious RAM unsuitable in many ... See full document

... Multi-client security: As this scheme is a generalization of the square-root one, our modifications extend naturally to provide multi-client security. Again, each client should have their own ORAM which they read from. ... See full document

... Oblivious RAM (ORAM) has received increasing attention in the past few ...ious RAM is to enable a client, that can locally store only a small (preferably constant) amount of data, to store remotely N ... See full document

... its overhead, namely the number of memory blocks which need to be accessed to answer a single read or write ...ORAM overhead, where n denotes the number of memory blocks in the logical ...n) overhead ... See full document

... Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky [18,19], allows a trusted CPU (or a trusted computational node) to obliviously access untrusted memory (or storage) during computa- tion, such ... See full document

... storage overhead when the ORAM has also constant ...an oblivious data structure implementing a dictionary interface and able to store roughly N/m blocks into a not-much-larger amount of ... See full document

... However, it turns out that this is not easy. Indeed, two prior works [1, 35] have made endeavors towards this direction using homomorphic encryption. Path-PIR [35] leverages additively homomor- phic encryption (AHE) to ... See full document

... an overhead over random access machine (RAM) programs. This overhead is related to the fact that, to access an array by a data-dependent index, a circuit needs to access the whole ...the ... See full document

... standard oblivious sorting to perform this routing since this would consume a logarithmic extra ...packed oblivious random permutation and packed oblivious sorting over ... See full document

... bandwidth overhead of O √ N log (c+log c+log t+log t+log N N ) , where N is the maximum number of data blocks to be stored, t is an upper bound on the number of accesses, and c is the correctness parameter that ... See full document

... both” RAM and the circuit models: A RAM program handles ran- dom access but is entirely sequential, circuits handle parallelism with variable number of parallel resources ...poly logarithmic, while ... See full document

... general logarithmic lower bounds Ω(log n) on the overhead of offline ORAM compilers—as is implied by the [GO96] lower bound within the “balls and bins” setting—would directly imply new circuit lower ...the ... See full document