WO 98/02864
`
`PCT/US97/11455
`
`WwWBbWNBWNHFBWNHBbewwBP
`
`he
`
`17.
`
`A method of dithering watermark quantizations such that the
`
`dither changes an absolute quantization value, but does not change a
`
`quantization level or information carried in the quantization.
`
`18.
`
`Amethod of encoding watermarks comprising steps of:
`
`inverting at least one instance of the watermark bit stream; and
`
`encoding at least one instance of the watermark using said inverted
`
`instance of the watermark bit stream.
`
`19.
`
`A method of decoding watermarks comprising stepsof:
`
`considering an original watermark synchronization marker, an inverted
`
`watermark synchronization marker, and inverted watermarks; and
`
`decoding based on the considering step.
`
`20.
`
`Amethod of encoding and decoding watermarks in a signal
`
`using a spread spectrum technique to encode or decode whereinformation is
`
`encoded or decoded at audible levels and the encoding and decoding
`
`methods are pseudo-random over frequency.
`
`21.
`
`Amethod of encoding and decoding watermarksin a signal
`
`using a spread spectrum technique to encode or decode where information is
`
`encoded or decoded at audible levels and the encoding and decoding
`
`methods are pseudo-random over time.
`
`22.
`
`The method of claim 21, wherein the information is encoded or
`
`decoded at audible levels and the encoding and decoding methods are
`
`pseudo-random, over both frequency and time.
`
`23.
`
`Amethod of analyzing composite digitized signals for
`
`watermarks comprising steps of:
`
`37
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1399
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1399
`
`

`

`WO 98/02864
`
`PCT/US97/11455
`
`oOoOSIAOT&Ww
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`woefNYBAHWFFWNY
`bPHeHFBPBBWNFO
`
`obtaining a composite signal;
`
`obtaining an unwatermarked sample signal:
`
`time aligning the unwatermarked sample signal to the
`
`composite signal;
`
`gain adjusting the time aligned unwatermarked sample signal to
`
`a corresponding segment of the composite signal, determined in the
`
`time aligning step;
`
`estimating a pre-composite signal using the composite signal
`
`and the gain adjusted unwatermarked sample signal:
`
`estimating a watermarked sample signal by subtracting the
`
`estimated pre-composite signal from the composite signal; and
`
`scanning the estimated watermarked sample signal for
`
`watermarks.
`
`24.
`
`A method for varying watermark encode/decode algorithms
`
`automatically during the encoding ar decoding of a watermark comprising
`
`steps of:
`
`a)
`
`assigninga list of desired CODECstoa list of corresponding
`
`signal characteristics which indicate use of particular CODECs;
`
`b)
`
`during encoding/decoding, analyzing characteristics of the
`
`current sample framein the signa! stream, prior to delivering the frame to a
`
`CODEC;
`
`Cc)
`
`looking up the corresponding CODECfrom thelist of CODECs
`
`in step (a) which matches the observed signal characteristics from step (b);
`
`d)
`
`e)
`
`f)
`
`and
`
`loading and/or preparing the desired CODEC;
`
`passing the sample frame to the CODECselected in step (c);
`
`receiving the output samples from step (e).
`
`25.
`
`The method according to claim 24, wherein watermark signal
`
`characteristics or a watermark certificate can be compressed.
`
`38
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1400
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1400
`
`

`

`WO 98/02864
`
`PCT/US97/1 1455
`
`26.
`
`Amethodfor varying watermark encode/decode algorithms
`
`automatically during the encoding or decoding of a watermark comprising
`
`steps of:
`
`yooONYAOOW&®WwNY
`PFPPPFPPYBoO®&®WNFO
`
`
`
`a) assigningalist of desired CODECs toalist of index values
`
`which correspond to values computed as a function of the pseudo-random
`
`watermark key and the state of the processing framework;
`
`b)
`
`during encoding/decoding, computing the pseudo-random key
`
`index value for the current sample frame in the signal stream, prior to
`
`delivering the frame to a CODEC;
`
`Cc)
`
`looking up the corresponding CODECfrom the list of CODECs
`
`in step (a) which matches the index value from step (b);
`
`d)
`
`e)
`
`and
`
`loading and/or preparing the desired CODEC;
`
`passing the sample frame to the CODEC selected in step(c);
`
`f)
`
`receiving the output samples from step (e).
`
`27.
`
`The method according to claim 26, wherein watermark signal
`
`characteristics or a watermark certificate can be compressed.
`
`39
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1401
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1401
`
`

`

`INTERNATIONAL SEARCH REPORT
`
`Intemational application No.
`
`PCT/U897/11455
`
`A.
`CLASSIFICATION OF SUBJECT MATTER
`:GO9C 5/00 HO4L 9/00
`IPC(6)
`US CL
`1380/54, 3, 4, 23, 55, 283/73, 113, 17
`According to Intemational Patent Ciassification (IPC) or to both national classification and IPC
`FIELDS SEARCHED
`
`
`
`Minimum documentation searched (classification system followed by classification symbols)
`US.
`380/54, 3, 4, 23, 55, 49, SI, 59, 283/73, 113, 17
`
`Documentation searched other than minimum documentation to the extent that such documents are included in the fields searched
`
`Electronic data base consulted during the international search (name of data base and, where practicable, search terms used)
`
`Cc.
`
`DOCUMENTS CONSIDERED TO BE RELEVANT
`
`US 5,664,018 A (LEIGHTON) 02 SEPTEMBER 1997 [] Further documents are listed in the continuation of Box C.
`
`Citation of document, with indication, where appropriate, of the relevant passages
`
`Relevant to claim No.
`
`US, 5,636,292 A (RHOADS) 03 JUNE 1997
`
`US 5,617,119 A (BRIGGS ET AL.) 01 APRIL 1997
`
`US 5,568,570 A (RABBANI) 22 OCTOBER 1996
`
`US 5,530,759 A (BRAUDAWAY, ET AL.) 25 JUNE 1996
`
`US 5,493,677 A (BALOGH, ET AL.) 20 FEBRUARY 1996
`
`See patent family annex.
`
`Special categories of cited documents:
`
`later document published after the internationalfiling dete or priority
`date and not in conflict with the application but citad to understand
`document defining the generalstate of the art which is not considered
`the principle or theory underlying the invention
`to be of pastioular relevance
`document of particular relevance, the claimed invention cannot be
`earlier document published on or after the international filing date
`considered novei or cannot be considered to involve an inventive step
`when the document is taken alone
`document which may throw doubts on priority claim(s) or which is
`cited to establish the publication date of another citation or other
`special reason (es specified)
`document referring to en oral disclosure, use, exhibition or other
`means
`
` "ae
`
` °E
`
`"L«
` *0"
` op.
`document published prior to the internationalfiling date but later than
`
`the prionty date claimed
`
`
`Date of the actual completion of the intemational search
`Date of mailing of the intemmational search report
`23 OCTOBER 1997
`
`
`Authprized officer
`
`
`iiame and mailing address of the ISA/US
`Le
`Commissioner of Patents and Trademarks
`
`
`
`Box PCT
`
`DAVID CAIN
`Washington, D.C. 20231
`
`Facsimile No.
`(703) 305-3230
`
`
`Form PCT/SA/210 (second sheetXJuly 1992)*
`
`x
`
`document of particular ralevance, the claimed invention cannot be
`considered to involve an inventive atep when the document
`is
`combined with one or more other auch documents, such combination
`being obvious to a person skilled in the art
`document member of the rame patent family
`
`
`
`23 DEC 19g7
`
`elephone No.
`
`(703) 305-1836
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1402
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1402
`
`

`

`-
`
`PCT
`
`WORLD INTELLECTUAL, PROPERTY ORGANIZATION
`International Bureau
`
`
`
`INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY (PCT)
`
`
`(51) International Patent Classification 7 :
`
`
`HO4N 7/167
`28 September 2000 (28.09.00)
` (43) International Publication Date:
`
`(11) International Publication Number:
`
`WO 00/57643
`
`
`
`(21) International Application Number: PCT/US00/06522|(81) Designated States: JP, US, European patent (AT, BE, CH, CY,
`DE, DK, ES, FI, FR, GB, GR, IE, IT, LU, MC, NL, PT,
`SE).
`
`(22) International Filing Date:
`
`14 March 2000 (14.03.00)
`
`Published
`With international search report.
`Before the expiration of the time limit for amending the
`claims and to be republished in the event of the receipt of
`amendments.
`
`(30) Priority Data:
`60/125,990
`
`24 March 1999 (24.03.99)
`
`US
`
`(71) Applicant(for all designated States except US): BLUE SPIKE,
`INC. [US/US]; 16711 Collins Avenue, Miami, FL 33160
`(US).
`
`(72) Inventors; and
`(73) Inventors/Applicants (for US only): MOSKOWITZ, Scott,
`A.
`[US/US]; 16711 Collins Avenue, Miami, FL 33160
`(US). BERRY, Michael [US/US]; 12401 Princess Jeanne,
`Albuquerque, NM 87112 (US).
`
`(74) Agents: CHAPMAN,Floyd, B. et al.; Baker Botts, L.L-P., 1299
`Pennsylvania Avenue, N.W., Washington, DC 20004 (US).
`
`
`(54) Title: UTILIZING DATA REDUCTION IN STEGANOGRAPHIC AND CRYPTOGRAPHIC SYSTEMS
`
`(57) Abstract
`
`The present invention is a method for protecting a
`data signal where the method comprises the followingsteps:
`applying a data reduction technique (200) to the signal to
`produce a reduced signal, subtracting (60) the reduced data
`signal from the original signal to produce a remaindersignal
`(39), embedding (300) 2 first watermark into the reduced
`data signal to produce a watermarked redued data signal,
`and adding (50) the watermarked reduced signal
`to the
`remaindersignal to produce an output signal (90). A second
`watermark (301) may be embedded into the remainder
`signal (39) before the final addition (50) step. Cryptographic
`techniques may be employedto encrypt the remaindersignal
`
`10
`
`ORIGINAL
`SIGNAL
`
`and/or the reduced signal prior to the addition step (50).
`
`
`
`ATH DATA REDUCED SIGNAL
`
`
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1403
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1403
`
`

`

`
`
`
`FOR THE PURPOSES OF INFORMATION ONLY
`
`Codes used to identify States party to the PCT on the front pages of pamphlets publishing international applications under the PCT.
`Albania
`ES
`Slovenia
`LS
`Lesotho
`SI
`FI
`Armenia
`LT
`Lithuania
`SK
`Slovakia
`Austria
`FR
`LU
`SN
`Luxembourg
`Senegal
`Australia
`GA
`LV
`Swaziland
`Latvia
`S7,
`GB
`Monaco
`TD
`MC
`Chad
`Azerbaijan
`GE
`MD
`TG
`Bosnia and Herzegovina
`Republic of Moldova
`Tago
`Barbados
`GH
`MG
`TJ
`Madagascar
`Tajikistan
`MK
`GN
`Turkmenistan
`Belgium
`The former Yugoslav
`Burkina Faso
`GR
`Republic of Macedonia
`Turkey
`HU
`Mali
`Bulgaria
`Trinidad and Tobago
`Benin
`IE
`Ukraine
`Mongolia
`Brazil
`IL
`Mauritania
`Uganda
`Belarus
`IS
`Malawi
`United States of America
`Canada
`IT
`Mexico
`Uzbekistan
`Viet Nam
`JP
`Central African Republic
`Niger
`KE
`Netherlands
`Congo
`Yugoslavia
`Switzerland
`KG
`Zimbabwe
`Norway
`KP
`Cote d'Ivoire
`New Zealand
`Cameroon
`Poland
`China
`Portugal
`Cuba
`Romania
`Russian Federation
`Czech Republic
`Sudan
`Germany
`Denmark
`Sweden
`Estonia
`Singapore
`
`™T
`
`R
`TT
`VA
`UG
`Us
`UZ
`YN
`YU
`Zw
`
`ML
`MN
`MR
`MW
`MX
`NE
`NL
`NO
`NZ
`PL
`PT
`RO
`RU
`sD
`SE
`8G
`
`AL
`AM
`AT
`AU
`AZ
`BA
`BB
`BE
`BE
`BG
`BJ
`BR
`BY
`CA
`CF
`CG
`CH
`cI
`CM
`CN
`cu
`cz
`DE
`DK
`EE
`
`Spain
`Finland
`France
`Gabon
`United Kingdom
`Georgia
`Ghana
`Guinca
`Greece
`Hungary
`Treland
`Israel
`Iceland
`italy
`Japan
`Kenya
`Kyrgyzstan
`Democratic People’s
`Republic of Korea
`Republic of Korea
`Kazakstan
`Saint Lucia
`Liechtenstein
`Sri Lanka
`Liberia
`
`KR
`KZ
`Lc
`LI
`LK
`LR
`
`
`
`
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1404
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1404
`
`

`

`WO 00/57643
`
`PCT/US00/06522
`
`UTILIZING DATA REDUCTIONIN STEGANOGRAPHIC
`AND CRYPTOGRAPHIC SYSTEMS
`
`FIELD OF INVENTION
`
`This invention relates to digital signal processing, and moreparticularly 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 ofthe signal.
`
`BACKGROUNDOF INVENTION
`
`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 worksis invaluable. In considering the various
`forms of multimedia content, whether "master,” stereo, NTSC video, audio tape or
`compactdisc, 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 andrelated data
`into the content in such a mannerthat 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 weaknessin digital watermark technologyrelates 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 ofthe work to be protected. This weakness removes
`proper economic incentives for improvementofthe 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.
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1405
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1405
`
`

`

`WO 00/57643
`
`PCT/US00/06522
`
`Nw
`
`This paper draws a distinction between 4 “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
`consumerelectronic 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, ifpresent in the digital data stored on the “A disk,” would identify the “B
`disk” as having been copied from the “A disk.”
`On the other hand, a copy control or universal watermark is an embeddedsignal
`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 “yniversal” nature ofthe watermark is the computationally
`inexpensive means for accessing or other associating the watermark with operations that
`can include playback, recording or manipulations ofthe media in whichit 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 mstance of a suspected copying of a copyrighted media work. The more
`dedicated pirates must be dealt with by encouraging 3rd party authentication with
`“forensic watermarks” or those that constitute “transactional watermarks” (which are
`encoded in a given copyofsaid content to be watermarked as per the given transaction).
`The goal of a digital watermark system is to insert a given information signal
`or signals in such a manner as to leave little or no evidence of the presence of the
`information signal in the underlying content signal. A separate but equal goal is
`maximizing the digital watermark's encoding level and "location sensitivity" in the
`underlying content signal such that the watermark cannot be removed without damage
`to the contentsignal.
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1406
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1406
`
`

`

`WO 00/57643
`
`-
`
`PCT/US00/06522
`
`One means of implementing a digital watermarkis to use key-based security.
`A predetermined or random key can be generated as a map to access the hidden
`information signal. A key pair may also be used. With a typical key pair, a party
`possesses a public and a private key. The private key is maintained in confidence by
`the ownerofthe key, while the owner's public key is disseminated to those persons in
`the public with whom the owner would regularly communicate. Messages being
`communicated, for example by the ownerto another, are encrypted with the private key
`and can only be read by another person who possesses the corresponding public key.
`Similarly, a message encrypted with the person’s public key can only be decrypted with
`the correspondingprivate key. Ofcourse, the keys or key pairs may be processed in
`separate software or hardware devices handling the watermarked data.
`
`SUMMARYOF THE INVENTION
`A method of securing a data signal comprises the steps of: applying a data
`reduction techniqueto reducethe 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 remaindersignal, and adding said encrypted, reduced
`data signal to said encrypted remaindersignal 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; meansto 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.
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1407
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1407
`
`

`

`WO 00/57643
`
`PCT/US00/06522
`
`A method ofsecuring 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 fromthe 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 ofprotecting 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; usingafirst 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 remaindersignal, and adding said scrambled, reduced data signal
`to said scrambled remainder signal to produce an output signal.
`There are two design goals in an overall digital watermarking system's low cost,
`and universality. Ideally, a method for encoding and decoding digital watermarks in
`digitized media for copy control purposes should be inexpensive and universal. This
`is essential in preventing casual piracy. On the other hand, a more secure form of
`protection, such as a “forensic watermarks,” can afford to be computationally intensive
`to decode, but must be unaffected by repeated re-encoding of a copy control watermark.
`An ideal method for achieving these results would separate the signal into different
`areas, each of which can be accessed independently. The embedded signal or may
`simply be “watermark bits” or “executable binary code,” depending on the application
`and type of security sought. Improvements to separation have been made possible by
`enhancing more of the underlying design to meet a number of clearly problematic
`issues. 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
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1408
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1408
`
`

`

`WO 00/57643
`
`PCT/US00/06522
`
`related data reduction process). The stream of data can be digital in nature, or may also
`be an analog waveform (such as an image, audio, video, or multimedia content). One
`example ofdigital data is executable binary code. When applied to computer code, the
`present invention allows for more efficient, secure, copyright protection when handling
`functionality and associations with predetermined keys and key pairs 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 higherlevels of security
`when coupled with secure key exchange or asymmetric key generation betweenparties.
`The subsets of the data stream combine meaningful and meaninglessbits of data which
`may be mapped or transferred depending on the application intended by the
`implementing party.
`The present invention 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.
`Somedifferences may simply be in the structure of the key itself, a
`pseudo random or random numberstring or one whichalso includes additional security
`with special one way functions or signatures saved to the key. The key may also be
`made into keypairs, as is discussed in other disclosures and patents referenced herein.
`The present invention contemplates watermarks as a plurality of digitized sample
`streams, even if the digitized streams originate from the analog waveform itself. The
`present invention 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 meansto speed up watermarking encode and decode operations.
`Essentially a lossy method for data reduction yields the best results for encode and
`decode operations.
`It is desirable to have both copy control and forensic watermarks in the same
`signal to address the needs of the hardware, computer, and software industries while
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1409
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1409
`
`

`

`WO 00/57643
`
`~
`
`PCT/US00/06522
`
`also providing for appropriate security to the owners of the copyrights. This will
`becomeclearer with further explanation of the sample embodiments discussed herein.
`The present inventionalso contemplates the usc of data reduction for purposes
`of speedier and more tiered formsof security, including combinations ofthese methods
`with transfer function functions.
`In many applications,
`transfer functions (€.g.,
`scrambling), rather than mapping functions(e.g., watermarking), are preferable or can
`be used in conjunction with mapping. With “scrambling,” predetermined keys are
`associated with transfer functions instead ofmapping 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 oftiered data reduction with watermarking and scrambling
`may indeed increase overall security to many applications.
`The use of data reduction can improve the security of both scrambling and
`watermarking applications. All data reduction methods include coefficients which
`affect the reduction process. For example, when a digital signal with a time or space
`component is down sampled, the coefficient would be the ratio of the new sample rate
`to the original sample rate. Any coefficients that are used in the data reduction can be
`randomized using the key, or key pair, making the system more resistant to analysis.
`Association to a predetermined key or key pair and additional measure of security may
`include biometric devices, tamper proofing of any device utilizing the invention, or
`other security measures.
`Tests have shown that the use of data reduction in connection with digital
`watermarking schemes significantly reduces the time required to decode the
`watermarks, permitting increasesin operational efficiency.
`Particular implementations of the present
`invention, which have yielded
`incredibly fast and inexpensive digital watermarking systems, will now be described.
`These systems may beeasily adapted to consumerelectronic devices, general purpose
`computers, software and hardware. The exchange ofpredetermined keys or key pairs
`mayfacilitate a given level of security. Additionally, the complementary increase in
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1410
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1410
`
`

`

`WO00/57643
`
`-
`
`PCT/US00/06522
`
`security for those implementations where transfer functions are used to “scramble” data,
`is also disclosed.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`For a more complete understanding of the invention and some advantages
`thereof, reference is now made to the following descriptions taken in connection with
`the accompanying drawings in which:
`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 embodimentofthe present invention
`which illustrates the generation of an output signal comprised of a data-reduced,
`watermarked signal andafirst remaindersignal.
`FIG. 3 is a functional block diagram for an embodimentofthe present invention
`which illustrates the generation of an output signal comprised of a data-reduced,
`watermarked signal and a watermarked, first remaindersignal.
`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 embodimentofthe present invention
`which illustrates the generation of an output signal comprised of a data-reduced,
`scrambled signal anda first remaindersignal.
`FIG.7 is a functional block diagram for an embodimentofthe present invention
`whichillustrates the generation of an output signal comprised of a data--reduced,
`scrambled signal and a scrambled, first remaindersignal.
`FIG. 8 is a functional block diagram for decoding the output signal gencrated
`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.
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1411
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1411
`
`

`

`WO 00/57643
`
`PCT/US00/06522
`
`DETAILED DESCRIPTION
`The embodiments of the present
`understood by referring to the drawings,
`corresponding parts of the various drawings.
`
`invention and its advantages are best
`like numerals being used for like and
`
`An Overview
`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 evenvirtual reality imaging) is subjected to a first
`data reduction technique 100 to generate a first data reduced signal 20. 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 fromits 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) is subjected to an nth data reduction
`technique 109 to generate an nth data reduced signal 29. The nth data reduced signal
`29 is then subtracted from the (n-1) data reduced signal 28 to produce an n" remainder
`signal 39.
`|
`1 in
`An output signal can be generated from the system illustrated in FIG.
`numerous ways. For example, 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®data signal may optionally subjected to a watermarking technique, or even
`optionally subjected to a encryption technique, and each ofthe (n+1) signals (whether
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1412
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1412
`
`

`

`WO 00/57643
`
`.
`
`PCT/US00/06522
`
`watermarked or encrypted, or otherwise untouched) may then be added together to form
`an output signal. By way ofmore particular examples, eachofthe (n+1) signals (1.¢.,
`the n remainder signals andthe n data reduced signal) can be added together without
`any encryption or watermarking to form an output signal; or one or more ofthe (n+1)
`signals may be watermarked and then all (n+1) signals may be added together, or one
`or moreofthe (n+1) signals may be encrypted and thenall (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. E.g., if 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.
`There is only an issue ofdeciding what performance or security needs are contemplated
`when undertaking the data reduction process and choice ofwhich types ofkeys or key
`pairs should be associated with the signal or data to be reduced. 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 ofthe identity ofthe
`user or owner of the data, or some relevant identifying information.
`An example of a real world applicationis helpful here. Given the predominant
`concern, at present, ofMPEG 1 Layer 3, or MP3, a perceptual lossy compression audio
`data format, which has contributed to a dramatic re-evaluation of the distribution of
`music, a digital watermark system must be able to handle casual and more dedicated
`piracy in a consistent mannet. The present invention contemplates compatibility with
`MP3, as well as any perceptual coding techniquethatis technically similar. One issue,
`is to enable a universal copy control “key” detect a watermark as quickly as possible
`from a huge range ofperceptual quality measures. For instance, 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 ofthe 96 kHz originally referenced. By delineating
`and starting with less data, since the data-reduced signal is obviously smaller though
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1413
`
`DISH-Blue Spike-842
`Exhibit 1004, Page 1413
`
`

`

`WO 00/57643
`
`PCT/US00/06522
`
`10
`
`still related perceptually to the original DVDsignal, dramatic increases in the speed and
`survival of the universal copy contro} bits can be achieved. 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.
`Wherc the data stream is executable computer code, 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 developeror 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. By layering the security, the associated keys and key pairs can be used to
`substantially im