Electronic book security features

• US 8,791,788 B2
• Filed: 06/21/2010
• Issued: 07/29/2014
• Est. Priority Date: 08/20/2009
• Status: Active Grant

• Current Assignee: Synamedia Limited
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Zucker, Arnold, Smith, Perry, Tsuria, Yossi, Cain, Harel, Solow, Hillel, Epstein, Steve, Atlow, Shabtai
• Primary Examiner(s): BROWN, VERNAL U
• Application Number:
  US13/384,687
• Publication Number:
  US 20120139693A1
• Time in Patent Office: 1,499 Days
• Field of Search: 340/5.2, 340/3.1, 340/5.8, 382/232, 382/277
• US Class Current: 340/5.2
• CPC Class Codes: G06F 21/1013 to locations
• CPC Class Codes: G06F 21/32 using biometric data, e.g. fingerprints, iris scans or voiceprints
• CPC Class Codes: G06F 21/88 Detecting or preventing theft or loss
• CPC Class Codes: G06F 2221/2111 Location-sensitive, e.g. geographical location, GPS
• CPC Class Codes: G06T 1/0042 Fragile watermarking, e.g. so as to detect tampering
• CPC Class Codes: G06T 2201/0051 Embedding of the watermark in the spatial domain
• CPC Class Codes: G06V 30/10 Character recognition
• CPC Class Codes: G06V 30/148 Segmentation of character regions
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/0861 using biometrical features, e.g. fingerprint, retina-scan cryptographic mechanisms or cryptographic arrangements for entity authentication using biological data H04L9/3231
• CPC Class Codes: H04N 2005/91364 the video signal being scrambled
• CPC Class Codes: H04N 21/4223 Cameras H04N23/00 takes precedence
• CPC Class Codes: H04N 21/44008 involving operations for analysing video streams, e.g. detecting features or characteristics in the video stream arrangements characterised by components specially adapted for monitoring, identification or recognition of video in broadcast systems H04H60/59
• CPC Class Codes: H04N 21/4627 Rights management associated to the content security in data switching network management H04L41/28; security management or policies for network security H04L63/20; access security in wireless networks H04W12/08
• CPC Class Codes: H04N 21/8352 involving content or source identification data, e.g. Unique Material Identifier [UMID]
• CPC Class Codes: H04N 5/913 for scrambling ; for copy protection

Abstract

A method and system for fingerprinting a content item is described, the content item including a set of content item elements E, providing information uniquely associated with a single user including a string of bits S₀, parsing S₀ into a plurality of substrings which are functions of S₀, providing a matrix of content item replacement elements, each row of which includes, for each member of E, an array of content item replacement elements for E_i, uniquely associating each substring of S₀ so that for every substring there exists a corresponding element of E, for every substring, replacing at least one instance of the corresponding element E in the content item with one substitute matrix element for the corresponding substring, and outputting a replacement content item including the result of the replacing, the substitute matrix elements being chosen according to at least one similarity criterion.

Claims

1. A method for fingerprinting a content item, the method comprising:

providing the content item, the content item comprising a set of content item elements, the set of content item elements denoted E, such that E={E₁, E₂, . . . E_i, . . . E_m};

providing information uniquely associated with a single user, the information comprising a string of bits, hereinafter denoted S₀;

parsing S₀ into a plurality of subsequences of strings of bits, hereinafter denoted S₁, . . . , S_n, the parsing being performed such that S₀ equals a function of S₁, . . . , S_n;

providing a matrix of content item replacement elements, the matrix denoted R, each row of matrix R comprising, for at least each one of n members of set E, an array of content item replacement elements for E_i denoted R_i, such that R_i={R_i1, . . . R_ij};

uniquely associating, by a processor, each one of the possible combinations of subsequences for each of S₁, . . . , S_n with one matrix element of matrix R, so that for every one of the possible combination of subsequences of bits and for each S₁, . . . , S_n there exists a corresponding element of E;

for every one of S₁, . . . , S_n replacing at least one instance of the corresponding element E in the content item with the associated one matrix element of matrix R for the corresponding one of S₁, . . . , S_n; and

