Filters








713 Hits in 6.8 sec

Dynamic Proofs of Retrievability Via Oblivious RAM

David Cash, Alptekin Küpçü, Daniel Wichs
2015 Journal of Cryptology  
In this work, we give the first solution providing proofs of retrievability for dynamic storage, where the client can perform arbitrary reads/writes on any location within her data by running an efficient  ...  RAM.  ...  PoR via Oblivious RAM.  ... 
doi:10.1007/s00145-015-9216-2 fatcat:lboj5oia3rcixbinr6n2kqjdd4

Dynamic Proofs of Retrievability via Oblivious RAM [chapter]

David Cash, Alptekin Küpçü, Daniel Wichs
2013 Lecture Notes in Computer Science  
In this work, we give the first solution providing proofs of retrievability for dynamic storage, where the client can perform arbitrary reads/writes on any location within her data by running an efficient  ...  RAM.  ...  PoR via Oblivious RAM.  ... 
doi:10.1007/978-3-642-38348-9_17 fatcat:6xdxyj33gzgxpmjrxoiue3ohu4

Special issue on security and privacy techniques in mobile cloud computing

Ilsun You, Jin Li
2016 Journal of Ambient Intelligence and Humanized Computing  
In this paper, the authors proposed dynamic proofs of retrievability via Square-Root Oblivious RAM.  ...  The first paper entitled "Dynamic Proofs of Retrievability with Square-Root Oblivious RAM" by Xu et al. (2015) pointed out that the security challenges, such as efficient checking and proving of data integrity  ...  In this paper, the authors proposed dynamic proofs of retrievability via Square-Root Oblivious RAM.  ... 
doi:10.1007/s12652-016-0390-3 fatcat:hiknxbyj5rcjvaxnulkzyj4z7e

Dynamic Proofs of Retrievability Based on Partitioning-Based Square Root Oblivious RAM

Jian Xu, Zhihao Jiang, Andi Wang, Chen Wang and Fucai Zhou
2018 Computers Materials & Continua  
Based on the idea which proposed by Cash, we propose dynamic proofs of retrievability via Partitioning-Based Square Root Oblivious RAM (DPoR-PSR-ORAM).  ...  Cash et al. use Oblivious RAM (ORAM) to construct a fully dynamic POR scheme, but the cost of their scheme is also very heavy.  ...  [Xu, Zhou, Jiang et al. (2016) ] uses Square-Root Oblivious RAM (SR-ORAM) to construct a dynamic proofs of retrievability (DPOR-SRORAM). But the scheme is not efficient.  ... 
doi:10.32604/cmc.2018.03820 fatcat:2bydyg6vyffubpi43ruve5jrte

Data-Oblivious Data Structures

John C. Mitchell, Joe Zimmerman, Marc Herbstritt
2014 Symposium on Theoretical Aspects of Computer Science  
We also establish a new upper bound for oblivious data compaction, and use this result to show that an "offline" variant of the Oblivious RAM problem can be solved with O(log n log log n) expected amortized  ...  In this paper, we formalize three definitions of data-obliviousness that have appeared implicitly in the literature, explore their implications, and show separations.  ...  Proof. Follows from Theorem 15. Offline Oblivious RAM We now show that the data compaction problem is closely related to the question of data-oblivious arrays (i.e., Oblivious RAM).  ... 
doi:10.4230/lipics.stacs.2014.554 dblp:conf/stacs/MitchellZ14 fatcat:fvpe7ouwl5bkvejpxcik753ys4

Distributed Oblivious RAM for Secure Two-Party Computation [chapter]

Steve Lu, Rafail Ostrovsky
2013 Lecture Notes in Computer Science  
As alluded above, our two-server Oblivious RAM protocol leads to a novel application in the realm of secure two-party RAM program computation.  ...  At the heart of almost all previous single-server Oblivious RAM solutions, a crucial but inefficient process known as oblivious sorting was required.  ...  To simulate the instruction execution via (Σ , op) ← Π(Σ, x), again we generate uniform random shares for the intermediate state as well as the values retrieved.  ... 
doi:10.1007/978-3-642-36594-2_22 fatcat:xvo5757svfboplireewndmv3ce

Software protection and simulation on oblivious RAMs

Oded Goldreich, Rafail Ostrovsky
1996 Journal of the ACM  
We reduce the problem of software protection to the problem of e cient simulation on oblivious RAM.  ...  In particular, we show h o w to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a poly-logarithmic slowdown in the running time.  ...  Obliviousness of Access Pattern Let us start with an overview of our proof.  ... 
doi:10.1145/233551.233553 fatcat:sdsxvhltenfb5alianxv4c46wu

Oblivious RAM Simulation with Efficient Worst-Case Access Overhead [article]

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011 arXiv   pre-print
In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.  ...  Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments.  ...  Proof.  ... 
arXiv:1107.5093v1 fatcat:xqsxi5z7lbfqjhg7drpzn6x67a

Dynamic Accumulator Based Discretionary Access Control for Outsourced Storage with Unlinkable Access [chapter]

Daniel Slamanig
2012 Lecture Notes in Computer Science  
In contrast to recent approaches based on oblivious RAM, oblivious transfer combined with anonymous credentials or attribute based encryption, we propose a solution based on dynamic accumulators.  ...  In doing so, our approach naturally reflects the concept of access control lists (ACLs), which are a popular means to implement DAC.  ...  Oblivious RAM. In [9] , Franz et al. present an oblivious RAM (ORAM) based approach, which enables an owner of a database to outsource the database to an untrusted storage service.  ... 
doi:10.1007/978-3-642-32946-3_16 fatcat:tmohizxhzvh4xmihabfl2ahjym

Lower Bounds for Oblivious Near-Neighbor Search [article]

Kasper Green Larsen and Tal Malkin and Omri Weinstein and Kevin Yeo
2019 arXiv   pre-print
We prove an Ω(d n/ ( n)^2) lower bound on the dynamic cell-probe complexity of statistically oblivious approximate-near-neighbor search (ANN) over the d-dimensional Hamming cube.  ...  We also show that any oblivious static data structure for decomposable search problems (like ANN) can be obliviously dynamized with O( n) overhead in update and query time, strengthening a classic result  ...  Proof. We assume that the oblivious dynamic data structure is initially empty and assume that the number of operations, n, is a power of two for convenience.  ... 
arXiv:1904.04828v1 fatcat:r3hafauyw5cuhfdvsejv3narsm

How to Garble RAM Programs? [chapter]

Steve Lu, Rafail Ostrovsky
2013 Lecture Notes in Computer Science  
Assuming solely the existence of one-way functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running  ...  We stress that we avoid converting the RAM programs into circuits.  ...  Proof. Correctness. This construction is correct due to the correctness of the underlying single-round Oblivious RAM scheme in Theorem 2 and the correctness of garbled circuits.  ... 
doi:10.1007/978-3-642-38348-9_42 fatcat:ykszm343lngqjmyffbjnue5oym

Resizable Tree-Based Oblivious RAM [chapter]

Tarik Moataz, Travis Mayberry, Erik-Oliver Blass, Agnes Hui Chan
2015 Lecture Notes in Computer Science  
Yet, a flexible storage is vital for real-world use of Oblivious RAM since one of its most promising deployment scenarios is for cloud storage, where scalability and elasticity are crucial.  ...  Although newly proposed, tree-based Oblivious RAM schemes are drastically more efficient than older techniques, they come with a significant drawback: an inherent dependence on a fixed-size database.  ...  Conclusion We are the first to show how to dynamically resize constant-client memory tree-based Oblivious RAM.  ... 
doi:10.1007/978-3-662-47854-7_9 fatcat:7shj7tmunnf4fgaln62f4wocnq

Oblivious Parallel RAM: Improved Efficiency and Generic Constructions [chapter]

Binyi Chen, Huijia Lin, Stefano Tessaro
2015 Lecture Notes in Computer Science  
This paper considers the natural setting of Oblivious Parallel RAM (OPRAM) recently introduced by Boyle, Chung, and Pass (TCC 2016A), where m clients simultaneously access in parallel the storage server  ...  The clients are additionally connected via point-to-point links to coordinate their accesses. However, this additional inter-client communication must also remain oblivious.  ...  We now analyze the complexity of the Generic-OPRAM.  ... 
doi:10.1007/978-3-662-49099-0_8 fatcat:5xasyzvp5rhdnjwnaqgagrlj6i

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption [chapter]

Sanjam Garg, Payman Mohassel, Charalampos Papamanthou
2016 Lecture Notes in Computer Science  
We present TWORAM, an asymptotically efficient oblivious RAM (ORAM) protocol providing oblivious access (read and write) of a memory index y in exactly two rounds: The client prepares an encrypted query  ...  The cost of TWORAM is only a multiplicative factor of security parameter higher than the tree-based ORAM schemes such as the path ORAM scheme of Stefanov et al. (CCS, 2013).  ...  Oblivious RAM We recall Oblivious RAM (ORAM), a notion introduced and first studied by Goldreich and Ostrovsky [16, 30] .  ... 
doi:10.1007/978-3-662-53015-3_20 fatcat:ucmsknobfnaordque3liiq45d4

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs [chapter]

Elette Boyle, Kai-Min Chung, Rafael Pass
2015 Lecture Notes in Computer Science  
to polylogarithmic factors the computation, parallel time, and memory complexities of the PRAM program, aside from a one-time execution of a broadcast protocol per party.  ...  More specifically, we demonstrate load-balanced, statistically secure computation protocols for computing Parallel RAM (PRAM) programs, handling (1/3 − ) fraction malicious players, while preserving up  ...  Proof of Main Theorem At a very high level, the proof takes three steps: We first obtain MPC realizing F PRAMs with a weaker notion of oblivious security.  ... 
doi:10.1007/978-3-662-48000-7_36 fatcat:bzvrj2j435ahffuaptnyfew32q
« Previous Showing results 1 — 15 out of 713 results