Abstract: The problem is solved by a method for broadcasting a broadcast signal, comprising generating an information signal having in time a first content up to a certain time and a second content after this time. The information signal is broadcast as a broadcast signal via a first communication link. At least one first feature is being provided with respect to the second content, for example an advertisement. The second content is detected in the information signal using the at least one first feature. On detection of the second content in the information signal at least one second feature is extracted from the first content in the information signal preceding the second content. The at least one second feature is sent to a user device using a second communication link, different from the first communication link, the second communication link being faster than the first communication link.

Abstract: The problem is solved by a method for broadcasting a broadcast signal, comprising generating an information signal having in time a first content up to a certain time and a second content after this time. The information signal is broadcast as a broadcast signal via a first communication link. At least one first feature is being provided with respect to the second content, for example an advertisement. The second content is detected in the information signal using the at least one first feature. On detection of the second content in the information signal at least one second feature is extracted from the first content in the information signal preceding the second content. The at least one second feature is sent to a user device using a second communication link, different from the first communication link, the second communication link being faster than the first communication link.

Abstract: 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.

Abstract: The present invention relates to a communication system comprising a first node and second node adapted for communicating in a network, wherein the first node comprises a first list of keying materials including a plurality of keying materials, wherein the second node comprises a second list of keying materials including a plurality of keying materials, wherein the first node further comprises a receiver for receiving from the second node a second node identifier, a controller being arranged for determining from the second node identifier the position in the first list of at least one keying material having a common root with one keying material of the second list, and for generating an encryption key by means of the keying material having a common root and the second node identifier.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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 water-marking 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.

Abstract: 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.

Abstract: 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.

Abstract: A device for rendering content from a first source comprising a first input for receiving the content from the first source, a second input for receiving a substitution content item from a second source, a substitution module for substituting a segment of the content with the substitution content item, and rendering means for rendering the content wherein the segment is substituted with the substitution content item. The rendering device has monitoring module for monitoring the reception of the segment, and controlling the substitution module dependent on whether the segment is being received, such that the substitution module ceases the substitution upon failure to receive the segment.

Abstract: The problem is solved by a method for broadcasting a broadcast signal, comprising generating an information signal having in time a first content up to a certain time and a second content after this time. The information signal is broadcast as a broadcast signal via a first communication link At least one first feature is being provided with respect to the second content, for example an advertisement. The second content is detected in the information signal using the at least one first feature. On detection of the second content in the information signal at least one second feature is extracted from the first content in the information signal preceding the second content.

Abstract: The present invention relates to a method for secure communications and communication networks having communication devices, using secure means like encryption system for securing communications. More particularly, the present invention relates to a method for secure communications from a first node (N1) to a second node (N2) in a network, the first node comprising a first node keying material (KM(ID1)), the second node comprising a second node keying material (KM(ID2)), wherein the keying materials of the first node and of the second node comprise each a plurality of keying root shares formed by keying root share segments. The method using key segmentation for pre-distributing keying material according to a variable distribution for increasing the resiliency of existing methods.

Abstract: The present invention relates to a communication system comprising a first node and second node adapted for communicating in a network, wherein the first node comprises a first list of keying materials including a plurality of keying materials, wherein the second node comprises a second list of keying materials including a plurality of keying materials, wherein the first node further comprises a receiver for receiving from the second node a second node identifier, a controller being arranged for determining from the second node identifier the position in the first list of at least one keying material having a common root with one keying material of the second list, and for generating an encryption key by means of the keying material having a common root and the second node identifier.

Abstract: The present invention relates to a method for secure communications and communication networks having communication devices, using secure means like encryption system for securing communications. More particularly, the present invention relates to a method for secure communications from a first node (N1) to a second node (N2) in a network, the first node comprising a first node keying material (KM(ID1)), the second node comprising a second node keying material (KM(ID2)), wherein the keying materials of the first node and of the second node comprise each a plurality of keying root shares formed by keying root share segments. The method using key segmentation for pre-distributing keying material according to a variable distribution for increasing the resiliency of existing methods.

Abstract: 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.

Abstract: A wireless system and method to control the cryptographic keying material that has been compromised in the network; exclude captured nodes from the network; and update compromised keying material in uncompromised devices are described. This system and method is useful in alpha-secure key distribution systems comprising a multitude of alpha-secure keying material shares to be controlled, revoked or updated.