CryptoDB
Perfectly Secure Oblivious RAM Without Random Oracles
Authors: | |
---|---|
Download: | |
Abstract: | We present an algorithm for implementing a secure oblivious RAM where the access pattern is perfectly hidden in the information theoretic sense, without assuming that the CPU has access to a random oracle. In addition we prove a lover bound on the amount of randomness needed for information theoretically secure oblivious RAM. |
BibTeX
@misc{eprint-2010-23009, title={Perfectly Secure Oblivious RAM Without Random Oracles}, booktitle={IACR Eprint archive}, keywords={protocols, oblivious RAM}, url={http://eprint.iacr.org/2010/108}, note={ ivan@cs.au.dk, stm@cs.au.dk, jbn@cs.au.dk 14670 received 27 Feb 2010, last revised 1 Mar 2010}, author={Ivan Damgård and Sigurd Meldgaard and Jesper Buus Nielsen}, year=2010 }