David Goldschlag, Michael Reed, and Paul Syverson. Hiding routing information. Lecture Notes in Computer Science: Information Hiding,1174:137--150, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Playing Hide and Seek With Stored Keys - Adi Shamir And (1998) (6 citations) (Correct)
....section of code which uses that key. The other class of solutions for hiding the key is to make the entropy of the rest of the data appear higher. One way to do this is to encrypt the program so that it decrypts itself before it runs. Work has been carried out in this field by Intel Corporation[1] and others and it can lead to systems which are very hard to subvert but it does so at a cost. There will always be a computation overhead involved in decrypting the code and data before it is used and this will slow the system down. 5 Conclusions The problem of efficient identification of ....
David Aucsmith. Tamper resistant software. Lecture Notes in Computer Science: Information Hiding, 1174:317-333, 1996.
The Need for Cryptographic Accelerators in Electronic Commerce - van Someren (1997) Self-citation (Information) (Correct)
No context found.
David Goldschlag, Michael Reed, and Paul Syverson. Hiding routing information. Lecture Notes in Computer Science: Information Hiding,1174:137--150, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC