SOFTWARE WATERMARKING

• US 20100095376A1
• Filed: 03/05/2009
• Published: 04/15/2010
• Est. Priority Date: 03/07/2008
• Status: Abandoned Application

• Current Assignee: Digimarc Corporation
• Original Assignee: Digimarc Corporation
• Inventors: MacIntosh, Brian T., Rodriguez, Tony F., Gustafson, Ammon E.
• Application Number:
  US12/398,948
• Publication Number:
  US 20100095376A1
• Time in Patent Office: Days
• US Class Current: 726/22
• CPC Class Codes: G06F 21/16 Program or content traceability, e.g. by watermarking

Abstract

Various techniques for uniquely marking software, such as by reference to hidden information or other telltale features, are detailed. Some marks are evident in static code. Others are observable when the code is executed. Some do not manifest themselves until the code is exercised with specific stimulus. Different of the techniques are applicable to source code, object code, and firmware. A great number of other features and arrangements are also disclosed.

Claims

1. A method of executing program code on a hardware system, the method including the acts:

monitoring program execution using tracking software that assesses a behavior associated with program execution, and then consulting reference data to determine whether said monitored behavior corresponds to a dynamic software watermark.

2. A method of executing software on a hardware system, the method including the acts:

collecting thermal information from said system, and checking said collected information for correspondence with a thermal profile associated with particular software.

3. A method for uniquely identifying an instance of program code, by reference to an order of plural items therein, the items being sortable into a first order ranging from an initial item at a starting end of the order, to a last item at a final end of the order, the method comprising the acts:

(a) receiving a plural-bit payload, comprising ones and zeroes;

(b) identifying an item from an intermediate position in the first order, and assigning it to an end position in a new order; and

(c) arranging other of said items in subsequent positions of the new order so that the new order encodes the plural-bit payload.

4. The method of claim 3 wherein the items comprise data items in a PE (portable executable) file format.

5. The method of claim 3 wherein the items comprise registers referenced in the program code.

6. The method of claim 3 wherein the items comprise data in a string table.

7. The method of claim 3 wherein the items comprise data in an INIT cable.

8. The method of claim 3 wherein the first order is alphabetical.

9. The method of claim 3 wherein the arranging is performed by a processor executing a script.

10. The method of claim 3 in which (c) comprises successively choosing different ones of the items from the first order in accordance with values of successive bits of the plural bit payload to yield the items in the new order.

11. The method of claim 10 that includes:

selecting, as a next item for the new order, an item from a position towards the starting end of the first order from said intermediate position, if a bit of the plural-bit payload has a value of one;

else selecting an item towards the final end of the first order from said intermediate position; and

repeating the aforesaid act for subsequent items in accordance with subsequent values of bits in the plural-bit payload.

12. The method of claim 3 that includes analyzing the new order of items to discern the plural-bit payload encoded thereby.