EP1172001A1 - Utilisation de la reduction de donnees dans des systemes steganographiques et cryptographiques - Google Patents

Utilisation de la reduction de donnees dans des systemes steganographiques et cryptographiques

Info

Publication number
EP1172001A1
EP1172001A1 EP00919398A EP00919398A EP1172001A1 EP 1172001 A1 EP1172001 A1 EP 1172001A1 EP 00919398 A EP00919398 A EP 00919398A EP 00919398 A EP00919398 A EP 00919398A EP 1172001 A1 EP1172001 A1 EP 1172001A1
Authority
EP
European Patent Office
Prior art keywords
signal
data signal
data
remainder
produce
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP00919398A
Other languages
German (de)
English (en)
Other versions
EP1172001A4 (fr
Inventor
Scott A. Moskowitz
Michael Berry
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Blue Spike Inc
Original Assignee
Blue Spike Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Blue Spike Inc filed Critical Blue Spike Inc
Publication of EP1172001A1 publication Critical patent/EP1172001A1/fr
Publication of EP1172001A4 publication Critical patent/EP1172001A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
    • G06T1/0071—Robust watermarking, e.g. average attack or collusion attack resistant using multiple or alternating watermarks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32267—Methods relating to embedding, encoding, decoding, detection or retrieval operations combined with processing of the image
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32267—Methods relating to embedding, encoding, decoding, detection or retrieval operations combined with processing of the image
    • H04N1/32272—Encryption or ciphering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32288—Multiple embedding, e.g. cocktail embedding, or redundant embedding, e.g. repeating the additional information at a plurality of locations in the image
    • H04N1/32304—Embedding different sets of additional information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46—Embedding additional information in the video signal during the compression process
    • H04N19/467—Embedding additional information in the video signal during the compression process characterised by the embedded information being invisible, e.g. watermarking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
    • H04N21/2389—Multiplex stream processing, e.g. multiplex stream encrypting
    • H04N21/23892—Multiplex stream processing, e.g. multiplex stream encrypting involving embedding information at multiplex stream level, e.g. embedding a watermark at packet level
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
    • H04N21/835—Generation of protective data, e.g. certificates
    • H04N21/8358—Generation of protective data, e.g. certificates involving watermark
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00—Television systems
    • H04N7/16—Analogue secrecy systems; Analogue subscription systems
    • H04N7/167—Systems rendering the television signal unintelligible and subsequently intelligible
    • H04N7/1675—Providing digital key or authorisation information for generation or regeneration of the scrambling sequence
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3225—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document
    • H04N2201/3233—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document of authentication information, e.g. digital signature, watermark

Definitions

  • This invention relates to digital signal processing, and more particularly to a method and a system for encoding at least one digital watermark into a signal as a means of conveying information relating to the signal and also protecting against unauthorized manipulation of the signal.
  • Digital watermarks help to authenticate the content of digitized multimedia information, and can also discourage piracy. Because piracy is clearly a disincentive to the digital distribution of copyrighted content, establishment of responsibility for copies and derivative copies of such works is invaluable. In considering the various forms of multimedia content, whether "master,” stereo, NTSC video, audio tape or compact disc, tolerance of quality will vary with individuals and affect the underlying commercial and aesthetic value of the content. It is desirable to tie copyrights, ownership rights, purchaser information or some combination of these and related data into the content in such a manner that the content must undergo damage, and therefore reduction of its value, with subsequent, unauthorized distribution, commercial or otherwise. Digital watermarks address many of these concerns.
  • a matter of general weakness in digital watermark technology relates directly to the manner of implementation of the watermark. Many approaches to digital watermarking leave detection and decode control with the implementing party of the digital watermark, not the creator of the work to be protected. This weakness removes proper economic incentives for improvement of the technology.
  • One specific form of exploitation mostly regards efforts to obscure subsequent watermark detection. Others regard successful over encoding using the same watermarking process at a subsequent time.
  • Yet another way to perform secure digital watermark implementation is through "key-based” approaches. This paper draws a distinction between a "forensic watermark,” based on provably-secure methods, and a “copy control” or “universal” watermark which is intended to be low cost and easily implemented into any general computing or consumer electronic device.
  • a watermark can be forensic if it can identify the source of the data from which a copy was made. For example, assume that digital data are stored on a disk and provided to "Company A” (the “A disk”). Company A makes an unauthorized copy and delivers the copy to "Company B” (the “B disk”). A forensic watermark, if present in the digital data stored on the "A disk,” would identify the "B disk” as having been copied from the "A disk.”
  • a copy control or universal watermark is an embedded signal which is governed by a "key” which may be changed (a "session key") to increase security, or one that is easily accessible to devices that may offer less than strict cryptographic security.
  • the "universal" nature of the watermark is the computationally inexpensive means for accessing or other associating the watermark with operations that can include playback, recording or manipulations of the media in which it is embedded.
  • a fundamental difference is that the universality of a copy control mechanism, which must be redundant enough to survive many signal manipulations to eliminate most casual piracy, is at odds with the far greater problem of establishing responsibility for a given instance of a suspected copying of a copyrighted media work.
  • a method of securing a data signal comprises the steps of: applying a data reduction technique to reduce the data signal into a reduced data signal; subtracting said reduced data signal from the data signal to produce a remainder signal; using a first cryptographic technique to encrypt the reduced data signal to produce an encrypted, reduced data signal; using a second cryptographic technique to encrypt the remainder signal to produce an encrypted remainder signal; and adding said encrypted, reduced data signal to said encrypted remainder signal to produce an output signal.
  • a system for securing a data signal comprises: means to apply a data reduction technique to reduce the data signal into a reduced data signal; means to subtract said reduced data signal from the data signal to produce a remainder signal; means to apply a first cryptographic technique to encrypt the reduced data signal to produce an encrypted, reduced data signal; means to apply a second cryptographic technique to encrypt the remainder signal to produce an encrypted remainder signal; and means to add said encrypted, reduced data signal to said encrypted remainder signal to produce an output signal.
  • a method of securing a data signal comprises the steps of: applying a data reduction technique to reduce the data signal into a reduced data signal; subtracting said reduced data signal from the data signal to produce a remainder signal; embedding a first watermark into said reduced data signal to produce a watermarked, reduced data signal; embedding a second watermark into said remainder signal to produce a watermarked remainder signal; and adding said watermarked, reduced data signal to said watermarked remainder signal to produce an output signal.
  • a method of protecting a data signal comprises: applying a data reduction technique to reduce the data signal into a reduced data signal; subtracting said reduced data signal from the data signal to produce a remainder signal; using a first scrambling technique to scramble said reduced data signal to produce a scrambled, reduced data signal; using a second scrambling technique to scramble said remainder signal to produce a scrambled remainder signal; and adding said scrambled, reduced data signal to said scrambled remainder signal to produce an output signal.
  • the present invention interprets the signal as a stream which may be split into separate streams of digitized samples or may undergo data reduction (including both lossy and lossless compression, such as MPEG lossy compression and Meridian's lossless compression, down sampling, common to many studio operations, or any related data reduction process)
  • the stream of data can be digital m nature, or may also be an analog waveform (such as an image, audio, video, or multimedia content)
  • One example of digital data is executable binary code
  • the present invention allows for more efficient, secure, copy ⁇ ght protection when handling functionality and associations with predetermined keys and key pans in software applications or the machine readable versions of such code in microchips and hardware devices Text may also be a candidate for authentication or higher levels of secu ⁇ ty when coupled with secure key exchange or asymmetric key generation between parties
  • the subsets of the data stream combine meaningful and meaningless bits of data which may be mapped or transferred depending on the application intended by the
  • the present mvention utilizes data reduction to allow better performance in watermarking as well as cryptographic methods concerning binary executable code, its machine readable form, text and other functionality-based or communication-related applications Some differences may simply be in the structure of the key itself, a pseudo random or random number st ⁇ ng or one which also includes additional secu ⁇ ty with special one way functions or signatures saved to the key The key may also be made into key pairs, as is discussed in other disclosures and patents referenced herein
  • the present mvention contemplates watermarks as a plurality of digitized sample streams, even if the digitized streams originate from the analog waveform itself
  • the present mvention also contemplates that the methods disclosed herein can be applied to non-digitized content Universally, data reduction adheres to some means of "understanding "the reduction” This disclosure looks at data reduction which may include down sampling, lossy compression, summarization or any means of data reduction as a novel means to speed up watermarking encode and decode operations Essentially a lossy method for data reduction yield
  • the present invention also contemplates the use of data reduction for purposes of speedier and more tiered forms of security, including combinations of these methods with transfer function functions.
  • transfer functions e.g., scrambling
  • mapping functions e.g., watermarking
  • mapping functions e.g., watermarking
  • predetermined keys are associated with transfer functions instead of mapping functions, although those skilled in the art may recognize that a transfer function is simply a subset of mask sets encompassing mapping functions. It is possible that tiered scrambling with data reduction or combinations of tiered data reduction with watermarking and scrambling may indeed increase overall security to many applications.
  • FIG. 1 is a functional block diagram that shows a signal processing system that generates "n" remainder signals and "n” data reduced signals.
  • FIG. 2 is a functional block diagram for an embodiment of the present invention which illustrates the generation of an output signal comprised of a data-reduced, watermarked signal and a first remainder signal.
  • FIG. 3 is a functional block diagram for an embodiment of the present invention which illustrates the generation of an output signal comprised of a data-reduced, watermarked signal and a watermarked, first remainder signal.
  • FIG. 4 is a functional block diagram for decoding the output signal generated by the system illustrated in FIG. 2.
  • FIG. 5 is a functional block diagram for decoding the output signal generated by the system illustrated in FIG. 3.
  • FIG. 6 is a functional block diagram for an embodiment of the present invention which illustrates the generation of an output signal comprised of a data-reduced, scrambled signal and a first remainder signal.
  • FIG. 7 is a functional block diagram for an embodiment of the present invention which illustrates the generation of an output signal comprised of a data— reduced, scrambled signal and a scrambled, first remainder signal.
  • FIG. 8 is a functional block diagram for decoding the output signal generated by the system illustrated in FIG. 6.
  • FIG. 9 is a functional block diagram for decoding the output signal generated by the system illustrated in FIG. 7. DETAILED DESCRIPTION
  • FIG. 1 A system for achieving multiple levels of data reduction is illustrated in FIG. 1.
  • An input signal 10 for example, instructional text, executable binary computer code, images, audio, video, multimedia or even virtual reality imaging
  • First data reduced signal 20 is then subtracted from input signal 10 to generate a first remainder signal 30.
  • First data reduced signal 20 is subjected to a second data reduction technique 101 to generate a second data reduced signal 21.
  • Second data reduced signal 21 is then subtracted from first data reduced signal 20 to generate a second remainder signal 31.
  • Each of the successive data reduced signals is, in turn, subjected to data reduction techniques to generate a further data reduced signal, which, in turn, is subtracted from its respective parent signal to generate another remainder signal.
  • This process is generically described as follows.
  • An (n-1) data reduced signal 28 i.e, a signal that has been data reduced n-1 times
  • the nth data reduced signal 29 is then subtracted from the (n-1 ) data reduced signal 28 to produce an n* remainder signal 39.
  • An output signal can be generated from the system illustrated in FIG. 1 in numerous ways.
  • each of the n remainder signals (which, through represented by reference numerals 30-39, are not intended to be limited to 10 signals) and the n th data signal may optionally subjected to a watermarking technique, or even optionally subjected to a encryption technique, and each of the (n+1) signals (whether watermarked or encrypted, or otherwise untouched) may then be added together to form an output signal.
  • each of the (n+1) signals (i.e., the n remainder signals and the n th data reduced signal) can be added together without any encryption or watermarking to form an output signal; or one or more of the (n+1) signals may be watermarked and then all (n+1) signals may be added together; or one or more of the (n+1) signals may be encrypted and then all (n+1) signals may be added together. It is anticipated that between these three extremes lie numerous hybrid combinations involving one or more encryptions and one or more watermarkings.
  • Each level may be used to represent a particular data density.
  • the reduction method is down-sampling, for a DVD audio signal the first row would represent data sampled at 96 kHz, the second at 44.1 kHz., the third at 6 kHz., etc.
  • Further security can be increased by including block ciphers, special one way functions, one time stamps or even biometric devices in the software or hardware devices that can be embodied. Passwords or biometric data are able to assist in the determination of the identity of the user or owner of the data, or some relevant identifying information.
  • DVD 24 bit 96 kHz, encoded watermarks should be detected in at least "real time,” even after the signal has been down sampled, to say 12 kHz of the 96 kHz originally referenced.
  • the present invention also permits the ability to separate any other bits which may be associated with other more secure predetermined keys or key pairs.
  • the present invention contemplates breaking the code into objects or similar units of functionality and allowing for determination of what is functionally important. This may be more apparent to the developer or users of the software or related hardware device. Data reduction through the use of a subset of the functional objects related to the overall functionality of the software or executable code in hardware or microchips, increase the copyright protection or security sought, based on reducing the overall data to be associated with predetermined keys or key pairs. Similarly, instead of mapping functions, transfer functions, so-called “scrambling,” appear better candidates for this type of security although both mapping and transferring may be used in the same system.
  • the associated keys and key pairs can be used to substantially improve the security and to offer easier methods for changing which functional "pieces" of executable computer code are associated with which predetermined keys.
  • These keys may take the form of time-sensitive session keys, as with transactions or identification cards, or more sophisticated asymmetric public key pairs which may be changed periodically to ensure the security of the parties' private keys.
  • These keys may also be associated with passwords or biometric applications to further increase the overall security of any potential implementation.
  • An example for text message exchange is less sophisticated but, if it is a time sensitive event, e.g., a secure communication between two persons, benefits may also be encountered here. Security may also be sought in military communications. The ability to associate the securely exchanged keys or key pairs while performing data reduction to enhance the detection or decoding performance, while not compromising the level of security, is important. Though a steganographic approach to security, the present invention more particularly addresses the ability to have data reduction to increase speed, security, and performance of a given steganographic system.
  • data reduction affords a more layered approach when associating individual keys or key pairs with individual watermark bits, or digital signature bits, which may not be possible without reduction because of considerations of time or the payload of what can be carried by the overall data "covertext" being transmitted.
  • Layering through data reduction offers many advantages to those who seek privacy and copyright protection. Serialization of the detection chips or software would allow for more secure and less “universal” keys, but the interests of the copyright owners are not always aligned with those of hardware or software providers. Similarly, privacy concerns limit the amount of watermarking that can be achieved for any given application.
  • Separation of the watermarks also relates to separate design goals.
  • a copy control mechanism should ideally be inexpensive and easily implemented, for example, a form of "streamed watermark detection.” Separating the watermark also may assist more consistent application in broadcast monitoring efforts which are time-sensitive and ideally optimized for quick detection of watermarks.
  • the structure of the key itself in addition to the design of the "copy control" watermark, will allow for few false positive results when seeking to monitor radio, television, or other streamed broadcasts (including, for example, Internet) of copyrighted material.
  • streamed broadcasts including, for example, Internet
  • a universal copy control watermark may be universal in consumer electronic and general computing software and hardware implementations, but less universal when the key structure is changed to assist in being able to log streaming, performance, or downloads, of copyrighted content.
  • the embedded bits may actually be paired with keys in a decode device to assure accurate broadcast monitoring and tamper proofing, while not requiring a watermark to exceed the payload available in an inaudible embedding process E g .
  • a full identification of the song, versus time-based digital signature bits, embedded into a broadcast signal may not be reco ⁇ ered or may be easily o ⁇ er encoded without the use of block ciphers, special one way functions or one time pads, during the encoding process, prior to broadcast Data reduction as herein disclosed makes this operation more efficient at higher speeds
  • a forensic watermark is not time sensitive, is file-based, and does not require the same speed demands as a streamed or broadcast-based detection mechanism for copy control use
  • a forensic watermark detection process may require additional tools to aid in ensuring that the signal to be analyzed is in approp ⁇ ate scale or size, ensuring signal characteristics and heuristic methods help in approp ⁇ ate recovery of the digital watermark
  • all aspects of the underlying content signal should be considered in the embedding process because the watermarking process must take into account all such aspects, including for example, any dimensional or size of the underlying content signal
  • the dimensions of the content signal may be saved with the key or key pair, without enabling reproduction of the unwatermarked signal
  • Heunstic methods may be used to ensure the signal is in proper dimensions for a thorough and accurate detection authentication and retrieval of the embedded watermark bits
  • Data reduction can assist m increasing operations of this nature as well, since the data reduction process may include information about the original signal, for example, signal characte ⁇ stics, signal abstracts
  • the present mvention provides benefits, not only because of the key-based approach to the watermarking, but the vast increase in performance and secu ⁇ ty afforded the implementations of the present invention over the performance of other systems
  • the architecture of key and key-pair based watermarking is superior to statistical approaches for watermark detection because the first method meets an evidentiary level of quality and are mathematically provable
  • key and key paired based watermarking is further improved.
  • levels of security are plainly necessary if digital watermarks are expected to establish responsibility for copies of copyrighted works in evidentiary proceedings. More sophisticated measures of trust are necessary for use in areas which exceed the scope of copyright but are more factually based in legal proceedings. These areas may include text authentication or software protection (extending into the realm of securing microchip designs and compiled hardware as well) in the examples provided above and are not contemplated by any disclosure or work in the art.
  • a predete ⁇ nined key is described as a set of masks: a plurality of mask sets. These masks may include primary, convolution and message delimiters but may extend into additional domains. In previous disclosures, the functionality of these masks is defined solely for mapping. Public and private keys may be used as key pairs to further increase the unlikeliness that a key may be compromised.- Examples of public key cryptosystems may be found in the following U.S. Patents Nos: 4,200,770; 4,218,582; 4,405,829; and 4,424,414, which examples are incorporated herein by reference. Prior to encoding, the masks described above are generated by a cryptographically secure random generation process. Mask sets may be limited only by the number of dimensions and amount of error correction or concealment sought, as has been previously disclosed.
  • a block cipher such as DES
  • DES in combination with a sufficiently random seed value emulates a cryptographically secure random bit generator.
  • These keys, or key pairs, will be saved along with information matching them to the sample stream in question in a database for use in subsequent detection or decode operation.
  • These same cryptographic protocols may be combined with the embodiments of the present invention in administering streamed content that requires authorized keys to correctly display or play said streamed content in an unscrambled manner.
  • symmetric or asymmetric public key pairs may be used in a variety of implementations. Additionally, the need for certification authorities to maintain authentic key-pairs becomes a consideration for greater security beyond symmetric key implementations, where transmission security is a concern.
  • FIG. 2 illustrates a system and method of implementing a multiple-watermark system.
  • An input signal 11 e.g., binary executable code, instruction text, or other data
  • a lossy data-reduction scheme 200 e.g., down-sampling, bit-rate reduction, or compression method
  • Data-reduced signal 40 is then embedded with a watermark (process step 300) to generate a watermarked, data-reduced signal 50, while a copy of the unmarked, data-reduced signal 40 is saved.
  • the saved, unwatermarked data-reduced signal (signal 40) is subtracted from the original input signal 11, yielding a remainder signal 60 composed only of the data that was lost during the data-reduction.
  • a second watermark is then applied (process step 301) to remainder signal 60 to generate a watermarked remainder signal 70.
  • the watermarked remainder 70 and the watermarked, data-reduced signal 50 are added to form an output signal 80, which is the final, full-bandwidth, output signal.
  • the two watermarking techniques may be identical (i.e., be functionally the same), or they may be different.
  • FIG. 4 illustrates a functional block diagram for one means of decoding the output signal generated by the system illustrated in FIG. 2.
  • a signal to be analyzed 80 e.g., the same output from FIG.
  • Data reduced signal 41 can then be decoded to remove the message that was watermarked in the original data reduced signal. Further, data reduced signal 41 can be subtracted from signal to be analyzed 80 to form a differential signal 61 which can then be decoded to remove the message that was watermarked in the original remainder signal.
  • a decoder may only be able to perform one of the two decodings. Differential access and/or different keys may be necessary for each decoding.
  • watermarking described in connection with this embodiment above may be done with a plurality of predetermined keys or key pairs associated with a single watermark "message bit,” code object, or text.
  • FIG. 3 illustrates a system and method of implementing a single watermark system.
  • the process and system contemplated here is identical to process described in connection to FIG. 2, above, except that no watermark is embedded in the remainder signal.
  • the watermarked, data-reduced signal 50 is added directly to the remainder signal 60 to generate an output signal 90.
  • the watermarking described in connection with this embodiment above may be done with a plurality of predetermined keys or key pairs associated with a single watermark "message bit," code object, or text.
  • FIG. 5 illustrates a functional block diagram for one means of decoding the output signal generated by the system illustrated in FIG. 3.
  • a signal to be analyzed 90 e.g., the same output from FIG. 3 is processed by a data-reduction scheme 200.
  • Data reduced signal 41 can then be decoded to remove the message that was watermarked in the original data reduced signal.
  • FIG. 6 illustrates a system and method of implementing a multi-scrambler system.
  • An input signal 12 e.g., binary executable code, instruction text, or other data
  • a lossy data-reduction scheme 400 e.g., down-sampling, bit-rate reduction, or compression method
  • Data-reduced signal 45 is then scrambled using a first scrambling technique (process step 500) to generate a scrambled, data-reduced signal 55, while a copy of the unscrambled, data- reduced signal 45 is saved.
  • the saved, unscrambled data-reduced signal (signal 45) is subtracted from the original input signal 12, yielding a remainder signal 65 composed only of the data that was lost during the data-reduction.
  • a second scrambling technique is then applied (process step 501) to remainder signal 65 to generate a scrambled remainder signal 75.
  • the scrambled remainder signal 75 and the scrambled data-reduced signal 55 are added to form an output signal 85, which is the final, full-bandwidth, output signal.
  • the two scrambling techniques may be identical (i.e., be functionally the same), or they may be different.
  • scrambling described in connection with this embodiment may be done with a plurality of predetermined keys or key pairs associated with a single scrambling operation containing only a "message bit," code object, or text.
  • unscrambling follows the exact pattern of the scrambling process except that the inverse of the sci ambling transfer function is applied to each portion of the data, thus returning it to its pie-scrambled state
  • FIG 8 illustrates a functional block diagram for one means of decoding the output signal generated by the system illustrated in FIG 6
  • a signal to be analyzed 85 (e g , the same output from FIG 6) is piocessed by a data-reduction scheme 200
  • Data reduced signal 46 can be subtracted from signal to be analyzed 85 to form a differential signal 66, which signal can then be descrambled in process 551 using the inverse transfer function of the piocess that scrambled the original remainder signal (e g , the inverse of scrambling process 501)
  • Descrambhng process 551 generates an descrambled signal 76
  • Data reduced signal 46 may further be descrambled m process 550 using the inverse transfer function of the process that scrambled the original data reduced signal (e g , the inverse of scrambling process 500)
  • Descrambhng process 550 generates an descrambled signal 56, which may then be added to descrambled signal 76 to form an
  • FIG 7 illustrates a system and method of implementing a single scrambling system
  • the process and system contemplated here is identical to process desc ⁇ bed connection to FIG 6, above, except that no scrambling is applied to the remainder signal Hence, the scrambled data-reduced signal 55 is added directly to the remainder signal 65 to generate an output signal 95
  • scrambling desc ⁇ bed in connection with this embodiment may be done with a plurality of predetermined keys or key pairs associated with a single scrambling operation containing only a "message bit," code object, or text
  • FIG 9 illustrates a functional block diagram for one means of decoding the output signal generated by the system illustrated m FIG 7
  • a signal to be analyzed 95 (e g , the same output from FIG 7) is processed by a data-reduction scheme 200
  • Data reduced signal 46 can be subtracted from signal to be analyzed 95 to form a differential signal 66.
  • Data reduced signal 46 may further be descrambled in process 550 using the inverse transfer function of the process that scrambled the original data reduced signal (e.g., the inverse of scrambling process 500).
  • Descrambhng process 550 generates an descrambled signal 56, which may then be added to differential signal 66 to form an output signal 99.
  • Another embodiment may combine both watermarking and scrambling with data reduction. Speed, performance and computing power may influence the selection of which techniques are to be used. Decisions between data reduction schemes ultimately must be measured against the types of keys or key pairs to use, the way any pseudo random or random number generation is done (chaotic, quantum or other means), and the amount of scrambling or watermarking that is necessary given the needs of the system.
  • Data signals fall into two categories: those which can undergo lossy data reduction and remain functional and those which cannot. Audio, images, video are examples of the first. Computer code is an example of the second.
  • all members of the first category contain an aesthetic component, which may be reduced and/or manipulated during a data reduction, in addition to a functional component which serves to identify the signal.
  • an audio signal may have noise added while still remaining recognizably identifiable as a particular song. However, beyond a certain point, the addition of more noise will cause the signal to become unidentifiable, thus impairing the functional character of the signal.
  • lossy compression that letains functionality is not possible
  • Signals in the first category are the only candidates for watermarking
  • a watermark is a distortion of the aesthetic component, generally of an imperceptible nature This category will gam speed benefits during the watermark decoding process when a lossy data-reduction method is used as desc ⁇ bed above
  • Scrambling may be applied to any signal, regardless of its aesthetic component, since it allows for perfect reconstruction of the o ⁇ gmal signal
  • a scrambling system can be made more secure by applying a data reduction method prior to scrambling, even if this data reduction makes the intermediate signals nonfunctional, as is the case with signals in category two
  • Data reduction can make both watermarking and scrambling more secure Data reduction can also speed the decoding process for watermarks Finally, data reduction can allow natural channelization of watermarks for different purposes

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Image Processing (AREA)

Abstract

La présente invention porte sur un procédé de protection d'un signal de données consistant à: appliquer une technique (200) de réduction de données pour réduire le signal de données; soustraire (60) le signal de données réduit du signal de données pour produire un signal résiduel (39); inclure (300) un premier filigrane dans le signal de données réduit pour produire un signal de données réduit, filigrané; et ajouter (50) le signal de données réduit, filigrané au signal résiduel pour générer un signal de sortie. Un second filigrane (301) peut être inclus dans le signal résiduel (39) avant l'étape d'addition finale (50). De plus, il est possible d'utiliser des techniques cryptographiques pour coder les signaux de données réduits et/ou les signaux résiduels avant l'étape d'addition finale (50).
EP00919398A 1999-03-24 2000-03-14 Utilisation de la reduction de donnees dans des systemes steganographiques et cryptographiques Withdrawn EP1172001A4 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US12599099P 1999-03-24 1999-03-24
US125990P 1999-03-24
PCT/US2000/006522 WO2000057643A1 (fr) 1999-03-24 2000-03-14 Utilisation de la reduction de donnees dans des systemes steganographiques et cryptographiques

Publications (2)

Publication Number Publication Date
EP1172001A1 true EP1172001A1 (fr) 2002-01-16
EP1172001A4 EP1172001A4 (fr) 2002-08-14

Family

ID=22422428

Family Applications (1)

Application Number Title Priority Date Filing Date
EP00919398A Withdrawn EP1172001A4 (fr) 1999-03-24 2000-03-14 Utilisation de la reduction de donnees dans des systemes steganographiques et cryptographiques

Country Status (2)

Country Link
EP (1) EP1172001A4 (fr)
WO (1) WO2000057643A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11562753B2 (en) 2017-10-18 2023-01-24 The Nielsen Company (Us), Llc Systems and methods to improve timestamp transition resolution

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7664263B2 (en) 1998-03-24 2010-02-16 Moskowitz Scott A Method for combining transfer functions with predetermined key creation
US6205249B1 (en) 1998-04-02 2001-03-20 Scott A. Moskowitz Multiple transform utilization and applications for secure digital watermarking
US7177429B2 (en) 2000-12-07 2007-02-13 Blue Spike, Inc. System and methods for permitting open access to data objects and for securing data within the data objects
US7159116B2 (en) 1999-12-07 2007-01-02 Blue Spike, Inc. Systems, methods and devices for trusted transactions
US7664264B2 (en) 1999-03-24 2010-02-16 Blue Spike, Inc. Utilizing data reduction in steganographic and cryptographic systems
US7475246B1 (en) 1999-08-04 2009-01-06 Blue Spike, Inc. Secure personal content server
GB2370437A (en) * 2000-12-20 2002-06-26 Motorola Inc Method for watermarking a digital image
EP1223548A3 (fr) * 2001-01-10 2004-02-11 Monolith Co., Ltd. Appareil et procédé d'intégration des données de droits d'auteur
EP1271876A1 (fr) * 2001-06-25 2003-01-02 Koninklijke Philips Electronics N.V. Appareil de transmission et méthode d'envoi
GB2377575B (en) * 2001-07-13 2003-12-03 Motorola Inc Watermarking in video transmissions
US20030063740A1 (en) * 2001-08-20 2003-04-03 Sagar Richard B. Method of providing multilevel quality signals
US7287275B2 (en) 2002-04-17 2007-10-23 Moskowitz Scott A Methods, systems and devices for packet watermarking and efficient provisioning of bandwidth
WO2003103273A1 (fr) * 2002-06-03 2003-12-11 Koninklijke Philips Electronics N.V. Codage et decodage de filigranes dans des canaux independants
FR2904903A1 (fr) * 2006-08-11 2008-02-15 France Telecom Ensemble de donnees, procede et dispositif de traitement, procede et dispositif de lecture d'un ensemble de donnees selon l'invention, programmes d'ordinateur et supports de donnees
GB2443227A (en) * 2006-10-23 2008-04-30 Sony Uk Ltd Using watermarks to detect unauthorised copies of content materials
US10885543B1 (en) 2006-12-29 2021-01-05 The Nielsen Company (Us), Llc Systems and methods to pre-scale media content to facilitate audience measurement

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4969204A (en) * 1989-11-29 1990-11-06 Eastman Kodak Company Hybrid residual-based hierarchical storage and display method for high resolution digital images in a multiuse environment
EP0651554A1 (fr) * 1993-10-29 1995-05-03 Eastman Kodak Company Méthode et dispositif pour l'addition et l'enlèvement des filigranes digitales dans un système d'enregistrement et d'extraction d'images hiérarchiques
WO1998037513A1 (fr) * 1997-02-20 1998-08-27 Telstra R & D Management Pty. Ltd. Filigranes numeriques invisibles
WO1999062044A1 (fr) * 1998-05-26 1999-12-02 The Regents Of The University Of California Integration d'une palette de reference

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5943422A (en) * 1996-08-12 1999-08-24 Intertrust Technologies Corp. Steganographic techniques for securely delivering electronic digital rights management control information over insecure communication channels
WO1997022206A1 (fr) * 1995-12-11 1997-06-19 Philips Electronics N.V. Marquage d'un signal video et/ou audio
US5889868A (en) * 1996-07-02 1999-03-30 The Dice Company Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data
US6061793A (en) * 1996-08-30 2000-05-09 Regents Of The University Of Minnesota Method and apparatus for embedding data, including watermarks, in human perceptible sounds
US6069914A (en) * 1996-09-19 2000-05-30 Nec Research Institute, Inc. Watermarking of image data using MPEG/JPEG coefficients
US5848155A (en) * 1996-09-04 1998-12-08 Nec Research Institute, Inc. Spread spectrum watermark for embedded signalling
US5809139A (en) * 1996-09-13 1998-09-15 Vivo Software, Inc. Watermarking method and apparatus for compressed digital video
US5915027A (en) * 1996-11-05 1999-06-22 Nec Research Institute Digital watermarking
US5991426A (en) * 1998-12-18 1999-11-23 Signafy, Inc. Field-based watermark insertion and detection

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4969204A (en) * 1989-11-29 1990-11-06 Eastman Kodak Company Hybrid residual-based hierarchical storage and display method for high resolution digital images in a multiuse environment
EP0651554A1 (fr) * 1993-10-29 1995-05-03 Eastman Kodak Company Méthode et dispositif pour l'addition et l'enlèvement des filigranes digitales dans un système d'enregistrement et d'extraction d'images hiérarchiques
WO1998037513A1 (fr) * 1997-02-20 1998-08-27 Telstra R & D Management Pty. Ltd. Filigranes numeriques invisibles
WO1999062044A1 (fr) * 1998-05-26 1999-12-02 The Regents Of The University Of California Integration d'une palette de reference

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JOHNSON A ET AL: "TRANSFORM PERMUTED WATERMARKING FOR COPYRIGHT PROTECTION OF DIGITAL VIDEO" IEEE GLOBECOM 1998. GLOBECOM '98. THE BRIDGE TO GLOBAL INTEGRATION. SYDNEY, NOV. 8 - 12, 1998, IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, NEW YORK, NY: IEEE, US, vol. 2, 1998, pages 684-689, XP000825846 ISBN: 0-7803-4985-7 *
See also references of WO0057643A1 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11562753B2 (en) 2017-10-18 2023-01-24 The Nielsen Company (Us), Llc Systems and methods to improve timestamp transition resolution

Also Published As

Publication number Publication date
EP1172001A4 (fr) 2002-08-14
WO2000057643A1 (fr) 2000-09-28

Similar Documents

Publication Publication Date Title
US10461930B2 (en) Utilizing data reduction in steganographic and cryptographic systems
US7123718B1 (en) Utilizing data reduction in stegnographic and cryptographic systems
US9171136B2 (en) Data protection method and device
US8095795B2 (en) Methods and apparatus for robust embedded data
EP1256086B1 (fr) Procedes et appareils de masquage de donnees multicouches
Lacy et al. Intellectual property protection systems and digital watermarking
EP1172001A1 (fr) Utilisation de la reduction de donnees dans des systemes steganographiques et cryptographiques
KR101088080B1 (ko) 미디어에 워터마크를 삽입하기 위한 시스템, 방법 및 프로세서-판독가능 기록매체
KR100746018B1 (ko) 디지털 저작권 관리를 위한 신호 프로세싱 방법들, 디바이스들, 및 응용들
KR101535694B1 (ko) 오디오비주얼 데이터의 안전한 분배 방법 및 시스템
Kirovski et al. Digital rights management for digital cinema
Ahuja et al. A survey of digital watermarking scheme
JP2000184173A (ja) 画像処理方法、装置、画像配付方法、システム及びコンピュータ読み取り可能な記憶媒体
KR100848369B1 (ko) 암호화 데이터 생성, 암호화 데이터 해독, 재서명된데이터 생성을 위한 장치와 방법
Sharma et al. Digital watermarking for secure e-government framework
KR100434252B1 (ko) 워터마크 생성 및 삽입, 디지털 컨텐츠 및 워터마크추출을 위한 장치
Bramhill et al. Challenges for copyright in a digital age
KR20020045143A (ko) 워터마킹 기술을 이용한 디지털 영상의 암호화 및 복호화방법
Petrovic Copyright protection based on transaction watermarks
DECODE ‘DIGITAL ‘ID Portion of Format

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20011023

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

RIC1 Information provided on ipc code assigned before grant

Free format text: 7H 04N 7/167 A, 7H 04N 7/26 B, 7H 04N 1/32 B, 7G 06F 17/30 B

A4 Supplementary search report drawn up and despatched

Effective date: 20020701

AK Designated contracting states

Kind code of ref document: A4

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

17Q First examination report despatched

Effective date: 20021112

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20040911