The abstract is missing
`
`This page was inserted by:
`
`REEDFAX
`
`7 Walnut Grove Drive
`
`Horsham PA 19044-2201
`
`Customer Service: 1-800-422-1337 or 215-441-4768
`
`Fax: 1-800-421-5585 or 215-441-6354
`
`www.reedfax.com
`
`emai|@reedfax.com
`
`
`
`Groupon, Inc.
`Exhibit 1019
`
`Ex. 1019 - Page 1 of 38
`
`Ex. 1019 - Page 1 of 38
`
`Groupon, Inc.
`Exhibit 1019
`
`
`
`This page was inserted by:
`
`REEDFAX
`
`7 Walnut Grove Drive
`
`Horsham PA 19044-2201
`
`Customer Service: 1-800-422-1337 or 215-441-4768
`
`Fax: 1-800-421-5585 or 215-441-6354
`
`www.reedfax.com
`
`emai|@reedfax.com
`
`
`
`Groupon, Inc.
`Exhibit 1019
`
`Ex. 1019 - Page 1 of 38
`
`Ex. 1019 - Page 1 of 38
`
`Groupon, Inc.
`Exhibit 1019
`
`
`
`K
`
`(awe '<»/
`
`7%
`
`U8/255649
`
`. ...i_. w..........
`_“ —.____....__._..-..._....___...____.__.____..._.
`!INliQVRMATION DISTRIBUTION AND PROCESSING SYSTEM
`
`Background of the Invention
`
`This application is a continuation in part of application Serial No. 08/224,280
`
`filed April '7, 1994.
`
`The present invention relates to method and apparatus for distributing and
`
`processing information, and more specifically relates to method and
`
`apparatus for preventing unauthorized use of information by partially
`
`encrypting such information.
`
`With the advance of electronic and communication technology, information
`
`conveyed in electronic form ("electronic content") is fast becoming the most
`
`economic and reliable way of distributing information. However, many
`
`information providers are reluctant to distribute electronic content because it
`
`is very easy to copy and use the information without authorization. In spite
`
`of the existence of copyright law, experience shows that electronic content are
`
`often copied and used without paying any royalties to copyright holders.
`
`Thus, in order to promote the use of electronic conveyance of information,
`
`means must be develop to prevent unauthorized usage and copying of
`
`electronic content.
`
`Ex. 1019- Page2o
`
`Ex. 1019 - Page 2 of 38
`
`
`
`Hark Chan; June 8, 94
`
`1 Methods have been developed to prevent unauthorized copying of electronic
`
`2
`
`3
`
`4
`
`5
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`content. Several years ago, these methods were used by many software
`
`developers. However, these copy protection methods do not find acceptance
`
`in the market place. Consequently, the majority of computer software are
`
`currently marketed without copy protection.
`
`Recently, attention has been turned towards preventing unauthorized uses.
`
`For example, several companies market "dongles," or hardware keys, which
`
`are attached to a port of a computer. A protected software would not execute
`
`in a computer without an appropriate key. Thus, the protected software
`
`could be copied but cannot be used in an unauthorized computer. However,
`
`many users found that these software and hardware keys cause much
`
`inconvenience. For example, when a user wishes to remove the software
`
`from one computer and execute the software in another computer, the
`
`associated hardware key has to be moved. So far, no mass marketed
`
`software uses hardware key to protect against unauthorized uses.
`
`Other methods have been developed to prevent unauthorized usage of
`
`electronic content. One of the methods is disclosed in U.S. Pat. No. 5,010,571
`
`issued to Katznelson. It discloses a system for controlling and accounting for
`
`retrieval of data from an optical storage medium containing encrypted data
`
`files from which retrieval must be authorized. The optical storage medium is
`
`distributed to customers at nominal or no charge. However, in order to
`
`decrypt the data files, a customer must obtain a decryption key from a remote
`
`authorization and key distribution station. As a result, unauthorized uses
`
`Ex. 1019- Page 30
`
`
`Ex. 1019 - Page 3 of 38
`
`
`
`Hark Chan; June 8, 94
`
`1
`
`2
`
`3
`
`4
`
`5
`
`7
`
`8
`
`9
`
`10
`
`1 1
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`can be prevented. A similar system is disclosed in U.S. Pat. No. 4,827 ,508
`
`issued to Shear.
`
`In Shear, the decryption key is stored in a secure device in
`
`the customer site. The secure device also stores accounting data relating to
`
`usage of the electronic content. The accounting data is periodically sent to a
`
`billing station.
`
`In the above methods disclosed by Katznelson and Shear, vast amount of
`
`distributed information is encrypted using a single key (or a small number of
`
`keys). Thus, if the decryption key is inadvertently made public, all these
`
`information can be used without paying the information providers.
`
`Naturally, information providers are reluctant to rely on these methods to
`
`distribute their valuable asset (i.e., information).
`
`Another problem with these prior art methods is that information providers
`
`cannot match the security level of encryption to the value of the information.
`
`Typically, the security of encryption is directly related to the complexity of
`
`encryption algorithm and the length of keys. The choice of encryption
`
`algorithms and the length of keys requires an analysis of the value of the
`
`information and the costs of encryption. In the methods disclosed by
`
`Katznelson and Shear, all information are encrypted using the same key.
`
`Thus, this key may not match the requirements of many information
`
`providers.
`
`A further problem of these prior art method is that the encryption algorithm
`
`is fixed at the time encrypted information is initially distributed. As the
`
`Ex. 1019- Page4o
`
`
`
`Ex. 1019 - Page 4 of 38
`
`
`
`Hark Chan; June 8, 94
`
`installed base of encrypted information increases, it becomes difficult to
`
`change the encryption algorithm. Thus, these method cannot use new
`
`cryptographic methods which may be developed in-future.
`
`Another method is disclosed in U.S. Pat. No. 5,247,575 issued to Sprague et
`
`al. It discloses that encrypted information may be electronically transmitted
`
`from a remote site to a receiving device in a customer site via wired or
`
`wireless means. It also discloses that the decryption key could be stored in a
`
`removable "key" card. The card can be inserted into the receiving device to
`
`decrypt the received and encrypted data. This method suffers the same
`
`defects described above in connection with Katznelson and Shear. In
`
`addition, this method requires a communication channel having a large
`
`bandwidth for transmitting the encrypted information.
`
`§fln__n_1_ary of the Invention
`
`Broadly stated, the invention involves a method and system for distributing
`
`and processing digital information. The digital information is separated into
`
`two portions. The first portion is a clear portion and the second (residual)
`
`portion is encrypted. The clear and the encrypted portions are sent to a
`
`processing system which decrypts the encrypted portion. The clear and
`
`decrypted portion is combined to obtain a result which is substantially the
`
`same as the original digital information.
`
`1
`
`2
`
`3
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`2]
`
`22
`
`23
`
`24
`
`Ex. 1019- Page 50
`
`
`Ex. 1019 - Page 5 of 38
`
`
`
`Hark Chan; June 8, 94
`
`In one embodiment of the present invention, the clear portion is distributed
`
`to customers at no or nominal cost. The residual portion will be stored in a
`
`central station. When a customer wishes to use the digital information, the
`
`central station encrypts the residual portion using an encryption-decryption
`
`key—p air generated at that time. The encrypted portion and the decryption
`
`key are sent to the processing system in a secure manner. As a result,
`
`different keys can be used to encrypt and decrypt the same information at
`
`different times.
`
`One feature of the present invention is that the clear portion is selected in a
`
`way to render the reconstruction of the original digital information difficult if
`
`the residual portion is not known. Thus, a customer will not be able to
`
`reconstruct the original digital information based on the clear portion. As a
`
`result, unauthorized use of the digital information is prevented.
`
`In the present invention, the information providers control the choice of
`
`encryption algorithms and keys. Further, algorithms and keys can be
`
`changed at will.
`
`These and other features and advantages of the present invention will be
`
`fully understood by referring to the following detailed description in
`
`conjunction with the accompanying drawings.
`
`Brief Description of the Drawings
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`8
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`25
`
`Ex. 1019- Page6o
`
`Ex. 1019 - Page 6 of 38
`
`
`
`Hark Chan; June 8, 94
`
`1
`
`2
`
`4
`
`5
`
`7
`
`8
`
`10
`11
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`Fig. 1 is a block diagram of an information distribution and processing
`
`system in accordance with the present invention
`
`Fig. 2 is a flow chart showing the application of the present invention to
`
`JPEG.
`
`Fig. 3 is a schematic diagram showing the application of the prese t
`
`invention to video data.
`
`E
`Fig. 4 is a block diagram of a software distribution and processingisystem of
`the present invention.
`
`Detailed Description of the Invention
`
`Fig. 1 is a block diagram of an information distribution and processing
`
`system 300 in accordance with the present invention. System 300 contains a
`
`central station 302 which is connected via a communication ].ink 303 to a
`plurality of processing units located in subscriber sites, such as uriits 310 and
`
`340. Processing units 310 and 340 are also connected to communication links
`
`306 and 307, respectively. Communication links 306 and 307 are preferably
`
`not connected to central station 302, but may be connected thereto‘ when
`
`needed. Communication links 303, 306, and 307 could be wired or wireless,
`
`remote or local, point-to-point or broadcasting.
`
`\
`
`]
`
`I Ex. 1019- Page 7of
`
`Ex. 1019 - Page 7 of 38
`
`
`
`Hark Chan; June 8, 94
`
`Digital information to be distributed is separated into clear (i.e.,
`
`unencrypted) portions and residual portions in accordance with methods
`
`described below. The residual portions are essentially the digital information
`
`with the clear portions removed. The clear portions are sent to processing
`
`units 310 and 340 via links 306 and 307, respectively. The residual portions
`
`are stored in central station 302 and will be encrypted before sending to
`
`processing units 310 and 340 upon demand. Central station 302 also takes
`
`care of various accounting and bookkeeping functions.
`
`The structure of the processing units are substantially the same. Thus, only
`
`one of the units, in this case, unit 310, will be described in detail. Unit 310
`
`contains a general processor 312 connected to a secure processor 314 through
`
`a communication link 316 (which could be wired or wireless). Secure
`
`processor 314 is connected to communication link 303 through a line 318.
`
`Secure processor 314 is enclosed by a protective mechanism so that
`
`unauthorized access (physical and electrical) to the internal circuitry can be
`
`prevented. Secure processor 314 is used to decrypt encrypted portions and
`
`temporarily store secret information (such as decryption keys and usage
`
`data). Unlike secure processor 314, general processor 312 does not have to be
`
`placed in a secure enclosure. Thus, it could be a conventional computer.
`
`In system 300, general processor 312 is used to process the unencrypted data
`
`(e.g'., decompression, filtering, and error correction) received from
`
`communication link 306 while secure processor 314 is used to process
`
`encrypted data (e.g., decryption and decompression) received from
`
`10
`
`ll
`
`l2
`
`l3
`
`14
`
`15
`
`16
`
`17
`
`19
`
`20
`
`22
`
`23
`
`24
`
`25
`
`EX. 1019-
`
`Page 8 o
`
`
`
`Ex. 1019 - Page 8 of 38
`
`
`
`Hark Chan; June 8, 94
`
`communication link 303. Secure processor 3 14 and general processor 312 can
`
`communicate with each other using communication link 316. This link does
`
`not have to he a secure communication link.
`
`Secure processor 314 preferably contains a unique device ID. This device ID
`
`is preferably permanently stored in a nonvolatile memory 319, such as a
`
`ROM. The device ID allows secure processor 3 14 to identify itself to other
`
`devices, Such as central station 302.
`
`A typical operation of system 300 is now described. Information data is
`
`’
`
`separated in residual data and unencrypted data according to methods
`
`' described below. The residual data is preferably a small percentage of the
`
`unencrypted data. Unencryptcd data 326 preferably contains an information
`
`ID 327 and a content portion 328. Content portion 328 could contains data
`
`relating to video, text, audio, or their combination.
`
`Unencrypted data 326 is sent to general processor 312 of processing unit 310
`
`through communication link 306. General processor 312 sends the
`
`information ID 327 to secure processor 314, which in turn forwards it to
`
`central station 302 via communication link 303. At the same time, the device
`
`ID stored in memory 319 is also sent to central station 302 so that it can keep
`
`track of usage and billing information. Central station 302 encrypts the
`
`corresponding residual data and sends the encrypted data to secure processor
`
`314 via communication link 303. Because link 303 is not a secure link, special
`
`methods, described below, need. to be used for central station. 302 to securely
`
`1
`
`2
`
`3
`
`5
`
`6
`
`7
`
`8
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`l6
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`Ex. 1019 - Page 9 of
`
`Ex. 1019 - Page 9 of 38
`
`
`
`Hark Chan; June 8, 94
`
`send the corresponding decryption key to secure processor 314.. Secure
`
`processor 314 decrypts the received encrypted data and combines the result
`
`with the unencrypted data so as to reconstruct the full digital information.
`
`The key used for encrypting and decrypting the encrypted data coul dbe
`
`different for each processing and communication session described above.
`
`Thus, it is more difficult for unauthorized persons to obtain the decryption
`
`key to decrypt the encrypted data. Even assuming that a few decryption keys
`
`are inadvertently disclosed to unauthorized persons, only a few pieces of
`
`information is compromised. This is different from the system disclosed in the
`
`prior art, where inadvertent disclosure of a single decryption key may
`
`compromise vast amount of information.
`
`Processing unit 310 also contains an output unit 322, which may be
`
`connected to general processor 312 or secure processor 314. Depending on
`
`the information processed, output unit 322 may be a printer, loudsp eaker,
`
`TV, or LCD display. In situations where it is not desirable to expose the
`
`reconstructed information, output unit 322 should be securely connected to
`
`secure processor 3 14.
`
`Even though Fig. 1 shows secure processor 314 as a single block, the function
`
`of secure processor 314 could be carried out in several components.
`
`For
`
`example, the device ID could be stored in a smart card 332 which is
`
`removably connected to processing unit 310. Smart card 332 should be
`
`protected from unauthorized intrusion.
`
`10
`
`ll
`
`l2
`
`l3
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`2]
`
`22
`
`23
`
`24
`
`25
`
`Ex. 1019- Page 10 of
`
`
`Ex. 1019 - Page 10 of 38
`
`
`
`Hark Chan; June 8, 94
`
`2 Methods for separating information into unencrypted and residual portions
`
`3
`
`4
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`22
`
`23
`
`24
`
`25
`
`are now described. It has been observed that information generally has a
`
`certain degree of correlation. At one extreme is information that is highly
`
`correlated. An example is video information which Consists of a series of
`
`pictures depicting time progression of a scene. Each picture typically differs
`
`slightly from an adjacent picture in the series because the time difference in
`
`the scene depicted by adjacent pictures is typically less than 0.1 second. As a
`
`result, video information contains many pictures which are substantially the
`
`same. Consequently, it is easy to construct a picture missing from the series
`
`by interpolating from the pictures prior and subsequent to the missing
`
`picture. This type of information is considered to have a high degree of
`
`temporal correlation.
`
`Video information also has another type of correlation. The spatial variation
`
`of a picture is typically very gentle. For example, if the picture is a human
`
`swimming in water, there is little variation (in terms of color and intensity)
`
`in the portion of the picture relating to water. Consequently, it may be easy
`
`to recreate a missing portion of a picture by interpolating from portions of the
`
`picture surrounding the missing portion. This type of information is
`
`considered to have a high degree of spatial correlation.
`
`At the other extreme is information for which it is difficult to create a
`
`missing portion from other portions. This type of information has a low
`
`degree of correlation. An example of this type of information is the binary
`
`10
`
` w WW Mu_“
`
`Ex. 1019- Page 11 of
`
`Ex. 1019 - Page 11 of 38
`
`
`
`Hark Chan‘, June 8, 94
`
`1
`
`2
`
`4
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`code of a piece of software. Typically, it is difficult to recreate a missing byte
`
`(or a series of missing bytes) from other bytes in the binary code.
`
`In the middle of this spectrum of correlation is text information. The
`
`structure of many languages dictates that redundant words or letters be used
`
`at predetermined positions of a sentence. Thus, it is possible to guess
`
`missing Words and letters in a sentence. For example, the grammar of the
`
`English language imposes a set of rules which includes putting the letter “s"
`
`at the end of a noun to designate plural quantity. In many sentences, the
`
`noun is not the only place where plural quantity is indicated. For example,
`
`the sentence "there are two birds" uses the word "two" to indicate the
`
`existence of more than one bird, in addition to the letter ‘'5'’ attached to the
`
`word "bird." Thus, the letter "s" at the end of the word ”bird" is correlated to
`
`the word “two" in the above sentence. Similarly, the word "are" is correlated
`
`with the word ‘‘two.''
`
`Information can also be classified according to its effect on intended uses if a
`
`portion of the information is missing. At one extreme is information which
`
`would be useless if a small portion is missing. An example is the binary code
`
`of a piece of software. A computer is unlikely to successfully execute the
`
`software if the binary code has a few erroneous bytes. This type of
`
`information is considered to be error intolerant. At the other extreme is
`
`information that degrades gracefully. For example, when noise of TV signal
`
`increases (i.e., portions of video information is missing or has erroneous
`
`values), color TV pictures often become monochrome. However, it is still
`
`11
`
`Ex. 1019- Page 12 of
`
`Ex. 1019 - Page 12 of 38
`
`
`
`Hark Chan; June 8, 94
`
`1
`Ix)
`
`3
`
`4
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`13
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`possible to watch and comprehend the TV pictures, even though they are less
`
`pleasing to the eyes. This type of information is considered to be error
`
`tolerant. Error toleration can also be different depending on spatial or
`
`temporal types of errors.
`
`It should be pointed out that even though the degree of error tolerance has
`
`some relationship to the degree of correlation of information, it does not
`
`depend solely on the degree of correlation. For example, a person typically
`
`does not tolerate a small distortion in a familiar song while may tolerate a
`
`large distortion in a new song, even though the degree of correlation of these
`
`two songs are the same. As another example, a reader is likely to tolerate a
`
`large number of missing words in a newspaper article. On the other hand,
`
`the same reader probably would not tolerate the same percentage of missing
`
`words in a poem. Thus, even though the degree of correlation of the
`
`newspaper article and poem may be the same (because they follow essentially
`
`the same grammar rules), the degree of error tolerance is different. This is
`
`because error tolerance depends, to a certain extent, on subjective
`
`considerations.
`
`In the prior art information distribution and processing systems using
`
`cryptography, every bit of information is encrypted. One aspect of the
`
`present invention is the realization that it may not be necessary to
`
`completely encrypt the information, especially when it has a low degree of
`
`correlation. This is because it is often difficult to reconstruct the residual
`
`portions based on the clear portions of information. In addition, information
`
`12
`
`Ex. 1019- Page 13 of
`
`
`Ex. 1019 - Page 13 of 38
`
`
`
`Hark Chan; June 8, 94
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`23
`
`24
`
`25
`
`that has a low degree of error tolerance may only need to be encrypted at a
`
`few critical places (e.g., the destination address of a jump op code, or the last
`
`name field of a customer database). This is because a user would not accept
`
`the information if a small portion is missing or erroneous. Thus, even though
`
`most of the information is in the clear, it is still not commercially useful if
`
`isolated portions are unavailable because they cannot be decrypted (i.e.,
`
`people are still willing to pay a high price to obtain the full information, even
`
`though they already have 99 percent of the information). Since only a small
`
`portion of information need to be decrypted, the amount of computation
`
`power required to decrypt the information is reduced.
`
`Encrypting a portion of information may also help to reduce the computation
`
`power required for other signal processing tasks. As an example, information
`
`which is massive and highly correlated (e.g., video information) is often
`
`compressed in order to reduce the amount of memory space used for storing
`
`and the bandwidth used for transmitting the information. Many
`
`compression methods make extensive use of the correlative nature of
`
`information. However, many encryption methods have a tendency to
`
`randomize information. For example, if the plain text is a string of identical
`
`letters, the encrypted text using algorithms such as DES may be a string of
`
`letters in which every letter is different. Consequently, it may be more
`
`difficult to compress the encrypted text.
`
`The word "encryption" is used broadly in the present invention to include
`
`different ways of transforming information so that it is difficult for an
`
`13
`
`Ex. 1019- Page 14 of
`
`Ex. 1019 - Page 14 of 38
`
`
`
`
`
`An example of distributing graphic images using the above described method
`
`In another embodiment of the present invention, information is encrypted in
`
`different levels of security. In this embodiment, most of the information is
`
`encrypted using a method having a low level of security (instead of no
`
`encryption, as are the embodiments described above) and a portion of the
`
`information is encrypted using a method having a high level of security.
`
`Typically, the amount of computational power needed for decryption is
`
`positively related to the level of security. Thus, information encrypted using
`
`a method having a low level of security requires less time to decrypt.
`
`is now described. Because of the rich information content of graphic images,
`
`they require a large number of bytes to digitize. Consequently, it is common
`
`to compress the digitized graphic images. One of the most popular methods
`
`is JPEG (Joint Photographic Experts Group). An application of the present
`
`14
`
`Ex. 1019- Page 15 o
`
`Hark Chan; June 8, 94
`
`unauthorized person to correctly understand the information. It includes
`
`transformation in which a key is required, such as public key and secret key
`
`encryption methods. It also includes scrambling information according to a
`
`secret algorithm without using a particular parameter which may be
`
`classified as a "key."
`
`The word "information“ is used broadly in the present invention to include
`
`data that is organized in some logical manner. Examples of information
`
`include video signal, audio signal, picture, graphic, computer software, text,
`
`database, and multimedia composition.
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`Ex. 1019 - Page 15 of 38
`
`
`
`Hark Chan; June 8, 94
`
`invention to JPEG is now described. It should be appreciated that the same
`
`principle can be applied to other methods of processing graphic images.
`
`It is known that human eye is less sensitive to color changes than to
`
`brightness changes. Thus, the chrominance component can be coded with
`
`more loss than the luminance component. For example, a widely used color
`
`scheme is CCIR 601, in which three components, Y, Cb, and Cr, are used.
`
`Under this color scheme, the Y component roughly represents the brightness
`
`of a color image, and can be used as a black-and-white version of the color
`
`image. The Cb and Cr components roughly represent the blueness and
`
`redness, respective, of the image.
`
`JPEG works best when applied to color data expressed as luminance
`
`(brightness) and chrominance components because it allows these
`
`components to be sampled at different rate (i.e., subsampling). When JPEG
`
`is used to compress an YCbCv image, a fair common choice is to use one Ch
`
`and Cr sample for each four Y samples. Each of the sampled component is
`
`discrete cosine transformed and then quantized in accordance with a
`
`quantization table. The results of quantization are compressed using either
`
`a modified Hufiman code or arithmetic coding.
`
`If color fidelity is an important element of the images, it may be sufficient to
`
`encrypt only the Cb or Cr component in order to prevent unauthorized uses.
`
`In this case, only a small portion of the digital data needs to be encrypted.
`
`1
`
`2
`
`4
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`21
`
`22
`
`23
`
`24
`25
`
`15
`
`Ex. 1019- Page 160
`
`
`Ex. 1019 - Page 16 of 38
`
`
`
`Hark Chan; June 8, 94
`
`The quantization table is stored in an JPEG file. In some situations, it may
`
`be sufficient to only encrypt the quantization table. Again, only a small
`
`portion of the digital data needs to be encrypted.
`
`Fig. 2 is a flow chart 350 showing a method of using the information
`
`distribution and processing system 300 of Fig. 1 to distribute and process
`
`graphic images in JPEG form. The JPEG data is separated into unencrypted
`
`and residual portions according to the method described above. The
`
`unencrypted portion of the JPEG file is sent to processing unit 310 through
`
`communication link 306 (step 354). For example, the unencrypted portion
`
`could be stored in an on-line bulletin board system and downloaded to
`
`processing unit 310 through a regular phone line. Alternatively, the
`
`unencrypted portion could be recorded in a portable memory medium (e.g.,
`
`floppy diskettes, tapes, or CD—ROMs) and distributed to potential customers.
`
`General processor 312 reads the information ID 327 and causes the secure
`
`processor 314 to send the information ID and its device ID to central station
`
`302 (step 356). Central station 302 then encrypts the residual portions and
`
`sends the encrypted portion (e.g., quantization table) to secure processor 314.
`
`Central station 302 also sends the decryption key to secure processor 314
`
`using one of the well known secure communication protocols (step 358).
`
`Secure processor 314 decrypts the data and causes general processor 312 to
`
`send the unencrypted JPEG portion thereto for generating a complete image
`
`(step 360). The image is sent to the output unit 322 for display (step 362).
`
`1
`
`2
`
`3
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`16
`
`Ex. 1019- Page 170
`
`Ex. 1019 - Page 17 of 38
`
`
`
`
`
`Hark Chan; June 8, 94
`
`Fig. 3 is a diagram showing one embodiment in which information having a
`
`high degree of correlation, such as video information 110, is processed with
`
`an information distribution and processing system of the present invention.
`
`Only three frame 1 12, 1 14 and 116 of video information 1 10 are shown,
`
`although video information 1 10 typically contains a large number of frames.
`
`Frames 112, 114, and 116 each has a centrally located region 122, 124, and
`
`126, respectively, which are of similar size and shape. Only these regions are
`
`encrypted while the rest of the frames are in the clear. The area of each of
`
`these regions is preferably small compared to the size of a full frame.
`
`Video information 110 is separated by a signal processor 120 into modified
`
`video information 150 and central region information 130. The three frames
`
`1 12, 1 14, and 116 of the video information 110 are transformed into three
`
`frames 152, 154, and 156, respectively, of modified video information ‘150.
`
`Frames in the modified video information 150 do not contain information in
`
`the centrally located regions 162, 164, and 166 (which correspond to centrally
`
`located regions 122, 124, and 126, respectively). On the other hand, the
`
`frames 132, 134, and 136 in the central region information 130 contain only
`
`information relating to the centrally located regions 122, 124, and 126.
`
`In the method of the present invention, only the centrally region information
`
`130 needs to be encrypted while the modified video information 150 can stay
`
`in the clear. The modified video information 150 is sent to general processor
`
`170, which corresponds to general processor 312 of Fig. 1. The central region
`
`information 130 is sent to secure processor 140, which corresponds to secure
`
`17
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`22
`
`23
`
`24
`
`25
`
`Ex. 1019- Page 180
` ..M
`
`Ex. 1019 - Page 18 of 38
`
`
`
`Hark Chan; June 8, 94
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`8
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`processor 314 of Fig. 1. The secure processor 140 decrypts the encrypted
`
`frames 132, 134, and 136 and combine them with frames 152, 154, and 156 to
`
`reconstruct the video images. These images are displayed by a display unit
`
`142, which corresponds to output unit 322 of Fig. 1. In order to prevent
`
`unauthorized recording of the analog signal, it may be desirable to include a
`
`system of analog copy protection 144 in secure processor 140.
`
`In this embodiment, substantially the same region of all the frames (i.e.,
`
`frames corresponding to all times from beginning to end) are encrypted.
`
`Thus, it is not possible for an unauthorized person to take advantage of
`
`temporal correlation to reconstruct the centrally located regions because
`
`there is no basis to perform interpolation. It is also difficult to take
`
`advantage of spatial correlation near the center of the frame because there is
`
`little unencrypted data available at areas surrounding the center.
`
`Stated in a slightly different way, the method disclosed above encrypts
`
`substantially all the correlated portions of the information. Since almost
`
`none of the correlated portions are in the clear, it is impossible to bypass the
`
`correlated portions by using techniques such as interpolation.
`
`The size of the regions 122, 124 and 126 depends on the degree of error
`
`tolerance. If spatial error tolerance is low (i.e., a user will not tolerate even a
`
`small amount of erroneous spatial information), the size of the regions 122,
`
`124 and 126 could be small. Further, for situations where temporal error
`
`tolerance is low, it is not necessary to encrypt all the frame.
`
`18
`
`Ex. 1019- Page 190
`
`
`Ex. 1019 - Page 19 of 38
`
`
`
`Hark Chan‘, June 8, 94
`
`The reason for positioning the encrypted region at the center is to take
`
`advantage of the fact that the most informative area of a picture is usually
`
`the center. It may be advantageous to encrypt several regions (instead of
`
`only one centrally located region). This is because the most informative
`
`region in some cases may not be located at the center. Further, the size and
`
`shape of the encrypted regions may vary from frame to frame, as long as
`
`information relating to these sizes and shapes is transmitted to secure
`
`processor 140. As a result, secure processor 140 is able to reconstruct the
`
`video frames.
`
`The encrypted region can also be selected using statistical methods. For
`
`example, the correlation within and between frames can be determined by a
`
`correlation coefficient r defined as
`
`r = E [Oi-a)(Y—b)] /uv;
`
`where X and Y are jointly distributed random variables with means a and b
`
`and variances u2 and V2, respectively. A region is selected for encryption
`
`when the corresponding correlation coefficient is higher than a certain value.
`
`Various statistical methods for determining appropriate selection criteria are
`
`well known in the art. These statistical methods can be used by signal
`
`processor 120.
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`ll
`
`12
`
`13
`
`14
`
`I5
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`19
`
`Ex. 1019 - Page 20 o
`
`
`
`Ex. 1019 - Page 20 of 38
`
`
`
`Hark Chan; June 8, 94
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`Fig. 3 indicates that adjacent frames of video information 110 have the same
`
`format and contain the same type of information. However, the system
`
`shown in Fig. 3 is also applicable to video information in which adjacent
`
`frames have different formats. An example is MPEG (Motion Picture
`
`Experts Group), which contains JPEG-like frames along with information for
`
`interpolating other frames between the JPEG-like frames. The interpolating
`
`information is different from the JPEG-like frames. In one embodiment o
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ Charge
Still Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site
