The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Architectural support for copy and tamper resistant software
Open accessAbstract
Although there have been attempts to develop code transformations that yield tamper-resistant software, no reliable software-only methods are know. This paper studies the hardware implementation of a form of execute-only memory (XOM) that allows instructions stored in memory to be executed but not otherwise manipulated. To support XOM code we use a machine that supports internal compartments---a process in one compartment cannot read data from another compartment. All data that leaves the machine is encrypted, since we assume external memory is not secure. The design of this machine poses some interesting trade-offs between security, efficiency, and flexibility. We explore some of the potential security issues as one pushes the machine to become more efficient and flexible. Although security carries a performance penalty, our analysis indicates that it is possible to create a normal multi-tasking machine where nearly all applications can be run in XOM mode. While a virtual XOM machine is possible, the underlying hardware needs to support a unique private key, private memory, and traps on cache misses. For efficient operation, hardware assist to provide fast symmetric ciphers is also required.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
The protection of information in computer systems
Saltzer, J. H., & Schroeder, M. D. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9939 · Cited by 2,126
HMAC: Keyed-Hashing for Message Authentication
Krawczyk, H., Bellare, M., & Canetti, R. (1997) · doi:10.17487/rfc2104 · Cited by 2,031
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Protection of information in computer systems
Saltier, J. H., & Schroeder, M. P. (1975) · IEEE CSIT Newsletter · doi:10.1109/csit.1975.6498831 · Cited by 1,419
On the (Im)possibility of Obfuscating Programs
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., & Yang, K. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_1 · Cited by 1,286
A calculus for cryptographic protocols: the spi calculus
Abadi, M., & Gordon, A. D. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266432 · Cited by 1,154
Towards Sound Approaches to Counteract Power-Analysis Attacks
Chari, S. T., Jutla, C. S., Rao, J. R., & Rohatgi, P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_26 · Cited by 1,126
A Taxonomy of Obfuscating Transformations
Collberg, C. S., Thomborson, C. D., & Low, D. (1997) · ResearchSpace (University of Auckland) · Cited by 1,090
(2007) · Brute Force · doi:10.1007/0-387-27160-0_3 · Cited by 934
Survey of virtual machine research
Goldberg, R. P. (1974) · Computer · doi:10.1109/mc.1974.6323581 · Cited by 810
Authentication in distributed systems: theory and practice
Lampson, B., Abadi, M., Burrows, M., & Wobber, E. (1992) · ACM Transactions on Computer Systems · doi:10.1145/138873.138874 · Cited by 607
Low cost attacks on tamper resistant devices
Anderson, R., & Kuhn, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028165 · Cited by 582
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
Certificate revocation and certificate update
Naor, M., & Nissim, K. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839932 · Cited by 493
Automated analysis of cryptographic protocols using Murφ
Mitchell, J. C., Mitchell, M., & Stern, U. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601329 · Cited by 476
Self-citationDisco: running commodity operating systems on scalable multiprocessors
Bugnion, E., Devine, S., Govil, K., & Rosenblum, M. (1997) · ACM Transactions on Computer Systems · doi:10.1145/265924.265930 · Cited by 446
Serpent: A Proposal for the Advanced Encryption Standard
Anderson, R., Biham, E., & Knudsen, L. R. (1998) · Cited by 395
Building a high-performance, programmable secure coprocessor
Smith, S. W., & Weingart, S. (1999) · Computer Networks · doi:10.1016/s1389-1286(98)00019-x · Cited by 336
Embra: fast and flexible machine simulation
Witchel, E., & Rosenblum, M. (1996) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/233008.233025 · Cited by 266
Yee, B. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48749-2_12 · Cited by 243
A probabilistic poly-time framework for protocol analysis
Lincoln, P., Mitchell, J., Mitchell, M., & Scedrov, A. (1998) · Proceedings of the 5th ACM conference on Computer and communications security · doi:10.1145/288090.288117 · Cited by 209
Self-citationImplementation of an authenticated dictionary with skip lists and commutative hashing
Goodrich, M. T., Tamassia, R., & Schwerin, A. (2002) · Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01 · doi:10.1109/discex.2001.932160 · Cited by 178
Comments to NIST concerning AES Modes of Operations: CTR-Mode Encryption
Lipmaa, H., Rogaway, P., & Wagner, D. A. (2000) · Cited by 142
Dyad : a system for using physically secure coprocessors
Tygar, J. D., & Yee, B. (2018) · doi:10.1184/r1/6604994 · Cited by 123
Architectural support for fast symmetric-key cryptography
Burke, J., McDonald, J., & Austin, T. M. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357006 · Cited by 110
Architectural support for fast symmetric-key cryptography
Burke, J., McDonald, J., & Austin, T. M. (2000) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/378993.379238 · Cited by 76
How to Manage Persistent State in DRM Systems
Shapiro, W., & Vingralek, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47870-1_11 · Cited by 22
An architecture of Security Management Unit for Safe Hosting of Multiple Agents
Legat, J.-D., Quisquater, J.-J., & Gilmont, T. (1998) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · Cited by 22
Cited by
(2016) · IACR Cryptology ePrint Archive · Cited by 1,288
Innovative instructions and software model for isolated execution
McKeen, F., Alexandrovich, I., Berenzon, A., Rozas, C. V., Shafi, H., Shanbhogue, V., & Savagaonkar, U. R. (2013) · Proceedings of the 2nd International Workshop on Hardware and Architectural Support for Security and Privacy · doi:10.1145/2487726.2488368 · Cited by 1,095
Lest we remember: cold-boot attacks on encryption keys
Halderman, J. A., Schoen, S. D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J. A., Feldman, A. J., Appelbaum, J., & Felten, E. W. (2009) · Communications of the ACM · doi:10.1145/1506409.1506429 · Cited by 980
Terra: a virtual machine-based platform for trusted computing
Garfinkel, T., Pfaff, B., Chow, J., Rosenblum, M., & Boneh, D. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945464 · Cited by 887
Self-citationPinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
Metadata
- Authors
- Thekkath, D. L. C., Mitchell, M., Lincoln, P., Boneh, D., Mitchell, J., & Horowitz, M.
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 2000-11-12
- Volume
- 28
- Issue
- 5
- Pages
- 168-177
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W2108255910
- Cited by
- 597
- References
- 33
- FWCI
- 10.41
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.