The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Software watermarking: models and dynamic embeddings
Abstract
Watermarking embeds a secret message into a cover message. In media watermarking the secret is usually a copyright notice and the cover a digital image. Watermarking an object discourages intellectual property theft, or when such theft has occurred, allows us to prove ownership.The Software Watermarking problem can be described as follows. Embed a structure W into a program P such that: W can be reliably located and extracted from P even after P has been subjected to code transformations such as translation, optimization and obfuscation; W is stealthy; W has a high data rate; embedding W into P does not adversely affect the performance of P; and W has a mathematical property that allows us to argue that its presence in P is the result of deliberate actions.In the first part of the paper we construct an informal taxonomy of software watermarking techniques. In the second part we formalize these results. Finally, we propose a new software watermarking technique in which a dynamic graphic watermark is stored in the execution state of a program.
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
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Bender, W., Gruhl, D., Morimoto, N., & Lu, A. (1996) · IBM Systems Journal · doi:10.1147/sj.353.0313 · Cited by 2,774
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Exploring steganography: Seeing the unseen
Johnson, N. F., & Jajodia, S. (1998) · Computer · doi:10.1109/mc.1998.4655281 · Cited by 1,485
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
On the limits of steganography
Anderson, R. J., & Petitcolas, F. A. P. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668971 · Cited by 1,170
A Taxonomy of Obfuscating Transformations
Collberg, C. S., Thomborson, C. D., & Low, D. (1997) · ResearchSpace (University of Auckland) · Cited by 1,090
Self-citationPemantle, R., Wilson, M. C., & Melczer, S. (2024) · Cambridge University Press eBooks · doi:10.1017/9781108874144.003 · Cited by 939
Attacks on Copyright Marking Systems
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_16 · Cited by 835
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-10826-4 · Cited by 834
Compiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 818
Generating Hard Instances of Lattice ProblemsPreprint
Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606
Manufacturing cheap, resilient, and stealthy opaque constructs
Collberg, C., Thomborson, C., & Low, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268962 · Cited by 535
Self-citationGoulden, I. P., & Jackson, D. M. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 43
Krakatoa: decompilation in java (dose bytecode reveal source?)
Proebsting, T. A., & Watterson, S. A. (1997) · USENIX Conference on Object-Oriented Technologies and Systems · Cited by 36
Cited by
Limits of Static Analysis for Malware Detection
Moser, A., Kruegel, C., & Kirda, E. (2007) · Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007) · doi:10.1109/acsac.2007.21 · Cited by 813
Watermarking, tamper-proofing, and obfuscation - tools for software protection
Collberg, C. S., & Thomborson, C. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1027797 · Cited by 735
Self-citationObfuscation of executable code to improve resistance to static disassembly
Linn, C., & Debray, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948149 · Cited by 602
Software engineering for security: a roadmap
Devanbu, P. T., & Stubblebine, S. (2000) · Proceedings of the Conference on The Future of Software Engineering · doi:10.1145/336512.336559 · Cited by 418
Behavior based software theft detection
Wang, X., Jhi, Y.-C., Zhu, S., & Liu, P. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653696 · Cited by 101
Metadata
- Authors
- Collberg, C., & Thomborson, C.
- Venue
- Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 1999-01
- Pages
- 311-324
- OpenAlex
- W2086968222
- Cited by
- 342
- References
- 15
- FWCI
- 8.20
- Type
- conference paper
- Language
- en
- Open access
- closed
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.