CN1214383C - Protecting content from illicit reproduction - Google Patents
Protecting content from illicit reproduction Download PDFInfo
- Publication number
- CN1214383C CN1214383C CN01800849.6A CN01800849A CN1214383C CN 1214383 C CN1214383 C CN 1214383C CN 01800849 A CN01800849 A CN 01800849A CN 1214383 C CN1214383 C CN 1214383C
- Authority
- CN
- China
- Prior art keywords
- section
- data set
- data
- sections
- chained address
- 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.)
- Expired - Fee Related
Links
Images
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
- 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
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/00166—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving measures which result in a restriction to authorised contents recorded on or reproduced from a record carrier, e.g. music or software
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/00681—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving measures which prevent a specific kind of data access
- G11B20/00695—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving measures which prevent a specific kind of data access said measures preventing that data are read from the recording medium
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/00884—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving a watermark, i.e. a barely perceptible transformation of the original data which can nevertheless be recognised by an algorithm
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0064—Image watermarking for copy protection or copy management, e.g. CGMS, copy only once, one-time copy
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Multimedia (AREA)
- Storage Device Security (AREA)
- Editing Of Facsimile Originals (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
- Image Processing (AREA)
- Facsimile Image Signal Circuits (AREA)
Abstract
A sufficient number of data items are selected (112) for inclusion in a data set so as to discourage a transmission of the entire set over a limited bandwidth communications path (130), such as the Internet. Each data item comprises one or more sections, which taken together constitute the complete data set. Each section of the data set is linked to another section of the data set, and each section's link is bound to the section via the use of one or more watermarks. Upon presentation of material for rendering, the presence of the entirety of the data set is verified (126) by ascertaining the presence of linked-to sections. For further security, the links between sections is formed by a random selection of each linked-to section. To verify that each linked-to section corresponds to the original section that was linked-to, each link contains an identifier of the linked-to section that can be used to determine that a retrieval of a linked-to section corresponds to the originally assigned linked-to section. If the identifier associated with the linked-to section does not properly match the presented linked-to section, a rendering of the data items of the data set is prevented. In a preferred embodiment, a closed linked list is formed, so that every section of the data set can be included in the verification process, if desired.
Description
Technical field
The present invention relates generally to consumer electronics field, and relates in particular to the protection to the content material of duplicating secure.
Background technology
The illicit distributions of copyright material has been seized the legitimate royalties of copyright ownerL copyrighted material's owner to this material, and encourages it to proceed illicit distributions for supplier's offer of advantages of this material of illicit distributions.Because the Internet can provide information transfer flexibly, so will be carried out the content material of copy protection, art recurring or other material of limited circulation right for example is easily by large-scale illicit distributions.The MP3 format that is used for storing and shift the audio file of compression has made the distribution on a large scale of audio sound-recording practical, because the digital audio recordings of 30 or 40 megabyte of a first song can be compressed into the mp3 file of 3 or 4 megabyte.Use the general 56kbps dial-up connection to the Internet, this mp3 file just can download on the user's computer in a few minutes.Therefore a malice clique can read song from a legal CD of master, and this song is encoded into MP3 format, and the song behind the MP3 coding is put into carries out large-scale illicit distributions on the Internet.Perhaps malice clique can provide one directly to dial in service and be used for downloading song behind the MP3 coding.The illegal copies of this song behind the MP3 coding can be subsequently by software or hardware device regeneration, and maybe can being extracted contracts is stored in recordable CD upward so that reset on common CD player.
The duplicating of content material that a plurality of schemes limit duplicating secure proposed.Secure Digital Music Initiative advocates (SDMI) and other scheme is advocated the content material that mandate is discerned in use " digital watermarking ".The EP 0981901 " Embedding auxiliary data ina signal (embedding auxiliary data in signal) " that announces on March 1st, 2000 discloses a kind of technology of watermark electronic material.Be similar to its paper watermark copy, digital watermarking is embedded in the content material so that detect, but it is unshowy.For example an audio playback that comprises the digital musical recordings of watermark will can't be distinguished basically with a playback that does not comprise the identical disc of watermark.Yet a watermark detection equipment can be based on having or not watermark to distinguish this two discs.Since some content material may not be duplicating secure and therefore may not comprise watermark, so there is not watermark can not be used to distinguish legal and illegal material.Otherwise, do not have watermark to represent that content material can be copied legally by freedom.
Other duplicating secure scheme also can obtain.For example be published in the European patent EP 0906700 " Method and system for transferring contentinformation and supplemental information related thereto (shifting the method and system that content information reaches relevant side information) " on April 7th, 1999, propose a kind of technology of protecting copyright material by the watermark " ticket " of using the protected material regeneration number of times of may command.
Adding accurately duplicating of watermark material can make this watermark be replicated in this adds the copy of watermark material.Yet adding in the out of true of watermark material or the lossy lossy copy that is replicated in this material to provide duplicating of this watermark.Those a plurality of protection schemes that comprise SDMI have utilized lossy feature of duplicating to come based on having or not correct watermark to go to distinguish legal and illegal material.In the situation of SDMI, two kinds of watermarks have been defined: " robust " watermark and " fragility " watermark.Robust watermarking is meant to be estimated afford to stand lossy a kind of watermark of duplicating, and it is designed to keep the essential part of original content material, for example the MP3 of audio record coding.In other words, this original disc if the sufficient information of duplicate reservation allows reasonably to regenerate, this robust watermarking also will remain so.On the other hand, fragile watermark is meant that the expectation meeting duplicated or watermark that other illegal infringement is destroyed by lossy.
In the SDMI scheme, have robust watermarking just to represent that this content material is a duplicating secure, and when robust watermarking, corresponding fragile watermark does not exist or suffers to destroy and just represent that this duplicating secure material is damaged in some way.The SDMI compatible equipment can be configured to refuse to containing the watermark or have the material of can detected robust watermarking but lacking fragile watermark to regenerate of going to pot; unless prove the destruction of watermark or do not exist to be well-founded by " SDMI-evaluation " process, the SDMI compression of the duplicating secure material that for example on portable player, uses.For ease of reference and understanding, here the term of Shi Yonging " regeneration " comprises any processing or the transfer of the content material that resembles broadcast, recording, conversion, checking, storage, loading or the like.This scheme is used to limit the distribution through the content material of MP3 or other compress technique, but can not influence the distribution of the forgery of content material, change (compression) duplicate.This limited protection be considered to commercial be feasible can stop because download cost and the inconvenience that an extremely big file obtains a first song the not theft of compressed content material.
Summary of the invention
The objective of the invention is and to expand to comprise the not protection of compressed content material the protection of duplicating secure material.For this reason, the invention provides as what define in the independent claims and a kind ofly be used to find the method for stealing, a kind of coding method, a kind of storage medium, a kind of encoder.Advantageous embodiment is defined in the independent claims.
Being used to be included in data by the data item of selecting enough numbers concentrates and can stop whole data set to transmit on the band-limited communication path of for example the Internet.Each data item comprises one or more sections, and all sections are formed this complete data set.Each of data set section is linked to another section of this data set, by using one or more watermarks the link of each section is bundled on this section.When providing material and be used to regenerate, the existence of check data collection integrality by the existence of confirming the section of being linked to.For further safety, form intersegmental link by selecting each section of being linked at random.In order to check each section of being linked to corresponding with the original segment that is linked to, each link comprises that is linked to a segment identifier, is used to judge that the reproduction of the section of being linked to is corresponding with the section of being linked to of initial allocation.If the identifier that is associated with the section of being linked to can not correctly mate the current section of being linked to, then the regeneration of the data item of data set is prevented from.Each of data set in a preferred embodiment, if desired, then form a closed lists of links, so that section can be comprised in the checkout procedure.
According to a first aspect of the invention, a kind of method of stealing content material that stops is provided, comprise: assemble a plurality of data item of forming this content material, to form a data set that size is enough big, to stop the subsequent transmission of this data set by the finite bandwidth communication channel, each data item in the described data item comprises one or more sections, form a plurality of sections that form this data set thus, a chained address distribute in described a plurality of sections each the section, distribute to first section the chained address with described a plurality of sections in second section be associated, so that detect not the existing of integrality of this data set subsequently by the chained address of determining to be associated with a section, a wherein said section is not present in this data centralization.
According to a second aspect of the invention, a kind of method to decoding from the content material in source is provided, comprise: receive and the corresponding data item of data set, and therefrom produce the regeneration of selecting data item corresponding to one, each data item in the described data item comprises one or more sections, form a plurality of sections that form this data set thus, each section in described a plurality of sections comprise a corresponding chained address of another section with this data set and according to described a plurality of sections in the existence of corresponding one or more other sections in chained address of one or more sections get rid of and the corresponding regeneration of this selection data item.
According to a third aspect of the invention we, a kind of scrambler is provided, comprise: a selector switch, it is configured to select to form the data item of a data set, make the accumulated size of this data set be enough to stop through this data set of finite bandwidth traffic channel, each data item in the described data item comprises one or more sections, a bundled device, it is configured to the chained address is associated with each section of the data item of forming this data set, first section chained address is corresponding to second section of the data item of forming this data set, with a register, it is configured to write down each section and medium is arrived in each chained address that is associated, so that detect not the existing of integrality of this data set subsequently by the chained address of determining to be associated with a section, a wherein said section is not present in this data centralization.
According to a forth aspect of the invention, a kind of demoder is provided, comprise: a regenerator, it is configured to receive the data item corresponding to a data set, and therefrom produce corresponding to the regeneration of selecting data item, each data item in the described data item comprises one or more sections, form a plurality of sections that form this data set thus, each section in described a plurality of sections comprises a chained address, second section of first section chained address and this data set is associated, and integrity checker, operationally be coupled to this regenerator, this integrity checker is configured to: by the chained address of determining to be associated with a section, based on the non-existent detection to the integrality of this data set, eliminating is corresponding to the regeneration of selecting data item, and a wherein said section is not present in this data centralization.
Description of drawings
By example and with reference to the accompanying drawings, will be further explained in detail the present invention, wherein:
Fig. 1 shows one according to the example system that is used to protect the duplicating secure content material of the present invention;
Fig. 2 shows one and is convenient to the sample data structure whether decision data collection integrality exists according to of the present invention;
Fig. 3 shows one and is convenient to whether decision data collection integrality exists and check data is concentrated the example optional data structure of section according to of the present invention;
Fig. 4 shows one according to the example optional data structure of being convenient to according to the existence of statistics degree of certainty decision data collection integrality of the present invention.
In these accompanying drawings, characteristic same reference number TYP or corresponding or function.
Embodiment
For the ease of understanding, the present invention herein provides in the environment of the song of digital recording.As conspicuous to a technician in this area, the present invention is applicable to that any expectation will be by the recorded information of band-limited path transmission.For example, single content material item can be a data recording in the big database, rather than a song book.
The value of usurping by the time ratio that makes theft consume is more or make it more inconvenient, can stop the theft to an item.For example, (bolted-down) proof box of bolt often is used to protect little value article, usually will be above stealing the income that this proof box expectation obtains because steal the needed effort of this proof box.Micheal Epstein submitted to March 28 calendar year 2001; sequence number is 09/537; 815; attorney docket is the common unsettled U.S. Patent application " Protecting Content from Illicit Reproductionby Proof of Existence of a Complete Data Set (content from illicit reproduction is protected in the existence by the checking complete data set) " of US000035 (disclosure 709999B); data item is selected and bundled to instruction to the enough big data set of size, transmits by the band-limited communication system of for example the Internet to stop this data set.The binding of this common pending application instruction data centralization data item will comprise the watermark of data set integrity parameter and this watermark is embedded in each section of each data item and carry out by creating one.This common pending application also is taught in the specific parameter (for a random number of each section distribution) of the section of comprising in the watermark.
The information that the common pending application instruction of this reference uses " being with outer data " to go to comprise this integrity parameters or can be used for judging integrity parameters.Duan Shuiyin is compared with this integrity parameters to guarantee that they are the same sections that are used to create data set and this integrity parameters.In order to make the possibility minimum of forgery, the hash that the integrity parameters section of being based on unique identifier is synthetic.The common pending application of this reference is also instructed and is used digital signature and other to depend on the technology of cryptographic technique, as hashing etc.
According to the present invention, be used at this data set that refers to certainly so that judges the integrality that whether has data set, be with outer data and cipher function and do not use, as hash function.If data set integrity does not exist, then the processing to the data set data item subsequently is terminated.In the environment of digital audio frequency recording, under the condition that lacks complete CD content, the playback of a compatibility or sound pick-up outfit are configured to refuse to regenerate an independent song.Download on the CD the not required time of full songs collection of compressed digital form, even with the speed of DSL and cable modem, estimating also can be greater than one hour, and this depends on the load and the other factors of network.Therefore, by requiring to provide the complete content of CD, be download " cost " to surpass one hour, the theft song has reduced basically by the possibility of the Internet widespread distribution.
Fig. 1 shows the example block diagram according to protection system 100 of the present invention.This protection system 100 comprises a scrambler 110 that content material is encoded to medium 130; Demoder 120 from medium 130 these content materials of regeneration.Scrambler 110 comprises that 112, one of the selector switchs of a chosen content material from the SRC of source are used to set up the bundled device 116 of integrity check structure, and one records register 114 on the medium 130 with content material.Selector switch 112 for example possible configuration is selection and the corresponding content material of song of having compiled a song book.Convenient for reference, each selected content material item is known as " data item ", and the integral body of data item forms one " data set ".Each data item comprises the one or more data segments that form this data item, all formation " data set " again of this data segment.Bundled device 116 is created a data structure of being made up of " data set " intersegmental link, but the integrality by its check data collection.Preferably, by using one or more watermarks, each section link is bound to this section.Use the ordinary skill in this area, register 114 just can be suitably this information format, encode and store on the medium 130.
According to the present invention, selector switch 112 selects to be added into the data item of data set, is considered to enough greatly up to the size of this data set, can stop this data set afterwards by band-limited traffic channel.This " prevention size " is the numerical value of a subjectivity, and will depend on the available communication bandwidth of hypothesis, loss that transmission causes or the like.Also can use other standard to determine whether increasing extra data item to this data centralization.For example, if data item corresponding to the song in the existing song book, then no matter whether the size of this data set has surpassed determined prevention size, and is typically added all songs to this data centralization.If all songs in this song book are selected and do not reach the standard that stops size, then other data item is selected reaches required prevention size with accumulation.For example, in order to increase length, the data item that comprises the random data bit may be added into data centralization.These random bits as the outer data of band, CD-ROM data or the like storage, are regenerated as audible sounds by common CD player to prevent it usually.Perhaps, other the sample song that provides for the sale of encouraging other song book relevant with this record content material, picture and video fragment may be provided this data item.Equally, other promote material, and for example the Internet inserts pre-booking process and also can be included in the recorded information on the recording medium.According to the present invention, make data set increase these or alternate manner of size, be conspicuous for the those of ordinary skill of this area.
According to the present invention, demoder 120 comprises a regenerator 122 and the door 124 by integrity checker 126 controls.This regenerator 122 is configured to read equipment from medium, for example retrieve data in the CD reader 132.As more common ground in this area, regenerator 122 comes retrieving information by specifying a location index, and to its response, reader 132 provides the data that are positioned at assigned address index place on the medium 130.The one-tenth piece of data reads the influence that is subjected to appointed positions index and block size on the continuous position of medium 130.
Dotted line among Fig. 1 has illustrated the song extraction apparatus 142 of an example, and it extracts songs from medium 130, and it is passed to the CD imitator 144 of example, and the latter represents the possible the Internet illegal download song of passing through.These CD imitator 144 typical examples are as a software program, and it provides information in response to common CD read command.In addition, the information that receives from the song extraction apparatus can be written into the CD medium and offer traditional CD reader 132.Emphasize that as top because the large scale content that hypothesis is had a mind in the medium 130 makes the transmission of whole contents of medium 130 be prevented from, so this song extraction apparatus 142 is used probably.
According to the present invention, integrity checker 126 is configured to typically obtain data to judge whether whole data set exists from medium 130 by regenerator 122.
Fig. 2 has illustrated and has been used for the sample data structure 200 of store data items in data centralization that it is convenient to judge whether the integrality of raw data set exists.The structure of track 210 and section 220 is illustrated, and this storage organization with traditional CD and other storage medium is consistent.As shown in, each track T210 comprise varying number the section S220.In this sample data structure 200, each section S220 comprises the link 230 of another section S in the data structure 220.In preferred embodiments, the link 230 of each section 220 is based on the selection at random of available other link.First of track T0 place section S (0,0) for example, promptly section S (0,0) 220a has one " link " section S (1,1) to track T1 place, i.e. the associated link La230a of section S (1,1) 220f.This section 220f has an associated link Lf230f who is linked to the section (m, 0) at track Tm place.In preferred embodiments, link forms a closed lists of links, makes to run through closed loop of data set formation from being linked to link.When selection course at random when each section of being linked to advances past data set, first section of the reception section of being linked at random (in this example, section S (0,0) 220a) is held standby and distributes obtainable a section of selection at random to each section of being linked to.When all sections were assigned with as the section of being linked to, first section was assigned with the section of being linked to as back segment.For example, (1, n1) last section of being linked to of 220h representative data collection 200, and its section of being linked to Lh230h is first section S (0 to section S in the sample data structure 200 shown in Figure 2,0) 220a, thus constitute the closed lists of links of all sections 220 of this data set 200.To advance past the integrality of data set 200 and the mode check data collection 200 of checking each section of being linked to exist through link L230.Increased by the difficulty that a Random Links tabulation is provided, creates the forgery shortening tabulation that comprises a first full songs.In order to prevent to link substituting of distribution, the link L230 of each section 220 preferably is encoded to the mixing of robust and crisp fragile watermark, for example be linked to orbit number and be encoded into robust watermarking, and the section of being linked in this track is encoded into fragile watermark.As noted above, robust watermarking is exactly that its removal can cause the basic infringement of the data that it is embedded or the watermark of destruction, and embedded data are modified or delete the watermark that (as being compressed) can cause its infringement or destruction if fragile watermark is exactly it.
Fig. 3 shows the example optional data structure 300 being convenient to further to check lists of links and each section of being linked to also not to be modified or substituting.In data structure 300, a random number R (T, S) 332 each section S220 that are assigned to each track T210, as in the common pending application of this reference, and the random number of the section of being linked to of each section R (L) 336 also is assigned to each section S220.When linking 230 when running through at random closed lists of links through what be associated with section 220, (T S) 332 compares with random number R that the section of being linked to is located with the random number R (L) 336 of the section of being linked to of this distribution.These random numbers also are encoded as the watermark that embeds section 220.Preferably, these numbers are encoded as fragile watermark, because the resource that fragile watermark consumes lacks than robust watermarking, and fragile watermark is to modification (as the compression) sensitivity of its embedded segment data.For the present invention, it is conspicuous that other of robust and fragile watermark arranged a those of ordinary skill for this area.Similarly, can use in each section other method of creating identifier, as a number is put in the section, and the functional value that will count is put into its section of being linked to.
At this, embodiment comes into question and is used to create the sample data structure 300 of Fig. 3.The data item accumulation, is for example downloaded from the Internet to such an extent as to can stop through band-limited traffic channel data set to form enough big data set.When each data item was selected, each section of forming this data item was assigned to a random number that is used to identify this section, and its size is added to the accumulated size of this data set.Behind the data set of a sufficient size of accumulation, as discussed above, the closed at random lists of links of the section of this data set is created.Create one or more watermarks for each data segment, comprise random number, the section of being linked to of distributing to this section and the random number of distributing to the section of being linked to.As mentioned above, the combination of robust and fragile watermark is preferably used for the information coding to related each section.This section and its embed watermark are recorded to recording medium, on a CD.
At this, the embodiment that the existence that depends on data set integrity comes the data item of playback of data collection is discussed, use the existence of the sample data structure 300 decision data collection integralities of Fig. 3.For example suppose the watermark of material or other mark after testing, reclaim equiment has detected the existence of duplicating secure material.Beginning section S is preferably selected at random.The watermark of beginning section S is read.This watermark comprises the chained address of a track designation and another section segment number, and comprises the random number that is associated with the section at place, chained address.The watermark of the section of being linked to is read.This watermark comprises the random number that is assigned to the section of being linked to, and its chained address and the random number that is associated.Be comprised in making comparisons in the beginning section with related random number of the section of being linked to and the random number that is comprised in the section of being linked to.If random number is unequal, then the regeneration with aftertreatment such as song of data centralization data item is terminated.As above mentioned, other link identifiers technology also can be used, and as random number being deposited in the section, and the function that will count such as hash function deposit in this section of being linked to.If use an alternative encoding scheme, then relatively will make corresponding modification.
If segment identifier is found to be of equal value, then handles by advancing to the section of being linked to and continue.Above-mentioned segment identifier coupling continues as each section of being linked to subsequently carries out, up to obtaining the enough assurance that relevant data collection integrality exists.In the present embodiment, absolute belief can obtain for initial beginning section up to the section of being linked to by continuation, and this shows that the all-links in the closed lists of links is processed.Yet it is consuming time reading each watermark, and a large amount of time-delays before the first song of regenerating are difficult to accept to the consumer.In a preferred embodiment, after successfully mating, some random numbers get started the regeneration song.Thereafter, if regenerative system can require to read information from medium quickly than this material of regeneration, then the Fu Jia section of being linked to watermark is read out and checks, and if and when an erroneous matching is found then stop regenerating.
For the present invention, other structure and respective coding and decoding processing are conspicuous to a those of ordinary skill of this area.Fig. 4 shows the optional data structure 600 that the use section of being linked at random comes check data collection integrality to exist.In Fig. 4, each section 620 has the section of being linked to that an is associated L634 and a random number R that is associated 636.In the optional embodiment of this example, the section of being linked to 620 ' has a finger to get back to by the be linked to section L634 ' of link from section 620.Just, being linked to address L634,634 ', to form the link of section 620,620 ' right.In the notebook data structure, public random number R 636 sections of being assigned to 620,620 ' link each right section.For whether decision data collection integrality exists, equal the mode of random number at its section of being linked to place with the random number of checking each section, the section that test is selected at random.Scope or approximate range in this supposition sector address can determine that making first " select section at random " is the section implemented on the recording medium.For example, the Media Contents table can be used for judging can implement the track address, supposes that this contents table has the fragile watermark of an embedding, or other safety equipment, and then they are used to judge the legitimacy of contents table.If scope can not determine, then first at random the section of selection will from track, be selected be used for regeneration.By this way, if a malice clique uses song extraction apparatus 142 (Fig. 1) " to tear " a first song from CD, and through the Internet with the compression or incompressible form transmit it, then link check will cause: concentrate any link in the song section of another first song inner segment for being linked to raw data, do not respond from be " track-section is found " of CD reader 132 or CD imitator 144.If respond this check request, imitator 144 substitutes forges section, and then this forgery section will not comprise suitable random digit watermark, and integrity checker 126 is torn prevention the further regeneration of song.
No matter whether selected song is used to produce first section that is used to check, can obtain the absolute of all sections existence and determine by keeping one tested section tabulation, and check continues up to all sections-to through test.The scope of this method hypothesis sector address can be determined or estimate, to such an extent as to blocking of data set can be detected.Be used to start under the situation of check in selected song, the scope of sector address is supposed continuously by the chained address scope in the selected song.For example, if one of them chained address section of being 9, track 10, then will to track 10 0 to 9 each the section test, and the check track 0 to 10 the section 0.For present disclosure, the technology that these and those are used to fill in the region of search is conspicuous to a those of ordinary skill of this area.
In preferred embodiments, influence relevant data collection integrality and exist to judge the required time in order to minimize, random section to tested up to obtaining enough assurance to prove this judgement in conjunction with basic reliability of statistics.Just, for example, only when half data set physical presence, in the overall range of all sections, select first section at random, may detect that this section does not exist in 50% time; If this section exists, then the possibility of its section of being linked to existence is 50%.Therefore, the pairwise testing of a success can provide 75% the assurance that at least one half data collection is existed.Each continuous test increases degree of confidence or increases the desired proportion that data set exists, and perhaps the both increases.Statistical test can be used for usually judging that the pairwise testing of suitable number is to obtain the expectation degree of confidence that relevant given data set partly exists.In typical embodiments, select right check to be considered to be enough to the existence of decision data collection integrality or do not exist at random at least 5.
The front only shows bright principle of the present invention.Therefore be appreciated that those skilled in the art can design various arrangements, although do not describe clearly or show these arrangements at this, their imbodies principle of the present invention and thereby within the spirit and scope of the present invention.For example, to be recorded each part of material be the part of data set to the explanation of the above-mentioned example.In optional embodiment, for the purpose of efficient, selection can be used to form the data item or the data item part of data set.For example, the song afterbody is not the part of " data set " that define here, because for each redundant copies of each watermark or watermark, watermark processing may be based on a fixing piece size.For example, if watermark or other parameter need a record of 10 seconds reliably to embed, then the remainder of ((length of song) mould (10 seconds)) will record on the medium, but not be included in " data set " of having checked integrality.In a similar manner, the material of some promotion may be included in the recording medium, but deliberately gets rid of from data centralization, and it just can arbitrarily be copied and regenerate elsewhere like this.The process flow diagram that also is noted that example provides for the ease of understanding, and specific equipment and sequence of steps are used for explanation.For example, simply equate to be illustrated in the conforming decision block determining, but rely on the particular technology of this parameter that is used to encode or decode, about whether reading and being determined the assessment that item conforms to and comprising various pilot process.These processes may comprise, for example, decode to determine whether " enough approaching " arrives consistent degree of meaning or the like to two values based on the item of particular key, fuzzy logic or statistical test.For the present invention, be conspicuous such as a those of ordinary skill in the transfer pair this area of these and other, and they are included in the scope of following claim.In the claims, any reference symbol of placing in round bracket will not be considered to limit this claim.Word " comprises " other element do not got rid of outside listing in the claim or the existence of step.Enforcement of the present invention can be carried out by means of the hardware that comprises several independent elements, also can carry out by means of programmed computer suitably.In enumerating the equipment claim of several devices, can with same hardware branch realize these the device in several.The fact of narrating in the dependent claims that differs from one another does not show and cannot benefit with the combination of these methods someway.
Claims (24)
1. one kind stops the method for stealing content material, comprising:
A plurality of data item (210) of assemble forming this content material forming a data set that size is enough big, are passed through the subsequent transmission of finite bandwidth communication channel to stop this data set,
Each data item in the described data item (210) comprises one or more sections (220), forms a plurality of sections (220) forming this data set thus,
A chained address (230) distribute in described a plurality of sections (220) each the section, second section that distributes in first section chained address (230) and described a plurality of sections (220) is associated, so that detect not the existing of integrality of this data set subsequently by the chained address of determining to be associated with a section, a wherein said section is not present in this data centralization.
2. the method for claim 1 further comprises:
Encode the chained address (230) of each section as the one or more watermarks that embed in this section.
3. the method for claim 2, wherein said one or more watermarks comprise:
A robust watermarking, it is configured to make the destruction that the removal of this robust watermarking can cause the data that comprise in this section, and
A fragile watermark, it is configured to make the destruction that the modification of the data that comprise in this section can cause this fragile watermark.
4. the process of claim 1 wherein and distribute chained address (230) to comprise for each section:
Establishment is through a closed lists of links of all sections of the chained address (230) of each section link.
5. the method for claim 4 is wherein created closed lists of links and is comprised that one is selected at random.
6. the process of claim 1 wherein and distribute chained address (230) to comprise for each section:
Select other section at random so that (230) are linked to this section through the chained address.
7. the method for claim 1 further comprises:
Distributing inspection parameter (332) to each section in a plurality of sections (220), is effective section so that check each section corresponding to each chained address (230) subsequently.
8. the method for claim 7 further comprises:
Encode the chained address (230) of each section and inspection parameter (332) as the one or more watermarks that embed in this section.
9. the method for claim 8, wherein said one or more watermarks comprise:
A robust watermarking, it is configured to make the destruction that the removal of this robust watermarking can cause the data that comprise in this section, and
A fragile watermark, it is configured to make the destruction that the modification of the data that comprise in this section can cause this fragile watermark.
10. method to decoding from the content material in source comprises:
Receive and a corresponding data item of data set (210), and therefrom produce the regeneration of selecting data item corresponding to one,
Each data item in the described data item (210) comprises one or more sections (220), forms a plurality of sections (220) forming this data set thus,
Each section in described a plurality of sections (220) comprise a corresponding chained address of another section with this data set and
According to described a plurality of sections (220) in the existence of corresponding one or more other sections in chained address (230) of one or more sections (220) get rid of and the corresponding regeneration of this selection data item.
11. the method for claim 10 comprises:
Determine with described a plurality of sections (220) in the existence of corresponding all other sections in chained address (230) of all sections.
12. the method for claim 10 comprises:
Check the existence of described one or more other sections based on the inspection parameter (332) that is associated with each section.
13. the method for claim 10 comprises:
Read one or more first integrity parameters (230,332,336) that are associated with first section (220) of data set,
Described one or more first integrity parameters (230,332,336) covers second section chained address (230) of this data set,
Read second section one or more second integrity parameters (230,332,336) that are associated with this data set, and
The subsequent segment that reads this data set of decoding according to described one or more second integrity parameters (230,332,336).
14. the method for claim 13, wherein
Described one or more second integrity parameters (230,332,336) comprises a section inspection parameter (332), and
The decoding of described subsequent segment depends on described section inspection parameter (332).
15. the method for claim 14, wherein
Described section inspection parameter (332) is included in a random number that is associated with second section when this data set is created.
16. the method for claim 10, wherein
Described one or more second integrity parameters (230,332,336) is embedded in second section as one or more watermarks.
17. the method for claim 16, wherein said one or more watermarks comprise:
A robust watermarking, it be configured to make the removal of this robust watermarking can cause the data that comprise in second section destruction and
A fragile watermark, it is configured to make the destruction that the modification of the data that comprise in second section can cause this fragile watermark.
18. a scrambler (110) comprising:
A selector switch (112), it is configured to select to form the data item (210) of a data set, makes the accumulated size of this data set be enough to stop through this data set of finite bandwidth traffic channel,
Each data item in the described data item (210) comprises one or more sections (220),
A bundled device (116), it is configured to chained address (230) are associated with each section of the data item (210) of forming this data set, first section chained address (230) corresponding to second section of the data item (210) of forming this data set and
A register (114), it is configured to write down each section and medium (130) is arrived in each chained address that is associated (230), so that detect not the existing of integrality of this data set subsequently by the chained address of determining to be associated with a section, a wherein said section is not present in this data centralization.
19. the scrambler of claim 18 (110), wherein
This bundled device (116) is further configured by random processing chained address (230) is associated with each section.
20. the scrambler of claim 18 (110), wherein
This bundled device (116) is further configured a section inspection parameter (332) is associated with each section, and
This register (114) is further configured and becomes to utilize each segment record section inspection parameter (332), so that check this section to be present in the regeneration subsequently of data item (210).
21. the scrambler of claim 18 (110), wherein
This bundled device (116) is associated this section inspection parameter (332) based on random processing with each section.
22. a demoder (120) comprising:
A regenerator (122), it is configured to receive the data item (210) corresponding to a data set, and therefrom produces corresponding to the regeneration of selecting data item,
Each data item in the described data item (210) comprises one or more sections (220), forms a plurality of sections (220) forming this data set thus,
Each section in described a plurality of sections (220) comprises a chained address, and second section of first section chained address and this data set is associated, and
An integrity checker (126), operationally be coupled to this regenerator (122), this integrity checker is configured to: by the chained address of determining to be associated with a section, based on non-existent detection to the integrality of this data set, eliminating is corresponding to the regeneration of selecting data item, and a wherein said section is not present in this data centralization.
23. the demoder of claim 22 (120), wherein
This integrity checker (126) is further configured the existence that becomes to determine corresponding to all other sections of the chained address (230) of all sections in described a plurality of sections (220).
24. the demoder of claim 22 (120), wherein
This integrity checker (126) is further configured the existence of checking one or more other sections based on the inspection parameter that is associated with each section (332).
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US18083800P | 2000-02-07 | 2000-02-07 | |
| US60/180,838 | 2000-02-07 | ||
| US09/537,079 US6865676B1 (en) | 2000-03-28 | 2000-03-28 | Protecting content from illicit reproduction by proof of existence of a complete data set via a linked list |
| US09/537,079 | 2000-03-28 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1381047A CN1381047A (en) | 2002-11-20 |
| CN1214383C true CN1214383C (en) | 2005-08-10 |
Family
ID=26876679
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN01800849.6A Expired - Fee Related CN1214383C (en) | 2000-02-07 | 2001-02-05 | Protecting content from illicit reproduction |
Country Status (4)
| Country | Link |
|---|---|
| EP (1) | EP1218884A2 (en) |
| JP (1) | JP2003521791A (en) |
| CN (1) | CN1214383C (en) |
| WO (1) | WO2001057867A2 (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU784650B2 (en) * | 2000-02-01 | 2006-05-18 | Koninklijke Philips Electronics N.V. | Protecting content from illicit reproduction by proof of existence of a complete data set |
| US20030031317A1 (en) * | 2001-08-13 | 2003-02-13 | Michael Epstein | Increasing the size of a data-set and watermarking |
| US7194617B2 (en) * | 2001-11-05 | 2007-03-20 | Koninklijke Philips Electronics N.V. | Method and apparatus to prevent the unauthorized copying of digital information |
| US7636440B2 (en) * | 2003-01-31 | 2009-12-22 | Hewlett-Packard Development Company, L.P. | Digital watermark with variable location |
| US7421438B2 (en) | 2004-04-29 | 2008-09-02 | Microsoft Corporation | Metadata editing control |
| US7627552B2 (en) | 2003-03-27 | 2009-12-01 | Microsoft Corporation | System and method for filtering and organizing items based on common elements |
| US7665028B2 (en) | 2005-07-13 | 2010-02-16 | Microsoft Corporation | Rich drag drop user interface |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5915027A (en) * | 1996-11-05 | 1999-06-22 | Nec Research Institute | Digital watermarking |
| WO1999045704A2 (en) * | 1998-03-04 | 1999-09-10 | Koninklijke Philips Electronics N.V. | Watermark detection |
| GB2364513B (en) * | 1998-12-23 | 2003-04-09 | Kent Ridge Digital Labs | Method and apparatus for protecting the legitimacy of an article |
-
2001
- 2001-02-05 CN CN01800849.6A patent/CN1214383C/en not_active Expired - Fee Related
- 2001-02-05 JP JP2001557035A patent/JP2003521791A/en active Pending
- 2001-02-05 WO PCT/EP2001/001207 patent/WO2001057867A2/en not_active Application Discontinuation
- 2001-02-05 EP EP01949061A patent/EP1218884A2/en not_active Withdrawn
Also Published As
| Publication number | Publication date |
|---|---|
| EP1218884A2 (en) | 2002-07-03 |
| CN1381047A (en) | 2002-11-20 |
| WO2001057867A2 (en) | 2001-08-09 |
| WO2001057867A3 (en) | 2002-04-18 |
| JP2003521791A (en) | 2003-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7587603B2 (en) | Protecting content from illicit reproduction by proof of existence of a complete data set via self-referencing sections | |
| CN1185653C (en) | Protecting content from illicit reproduction by proof of existence of complete data set using security identifiers | |
| US20010054144A1 (en) | Confirming the existence of a complete data set under multiple control scenarios | |
| US6865676B1 (en) | Protecting content from illicit reproduction by proof of existence of a complete data set via a linked list | |
| CN1214383C (en) | Protecting content from illicit reproduction | |
| EP1459313A1 (en) | Apparatus and methods for detecting illicit content that has been imported into a secure domain | |
| AU784650B2 (en) | Protecting content from illicit reproduction by proof of existence of a complete data set | |
| WO2002085012A2 (en) | Apparatus and methods for attacking a screening algorithm based on partitioning of content | |
| US6976173B2 (en) | Methods of attack on a content screening algorithm based on adulteration of marked content | |
| US20020183967A1 (en) | Methods and apparatus for verifying the presence of original data in content while copying an identifiable subset thereof | |
| MXPA01010005A (en) | Protecting content from illicit reproduction by proof ofexistence of a complete data set |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |