METHOD FOR PROVIDING INFORMATION TO DETERMINE A GRAPH ASSOCIATED WITH A DATA ITEM

• US 20160188748A1
• Filed: 12/28/2015
• Published: 06/30/2016
• Est. Priority Date: 12/31/2014
• Status: Abandoned Application

• Current Assignee: Thomson Licensing (Vantiva SA)
• Original Assignee: Thomson Licensing (Vantiva SA)
• Inventors: NEUMANN, Christoph, HEEN, Olivier, ONNO, Stephane, TAFT, Nina Anne
• Application Number:
  US14/980,668
• Publication Number:
  US 20160188748A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2255 Hash tables
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 21/16 Program or content traceability, e.g. by watermarking
• CPC Class Codes: G06F 21/55 Detecting local intrusion or implementing counter-measures

Abstract

In one embodiment, it is proposed a method for providing information to determine a graph associated with a data item, said graph being representative of a history of said data item in a network, and said graph comprising a set of vertices and a set of edges, each vertex being associated with an electronic device of said network, and each edge linked at least two vertices being representative of a dataflow between said at least two vertices. The method is executed by an electronic device and is remarkable in that it comprises:

• • verifying if an hash information derived from an obtained data item is comprised in a list of tracked data item comprising a list of hashes, each hash being a hash of a first information related to a data item;
  • in the case that said hash information derived from said obtained data item is comprised in said list of tracked data item, transmitting in said network said information to determine a graph comprising a hash of a second information related to said obtained data item, when said obtained data item is obtained by said electronic device, and/or transmitted to another electronic device in said network and/or a derived data item from said obtained data item is generated.

Claims

1. A method for providing information, based on an asynchronous communication pattern, to determine a graph associated with a data item, said graph being representative of a history of said data item in a network, and said graph comprising a set of vertices and a set of edges, each vertex being associated with an electronic device of said network, and each edge linked at least two vertices being representative of a dataflow between said at least two vertices, said method being executed by an electronic device and wherein it comprises:

verifying if an hash information derived from an obtained data item is comprised in a list of tracked data item comprising a list of hashes, each hash being a hash of a first information related to a data item;

in the case that said hash information derived from said obtained data item is comprised in said list of tracked data item, transmitting in said network said information to determine a graph comprising a hash of a second information related to said obtained data item, when said obtained data item is obtained by said electronic device, and/or transmitted to another electronic device in said network and/or a derived data item from said obtained data item is generated.

2. The method for providing information according to claim 1, wherein said list of tracked data item is comprised in at least one centralized server.

3. The method for providing information according to claim 1, wherein each electronic device comprises said list of tracked data item.

4. The method for providing information according to claim 1, wherein said transmitting further comprises a transmission of at least a first time information associated with said information to determine a graph.

5. The method for providing information according to claim 1, wherein said transmitting further comprises a transmission of identifying elements of said electronic device and/or said another electronic device in said network.

6. The method for providing information according to claim 1, wherein said first information related to a data item is a title of said data item.

7. The method for providing information according to claim 1, wherein said first information related to a data item is binary information.

8. The method for providing information according to claim 1, wherein in the case that said hash information derived from said obtained data item is not comprised in said list of tracked data item, it further comprises tracking said obtained data item by adding to said list of tracked data item a hash of a first information related to said obtained data item.

11. A computer-readable and non-transient storage medium storing a computer program comprising a set of computer-executable instructions, which when executed, configure the computer to perform the computer to perform a method according to any of claims 1 to 8, and/or to perform a method according to claim 9.

9. A method for determining a graph associated with a data item, said graph being representative of a history of said data item and said graph comprising a set of vertices and a set of edges, each vertex being associated with an electronic device, and each edge linked at least two vertices being representative of a dataflow between said at least two vertices, said method being executed by an electronic device and wherein it comprises, for a tracked data item that has been at least one time obtained by said electronic device:

obtaining a first graph from information comprising a hash of information related to said tracked data item received by an electronic device, and at least a first time information;

obtaining a second graph from information comprising a hash of information related to said tracked data item transmitted to another electronic device, and at least a second time information; and

merging into a merged graph said first and second graphs by taking into account said at least first and second time information for determining at least one edge of said merged graph.

10. The method for determining according to claim 9, wherein merging further comprises an inference test in order to link at least two vertices.

12. An electronic device for providing information, based on an asynchronous communication pattern, to determine a graph associated with a data item, said graph being representative of a history of said data item in a network, and said graph comprising a set of vertices and a set of edges, each vertex being associated with an electronic device of said network, and each edge linked at least two vertices being representative of a dataflow between said at least two vertices, said electronic device for providing information comprising:

a module configured to verify if an hash information derived from an obtained data item is comprised in a list of tracked data item comprising a list of hashes, each hash being a hash of a first information related to a data item;

a module configured to transmit in said network said information to determine a graph comprising a hash of a second information related to said obtained data item, when said obtained data item is obtained by said electronic device, and/or transmitted to another electronic device in said network and/or a derived data item from said obtained data item is generated, said module configured to transmit being activated in the case that said hash information derived from said obtained data item is comprised in said list of tracked data item.

13. The electronic device according to claim 12, wherein said module configured to transmit is also configured to transmit at least a first time information associated with said information to determine a graph.

14. The electronic device according to claim 12, wherein said module configured to transmit is also configured to transmit identifying elements of said electronic device and/or said another electronic device in said network.

15. An electronic device for determining a graph associated with a data item, said graph being representative of a history of said data item and said graph comprising a set of vertices and a set of edges, each vertex being associated with an electronic device, and each edge linked at least two vertices being representative of a dataflow between said at least two vertices, said electronic device for determining a graph comprising, for a tracked data item that has been at least one time obtained by said electronic device:

a module configured to obtain a first graph from information comprising a hash of information related to said tracked data item received by an electronic device, and at least a first time information;

a module configured to obtain a second graph from information comprising a hash of information related to said tracked data item transmitted to another electronic device, and at least a second time information; and

a module configured to merge into a merged graph said first and second graphs by taking into account said at least first and second time information for determining at least one edge of said merged graph.