Self-adjusting binary search trees
Journal of the ACM (JACM)
A locally adaptive data compression scheme
Communications of the ACM
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Randomized splay trees: theoretical and experimental results
Information Processing Letters
Hardware assisted control flow obfuscation for embedded processors
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
On the effectiveness of address-space randomization
Proceedings of the 11th ACM conference on Computer and communications security
Proteus: virtualization for diversified tamper-resistance
Proceedings of the ACM workshop on Digital rights management
Tamper-Tolerant Software: Modeling and Implementation
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
| Hi-index | 0.00 |
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one transforms a given program into a one that has totally random looking execution, based on some cryptographic assumptions and the existence of secure hardware. Totally random memory access patterns do not respect the locality of reference in programs to which the programs generally owe their efficiency. We propose a model that limits the obliviousness so as to enable efficient execution of the program; here the adversary marks a variable and tries to produce a list of candidate locations where it may be stored in after $T$-steps ofexecution. We propose a randomized algorithm based on splay trees,and prove a lower bound on such lists.