Comprehensive software protection system

Details Comprehensive software protection system Comprehensive software protection system

1990-02-07

1992-06-16

Swann, Tod

Cryptography

Cryptanalysis

380 46, 364969, H04L 900

Patent

active

051230453

ABSTRACT:
An efficient software protection scheme is presented in which a data processing system provides comprehensive software protection using hardware and software measures. Specifically, it provides protection of the pattern of access to memory during execution of a program and also provides protection of the data stored in memory. The protection scheme is secure in the sense that it behaves like a black box which reveals no information other than the I/O behavior and running time. Thus, not only the values stored in the general purpose memory are hidden, but also the sequence in which memory location are accessed during execution is hidden. This comprehensive scope of protection is achieved by an extremely efficient scheme. In particular, if the running time of the original program it T, the running time of the protected program is only slower by some factor of (logT).sup.C where C is a small constant.

REFERENCES:
patent: 3555513 (1971-01-01), Hauck et al.
patent: 3568155 (1971-03-01), Abraham et al.
patent: 4168396 (1979-09-01), Best
patent: 4306289 (1981-12-01), Lumley
patent: 4465901 (1984-08-01), Best
patent: 4506364 (1985-03-01), Aichelmann, Jr. et al.
O. Goldreich, "Towards a Theory of Software Protection and Simulation by Oblivious RAMs," Proc. ACM Symposium on Theory of Computing, 1987.
M. Blum and S. Goldwasser, "An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information," Proc. of CRYPTO-84, 1984, 289-299.
S. Goldwasser and S. Micali, "Probabilistic Encryption," Journal of Computer and System Sciences, 28(2), Apr. 1984.
K. E. Batcher, "Sorting Networks and Their Applications," Proc. of AFIPS Spring Conf., vol. 32, 1968.
C. P. Schnorr, "The Network Complexity and the Turning Machine Complexity of Finite Functions," Acta Informatica, 7 (1976), 95-107.
M. Ajtai, J. Komlos and E. Szemeredi, "An O(n log n) Sorting Network," Proc. ACM Symposium on Theory of Computing, 1983.
N. Pippenger and M. J. Fischer, "Relations Among Complexity Measures," Journal of the Assoc. for Computing Machinery, 26(2) Apr. 1979, 361-381.
O. Goldreich, S. Goldwasser and S. Micali, "On the Cryptographic Applications of Random Functions," Proc. of CRYPTO-84, 1984, 277-289.
M. Luby and C. Rackoff, "How to Construct Pseudorandom Permutations from Pseudorandom Functions," SIAM J. Comp., 17(2), Apr. 1988, 373-386.
O. Goldreich, S. Goldwasser and S. Micali, "How to Construct Random Functions," Journal of the Association for Computing Machinery, 33(4), Oct. 1986, , 792-807.
A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974, 5-7.
R. Ostrovsky, "Efficient Computation on Oblivious RAMs", Proc. ACM Symposium on Theory of Computing 1990, pp. 514-523.

Affiliated with

Also associated with

Rating

Comprehensive software protection system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Comprehensive software protection system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comprehensive software protection system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1759482