Oblivious RAMs without cryptogrpahic assumptions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 181-190

  Ajtai, Miklós ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

oblivious; RAM

Indexed keywords

CRYPTOGRAPHIC ASSUMPTIONS; FUNCTION OF TIME; MEMORY ACCESS; MEMORY ACCESS PATTERNS; MEMORY CELL; MEMORY LOCATIONS; ONE-WAY FUNCTIONS; ONLINE SIMULATION; POLYLOGARITHMIC; PROBABILITY OF FAILURE; RANDOM BITS; RANDOM ORACLE; SIMULATION THEOREM; SPACE AND TIME; TIME AND SPACE; TWO-DIMENSIONAL TAPE;

CRYPTOGRAPHY; MACHINERY; SEMICONDUCTOR STORAGE; THEOREM PROVING; TURING MACHINES;

RADAR ABSORBING MATERIALS;

EID: 77954755618     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806716     Document Type: Conference Paper

References (7)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, Massachusetts, 1974.
2. O. Goldreich. Towards a theory of software protection and simulation by oblivious rams. In STOC, Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA, pages 182-194. ACM, 1987.
3. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43(3):431-473, 1996.
4. R. Ostrovsky. Efficient computation on oblivious rams. In STOC, Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 14-16 May 1990, Baltimore, Maryland, USA, pages 514-523. ACM, 1990.
5. R. Ostrovsky. Software Protection and Simulation on Oblivious RAM's. PhD thesis, MIT, 1992.
6. D. A. Osvik, A. Shamir, and E. Tromer. Cache attacks and countermeasures: The case of aes. In D. Pointcheval, editor, CT-RSA, volume 3860 of Lecture Notes in Computer Science, pages 1-20. Springer, 2006.
7. N. Pippenger and M. J. Fischer. Relations among complexity measures. J. ACM, 26(2):361-381, 1979.