Perfectly secure oblivious RAM without random oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6597 LNCS, Issue , 2011, Pages 144-163

  Damgård, Ivan ^a   Meldgaard, Sigurd ^a   Nielsen, Jesper Buus ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

ACCESS PATTERNS; LOWER BOUNDS; RANDOM ORACLE; WITHOUT RANDOM ORACLES;

INFORMATION THEORY;

EID: 79953223285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19571-6_10     Document Type: Conference Paper

References (6)

1. Ajtai, M., Komlós, J., Szemerédi, E.: An 0(n log n) sorting network. In: STOC 1983: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 1-9. ACM, New York (1983)
2. Ajtai, M.: Oblivious rams without cryptographic assumptions. In: STOC 2010: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (2010) (to be published at STOC)
3. Batcher, K.E.: Sorting networks and their applications. In: AFIPS 1968 (Spring): Proceedings of the Spring Joint Computer Conference, April 30-May 2, pp. 307-314. ACM, New York (1968)
4. Beame, P., Machmouchi, W.: Making RAMs Oblivious Requires Superlogarithmic Overhead. Electronic Colloquium on Computational Complexity (ECCC) 10(104) (2010)
5. Goldreich, O.: Towards a theory of software protection and simulation by oblivious rams. In: STOC 1987: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 182-194. ACM, New York (1987)
6. Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431-473 (1996)