Perfectly Secure Oblivious RAM without Random Oracles
- 1 January 2011
- book chapter
- Published by Springer Nature
- Vol. 2010, 144-163
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Making Branching Programs Oblivious Requires Superlogarithmic Overhead2011
- Oblivious RAMs without cryptogrpahic assumptions2010
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996
- Towards a theory of software protection and simulation by oblivious RAMs1987
- An 0(n log n) sorting network1983
- Sorting networks and their applications1968