On software protection via function hiding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1525, Issue , 1998, Pages 111-123

  Sander, Tomas ^a   Tschudin, Christian F ^a,b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957893114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49380-8_9     Document Type: Conference Paper

References (12)

1. M. Abadi and J. Feigenbaum. Secure circuit evaluation. Journal of Cryptology, 2(1): 1-12, 1990.
2. David Aucsmith. Tamper resistant software: An implementation. In Ross Anderson, editor, Information Hiding-Proceedings of the First International Workshop, May/June 1996, number 1174 in LNCS, pages 317-333, 1996.
3. J. Benaloh. Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography, pages 120-128, 1994.
4. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory. Number 315 in Grundlehren der mathematischen Wissenschaften. Springer, 1997.
5. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. revised October 1995, ftp: //theory. lcs. mit. edu/pub/people/oded/soft. ps.
6. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2): 270-299, April 1984.
7. Richard Lipton and Tomas Sander. An additively homomorphic encryption scheme or how to introduce a partial trapdoor in the discrete log. In preparation.
8. S. Micali, C. Rackoff, and B. Sloan. The notion of security for probabilistic cryptosystems. SIAM Journal on Computing, 17(2): 412-426, 1988.
9. Ronald L. Rivest, Len Adleman, and Michael L. Dertouzos. On data banks and privacy homomorphisms. In R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, editors, Foundations of Secure Computation, pages 169-179. Academic Press, 1978.
10. T. Sander and C. Tschudin. Towards mobile cryptography. In IEEE Symposium on Security & Privacy'98, Oakland, California, May 1998.
11. Ingo Wegener. The Complexity of Boolean, Functions. Eiley-Teubner, 1987.
12. R. E. Zippel. Interpolating polynomials from their values. Journal of Symbolic Computation, 9: 375-403, March 1990.