Towards a theory of software protection

作者: Oded Goldreich

DOI:

关键词:

摘要: Software protection is one of the most important issues concerning computer practice. The problem to sell programs that can be executed by buyer, yet cannot duplicated and/or distributed him other users. There exist many heuristics and ad-hoc methods for protection, but as a whole did not receive theoretical treatment it deserves.In this paper, we make first steps towards theoretic software protection: First, distill formulate key learning about program from its execution. Second, present an efficient way executing (i.e. interpreter) such infeasible learn anything monitoring executions. A scheme protects against duplication follows.How efficiently execute without allowing adversary, execution, ? Current cryptographic techniques applied keep contents memory unknow throughout are applicable hiding access pattern. Hiding pattern essence our solution. We show how implement (on-line in "oblivious manner") t fetch instructions size m making less than t?m? actual accesses, every fixed ?>0.

参考文章(12)
Manuel Blum, Shafi Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information international cryptology conference. pp. 289- 302 ,(1985) , 10.1007/3-540-39568-7_23
S. Kent, PROTECTING EXTERNALLY SUPPLIED SOFTWARE IN SMALL COMPUTERS Massachusetts Institute of Technology. ,(1981)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
O. Goldreich, S. Goldwasser, S. Micali, How To Construct Randolli Functions 25th Annual Symposium onFoundations of Computer Science, 1984.. pp. 464- 479 ,(1984) , 10.1109/SFCS.1984.715949
M Luby, C Rackoff, Pseudo-random permutation generators and cryptographic composition symposium on the theory of computing. pp. 356- 363 ,(1986) , 10.1145/12130.12167
Nicholas Pippenger, Michael J. Fischer, Relations Among Complexity Measures Journal of the ACM. ,vol. 26, pp. 361- 381 ,(1979) , 10.1145/322123.322138
Andrew C Yao, None, Theory and application of trapdoor functions foundations of computer science. pp. 80- 91 ,(1982) , 10.1109/SFCS.1982.95
M. Ajtai, J. Komlós, E. Szemerédi, An 0(n log n) sorting network symposium on the theory of computing. pp. 1- 9 ,(1983) , 10.1145/800061.808726
Werner Alexi, Benny Chor, Oded Goldreich, Claus P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole SIAM Journal on Computing. ,vol. 17, pp. 194- 209 ,(1988) , 10.1137/0217013
Oded Goldreich, Shafi Goldwasser, Silvio Micali, How to construct random functions Journal of the ACM. ,vol. 33, pp. 792- 807 ,(1986) , 10.1145/6490.6503