outputting a replacement content item comprising the result of the replacing,

wherein the members of R_i for each E_i are chosen according to at least one criterion of similarity to the content item E_i to be replaced.

2. The method of claim 1 and also comprising storing a record indicating which matrix element of matrix R replaces which subsequence of S₁, . . . , S_n.

3. The method according to claim 1 and wherein the choosing according to a similarity criterion comprises choosing from a table.

4. The method according to claim 3 and wherein the table comprises a plurality of Unicode characters.

5. The method according to claim 3 and wherein the table comprises a plurality of colors.

6. The method according to claim 3 and wherein the table comprises a plurality of gray scale levels.

7. The method according to claim 1 and wherein the content item comprises a text based content item.

8. The method according to claim 7 and wherein the E_i comprised in the text based content item comprises a Unicode character.

9. The method according to claim 7 and wherein the E_i comprised in the text based content item comprises at least one pixel displayed in one character.

10. The method according to claim 1 wherein the content item comprises a graphic content item.

11. The method according to claim 10 and wherein the E_i comprised in the graphic content item comprises at least one pixel.

12. The method according to claim 1 and wherein the content item comprises a sound based content item.

13. The method according to claim 1 and wherein the content item comprises a video based content item.

14. The method according to claim 13 and wherein the E_i comprised in the video based content item comprises at least one pixel.

15. A system for fingerprinting a content item, the system comprising:

a content item comprising a set of content item elements, the set of content item elements denoted E, such that E={E₁, E₂, . . . E_i, . . . E_m};

information uniquely associated with a single user, the information comprising a string of bits, hereinafter denoted S₀;

a parser operative to parse S₀ into a plurality of subsequences of strings of bits, hereinafter denoted S ₁, . . . , S_n, the parsing being performed such that S₀ equals a function of S₁, . . . , S_n;

a matrix of content item replacement elements, the matrix denoted R, each row of matrix R comprising, for at least each one of n members of set E, an array of content item replacement elements for E_i denoted R_i, such that R_i={R_i1, . . . R_ij};

a processor which uniquely associates each one of the possible combinations of subsequences for each of S₁, . . . , S_n with one matrix element of matrix R, so that for every one of the possible combination of subsequences of bits and for each S₁, . . . , S_n there exists a corresponding element of E;

a replacer, operative to replace, for every one of S₁, . . . , S_n, at least one instance of the corresponding element E in the content item with the associated one matrix element of matrix R for corresponding one of S₁, . . . , S_n; and

a replacement content item outputting unit which outputs a replacement content item comprising the result of the replacing,

wherein the members of R_i for each E_i are chosen according to at least one criterion of similarity to the content item E_i to be replaced.

16. A system for fingerprinting a content item, the system comprising:

means for providing the content item, the content item comprising a set of content item elements, the set of content item elements denoted E, such that E={E₁, E₂, . . . E_i, . . . E_m};

means for providing information uniquely associated with a single user, the information comprising a string of bits, hereinafter denoted S₀;

means for parsing S₀ into a plurality of subsequences of strings of bits, hereinafter denoted S₁, . . . , S_n, the parsing being performed such that S₀ equals a function of S₁, . . . , S_n;

means for providing a matrix of content item replacement elements, the matrix denoted R, each row of matrix R comprising, for at least each one of n members of set E, an array of content item replacement elements for E_i denoted R_i, such that R_i={R_i1, . . . R_ij};

means for uniquely associating each one of the possible combinations of subsequences for each of S₁, . . . , S_n with one matrix element of matrix R, so that for every one of the possible combination of subsequences of bits and for each S₁, . . . , S_n there exists a corresponding element of E;

for every one of S₁, . . . , S_n means for replacing at least one instance of the corresponding element E in the content item with the associated one matrix element of matrix R for the corresponding one of S₁, . . . , S_n; and

means for outputting a replacement content item comprising the result of the replacing,

wherein the members of R_i for each E_i are chosen according to at least one criterion of similarity to the content item E_i to be replaced.