# US 2013/0212374 A1 · Method for identifying a device used by a hacked terminal, and related device

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0212374 A1
- Document ID: US20130212374A1
- Status: Published application
- Kind: A1
- Application number: 13/636,496
- Filed: 2011-03-21
- Published: 2013-08-15
- Earliest claimed: 2010-03-23
- Assignees: Cryptoexperts SAS
- Inventors: Cécile Delerablee; Aline Gouget; Pascal Paillier
- Web page: https://patentgrep.com/patent/US20130212374A1

## CPC

- H04L 9/08: Key distribution {or management, e.g. generation, sharing or updating, of cryptographic keys or passwords (network architectures or network communication protocols for supporting key management in a packet data network H04L63/06)}
- H04L 9/083: {involving central third party, e.g. key distribution center [KDC] or trusted third party [TTP]}
- H04N 21/2585: {Generation of a revocation list, e.g. of client devices involved in piracy acts}
- G06F 16/40: of multimedia data, e.g. slideshows comprising image and additional audio data (retrieval of still image data G06F16/50; retrieval of audio data G06F16/60; retrieval of video data G06F16/70)
- H04L 2209/603: Digital right managament [DRM]
- H04L 2209/606: Traitor tracing
- H04N 21/4181: {for conditional access}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The invention relates to a method for preventing the fraudulent use of an electronic device and thus for effectively combating the fraudulent dissemination of protected content. The invention further relates to such a device as well as to a method enabling permanent revocation thereof if the device is considered to be unlawfully used or optional reinstatement of the device.

## Claims

### Claim 1

A method for producing a control word k′, said method being performed by a processing means of an electronic device interacting with a terminal, said device comprising a means for receiving an encrypted control word c from the terminal and a means for issuing said produced control word k′ to said terminal, said method comprising:
a step of applying to the encrypted control word c a decryption function D by the processing means, and thus of calculating a decrypted word k such that k=D(c), wherein the decrypted word k comprises a component v, and
a step of producing the control word k′ respectively identical to or distinct from k according to the result of a comparison operation between the value of v and that of an identifier i that is exclusive to the device.

### Claim 2 (depends on 1)

A method according to claim 1, wherein the step of producing the control word k′ that is distinct from k of comprises producing a word k′=kf in which the value kf is different from the value of k.

### Claim 3 (depends on 1)

A method according to claim 1, wherein the step of producing the control word k′ that is distinct from k consists of using a delay function such that the issuing means issues a control word k′=kd in which the value is equal to k after a pre-determined period of time.

### Claim 4 (depends on 1)

A method according to claim 1, wherein the step of producing the control word k′ comprises producing a word that is:
identical to k if the value of the component v is strictly lower than the value of the identifier i;
distinct from k if the value of the component v is not lower than the value of the identifier i.

### Claim 5 (depends on 1)

A method according to claim 1, wherein:
the identifier i is a vector of z integers with values i=(i, . . . , iz) contained in a set [1,m], m and z being integers higher than 1;
the component v is a vector of z integers with values v=(v, . . . , vz) contained in a set [0,m];
and the step of producing the control word k′ of comprises producing a word that is:
identical to k if the value of each integer vI is respectively strictly lower than the value of each integer iI for every I between 1 and z,
distinct from k, otherwise.

### Claim 6 (depends on 1)

A method according to claim 1, wherein the control word comprises a component t and the method further comprises a step of interpreting said component t in order to produce the control word k′ from v, i and k.

### Claim 7 (depends on 6)

A method according to claim 6, further comprising a step of storing information Rp for indicating permanent revocation of the device if the component t is equal to a pre-determined value tp and if the component v is equal to the value of the identifier i.

### Claim 8 (depends on 6)

A method according to claim 6, further comprising a step of deleting information Rp for indicating permanent revocation of the device if the component t is equal to a pre-determined value ta and if the component v is equal to the value of the identifier i.

### Claim 9 (depends on 1)

An electronic device interacting with a terminal, said device comprising:
a means for receiving an encrypted control word c from the terminal;
a processing means for producing a control word k′ according to said encrypted control word c;
a means for issuing, to said terminal, said control word produced in response to receiving the encrypted control word c, and
a means for storing an identifier i,
wherein said processing means produces the control word k′ in accordance with claim 1.

### Claim 10 (depends on 9)

An electronic device according to claim 9, further comprising a means for using a delay function interacting with the processing means, wherein said processing means causes the issuing means to issue a control word k′ whose value is equal to k after a pre-determined period of time.

### Claim 11 (depends on 9)

An electronic device according to claim 9, further comprising a means for storing information Rp indicating permanent revocation of said device, and
wherein the processing means interacts with said storage means to produce a control word k′ whose value is distinct from k when the information Rp is equal to a value that indicates permanent revocation of the device.

### Claim 12 (depends on 9)

