NDLI: Software protection and simulation on oblivious RAMs

Content Provider	ACM Digital Library
Author	Goldreich, Oded Ostrovsky, Rafail
Copyright Year	1996
Abstract	Software protection is one of the most important issues concerning computer practice. There exist many heuristics and ad-hoc methods for protection, but the problem as a whole has not received the theoretical treatment it deserves. In this paper, we provide theoretical treatment of software protection. We reduce the problem of software protection to the problem of efficient simulation on $\textit{oblivious}$ RAM.A machine is $\textit{oblivious}$ if thhe sequence in which it accesses memory locations is equivalent for any two inputs with the same running time. For example, an oblivious Turing Machine is one for which the movement of the heads on the tapes is identical for each computation. (Thus, the movement is independent of the actual input.) What is the slowdown in the running time of a machine, if it is required to be oblivious? In 1979, Pippenger and Fischer showed how a two-tape $\textit{oblivious}$ Turing Machine can simulate, on-line, a one-tape Turing Machine, with a logarithmic slowdown in the running time. We show an analogous result for the random-access machine (RAM) model of computation. In particular, we show how to do an on-line simulation of an arbitrary RAM by a probabilistic $\textit{oblivious}$ RAM with a polylogaithmic slowdown in the running time. On the other hand, we show that a logarithmic slowdown is a lower bound.
Starting Page	431
Ending Page	473
Page Count	43
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/233551.233553
Journal	Journal of the ACM (JACM)
Volume Number	43
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1996-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Pseudorandom functions Simulation of random access machines Software protection
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the complexity of functions for random access machines

Time Bounded Random Access Machines with Parallel Processing

Lower bounds for solving linear diophantine equations on random access machines

Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions

Random-Access Stored-Program Machines, an Approach to Programming Languages

On the (im)possibility of obfuscating programs

On the discrepancy of GFSR pseudorandom numbers

A nonlinear lower bound for random-access machines under logarithmic cost

How to construct random functions

Software protection and simulation on oblivious RAMs

Similar Documents

On the complexity of functions for random access machines

Time Bounded Random Access Machines with Parallel Processing

Lower bounds for solving linear diophantine equations on random access machines

Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions

Random-Access Stored-Program Machines, an Approach to Programming Languages

On the (im)possibility of obfuscating programs

On the discrepancy of GFSR pseudorandom numbers

A nonlinear lower bound for random-access machines under logarithmic cost

How to construct random functions

Software protection and simulation on oblivious RAMs