Civolution B.v.

Koninklijke Philips Corporation N.v.

Irdeto Corporate B.v.

Teletrax B.v.

Irdeto B.v.

Mehmet Utku Celik

Martijn Maas

Aweke Negash Lemma

Johan Cornelis Talstra

Pim Theo Tuyls

Jaap Andre Haitsma

Boris Skoric

Gerrit Cornelis Langelaar

Paulus M H M A Gorissen

Wilhelmus P A J Michiels

Valery Stepanovich Kot

Stefan Katzenbeisser

John Pierre Jacobus Verhagen

Aweke N Lemma

A method of and system for distributing a content item, having a plurality of segments. A composite content item is created by concatenating segments from different content items from different agencies. A segment of the composite content item may or may not already comprise a previously embedded segment watermark carrying a previously embedded segment payload. The method comprises determining if the segment already comprises a previously embedded segment watermark, and if so, logging the previously embedded segment payload in a watermark transaction log associated with the new segment payload; otherwise, embedding the new segment payload as a watermark in the segment. In the case that the segment already comprises a previously embedded segment payload, the previously embedded payload is logged in a watermark transaction log, and the previously embedded segment payload is replaced with a new segment watermark that represents the new segment payload. A method and system for monitoring the distribution of a content item using a transaction log.

Distribution of a content item and monitoring the distribution using watermarking

In a method of distributing content in plural fragments, each fragment being no longer than a given maximum fragment length, a method of watermarking the content prior to fragmenting the content into the plural fragments, comprising watermarking a given payload symbol from a given alphabet in a given segment of the content, and treating a segment prior to or following the given segment as an intermediary segment, the length of this intermediary segment being substantially equal to or greater than the maximum fragment length.

Method and system for watermarking content prior to fragmenting

A method of detecting a payload embedded using watermarking in a content stream, the payload being different in a first and a second segment of the content stream, a payload in the second segment having a predetermined relationship with a payload in the first segment, is described. The method selects a point in the content stream where the first segment is likely to end and the second segment to begin, samples the stream to obtain a first set of samples that is before the chosen point and a second set of samples that is after the chosen point, and detects the payload on a combination of the first set and a transformation of the second set, where the transformation is based on the assumption that the second set is from the second segment and exploits the relationship that exists between the payloads in the first and second segments.

Watermark detection with payload

A method for detecting a payload embedded using watermarking in a content stream, the payload being different in a first and a second segment of the content stream, a payload in the second segment having a predetermined relationship with a payload in the first segment, is described. The method selects a point in the content stream where the first segment is likely to end and the second segment to being, samples the stream to obtain a first set of samples that is before the chosen point and a second set of samples that is after the chosen point, and detects the payload on a combination of the first set and a transformation of the second set, where the transformation is based on the assumption that the second set is from the second segment and exploits the relationship that exists between the payloads in the first and second segments.

A method of encrypting data using a first key and multiple encryption keys at least in part based on the first key. The method includes encoding the data into a redundant representation by distributing the information content of the data among a number of groups, each group being associated with a respective encryption key of the multiple encryption keys, each encryption key being associated with at least one group, the redundant representation allowing recovery of the data in the absence of the groups associated with the at least one of the multiple encryption keys, and encrypting each group by the respective associated encryption key.

Method and apparatus for encrypting/decrypting data

A method of watermarking a video signal includes encoding the video signal using at least one encoding parameter that is time-varied according to a watermarking pattern. The parameter affects information lost while encoding the signal. The parameter may be a quantization factor corresponding to a particular coefficient of an encoding transform. The parameter may be an element of a quantization matrix corresponding to a particular coefficient in a block DCT transform. The method may be implemented in devices with limited processing resources by means of a software update. The method enables the devices to imprint an encoded signal with a robust watermark, which may survive subsequent decompression and recompression. Alternatively, a video signal may be watermarked by modifying a magnitude of a non-dc spatial frequency component in a manner which varies with time according to a watermarking pattern. Corresponding watermark detection methods and watermarking devices also are disclosed.

Video watermarking

Client terminals report an easy-to-calculate identifier such as the Internet URL or a cryptographic hash of the content to a server. The server collects and counts the reported identifiers so as to obtain preliminary statistics. By aggregating these reported identifiers into the preliminary statistics, identifiers are revealed that are likely popular content. The server selects one or more identifiers from the preliminary statistics and makes these available to at least a subset of clients. The clients that obtain these one or more identifiers then access content and compute the easy-to-calculate identifiers as usual. If the computed identifier matches one of the identifiers obtained from the server, the client will additionally extract a watermarked identifier or compute a digital fingerprint of the content in question and report this to the server. The server then uses the received identifier or fingerprint to create final statistics by aggregating the preliminary statistics.

Generating statistics of popular content

A system for cryptographic processing of content comprises an input for receiving the content. A plurality of look-up tables represents a white-box implementation of a combined cryptographic and watermarking operation. The look-up tables represent processing steps of the combined cryptographic and watermarking operation and the look-up tables being arranged for being applied according to a predetermined look-up scheme. The look-up scheme prescribes that an output of a first look-up table of the plurality of look-up tables be used to generate an input of a second look-up table of the plurality of look-up tables. The combined cryptographic and watermarking operation comprises a cryptographic operation and a watermarking operation. A control module looks up values in the plurality of look-up tables in dependence on the received content and in accordance to the look-up scheme, thereby applying the combined cryptographic and watermarking operation to the content.

Growing community of inventors

Eindhoven, Netherlands

Mehmet Utku Celik