An electronic device according to claim 9, further comprising a means for storing or generating a word with a value kf that is different from the value of k.

### Claim 13 (depends on 9)

A method for identifying an electronic device according to claim 9 interacting with a pirate terminal capable of broadcasting via a pirate network a control word k′ produced by said device, said identification method being comprising:
a step of producing a control word k, by determining the value of a component v of said control word;
a step of producing an encrypted control word c by encrypting said control word k by means of an encryption function E, such that c=E(k);
a step of broadcasting said encrypted control word c via a broadcast network towards terminals, including said pirate terminal;
a step of observing the pirate network, by measuring a probability p(k|v) of noticing the actual transmission of a control word k′ with value k, knowing the value of v; and
an identification step which comprises returning a value directly linked to the identifier i of a device that has produced a control word k′ broadcast via the pirate network, according to the value of v and the measurement of said probability p(k|v).

### Claim 14 (depends on 9)

A method for identifying an electronic device according to claim 9 interacting with a terminal capable of broadcasting via a pirate network (6) content M′ previously produced by said terminal, by decoding encrypted content C by means of a control word k′ and a decoding function dec such that M′=dec(k′,C), said control word k′ having been produced by said device from an encrypted control word c transmitted together with C over a broadcast network, said identification method comprising:
a step of producing a control word k, by determining the value of a component v of said control word;
a step of producing an encrypted control word c by encrypting said control word k by means of an encryption function E, such that c=E(k);
a step of producing encrypted content C by encoding content M by means of said control word k and an encoding function enc such that C=enc(k,M);
a step of broadcasting said encrypted control word c together with said encrypted content C via the broadcast network towards terminals including said pirate terminal;
a step of observing the flow of said pirate network by measuring a probability p(M|v) of noticing the actual transmission of content M′ with value M, knowing the value of v; and
an identification step which comprises returning a value directly linked to the identifier i of a device that has produced a control word k′ that has been used by the pirate terminal to create content M′ broadcast via the pirate network, according to the value of v and the measurement of said probability p(M|v).

### Claim 15 (depends on 13)

A method according to claim 13, further comprising producing a control word k′ by:
applying to the encrypted control word c a decryption function D, and thus calculating a decrypted word k such that k=D(c), wherein the decrypted word k comprises a component v, and
producing the control word k′ respectively identical to or distinct from k according to the result of a comparison operation between the value of v and that of an identifier i that is exclusive to the device;
and further comprising one or more iterations in which:
the step of determining the component v comprises:
previously initialising a value v at 0;
increasing the value of the component v such that the probability, knowing the value of v, of noticing the actual transmission of a control word k′ with value k or of content M′ with value M is close to 1;
and wherein the identification step comprises returning the value of v when the measurement of said probability, knowing the value of v, of noticing the actual transmission of a control word k′ with value k or of content M′ with value M is close to 0 when the measurement of said probability, knowing the value of v−1, is close to 1.

### Claim 16 (depends on 13)

A method according to claim 13, further comprising producing a control word k′ by:
applying to the encrypted control word c a decryption function D, and thus calculating a decrypted word k such that k=D(c), wherein the decrypted word k comprises a component v, and
producing the control word k′ respectively identical to or distinct from k according to the result of a comparison operation between the value of v and that of an identifier i that is exclusive to the device;
and further comprising one or more iterations in which:
the step of determining a component v comprises:
previously initialising a and b, two numbers such that a=1 and b=n, n being the maximum value of the component v;
calculating the value of the component such that v=(a+b)/2;
assigning to a the current value of v such that the probability, knowing the value of v, of noticing the actual transmission of a control word k′ with value k or of content M′ with value M is close to 1;
assigning to b the current value of v such that the probability, knowing the value of v, of noticing the actual transmission of a control word k′ with value k or of content M′ with value M is not close to 1;
and wherein the identification step consists of returning the value of v when the value a−1 is equal to b.

### Claim 17 (depends on 13)

A method according to claim 13, further comprising producing a control word k′ by:
applying to the encrypted control word c a decryption function D, and thus calculating a decrypted word k such that k=D(c), wherein the decrypted word k comprises a component v, and
a step of producing the control word k′ respectively identical to or distinct from k according to the result of a comparison operation between the value of v and that of an identifier i that is exclusive to the device;
and further comprising one or more iterations in which:
the step of determining a component v comprises:
previously initialising an integer I such that I=1 and v, as a vector of z integers, such that v=(0, . . . , 0);
increasing v1 such that the probability, knowing the value of v, of respectively noticing the actual transmission of a control word k′ with value k or of content M′ with value M is close to 1;
decreasing vI and increasing I such that the probability, knowing the value of v, of noticing the actual transmission of a control word k′ with value k or of content M′ with value M is not close to 0 and that the value of I is no higher than z;
the identification step consists of returning the value of v when the value of 1 is higher than z.
