CN101534428B - Dynamic traitor tracing method and system thereof - Google Patents
Dynamic traitor tracing method and system thereof Download PDFInfo
- Publication number
- CN101534428B CN101534428B CN2008100836357A CN200810083635A CN101534428B CN 101534428 B CN101534428 B CN 101534428B CN 2008100836357 A CN2008100836357 A CN 2008100836357A CN 200810083635 A CN200810083635 A CN 200810083635A CN 101534428 B CN101534428 B CN 101534428B
- Authority
- CN
- China
- Prior art keywords
- code word
- grouping
- user
- rebel
- users
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09C—CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
- G09C5/00—Ciphering apparatus or methods not provided for in the preceding groups, e.g. involving the concealment or deformation of graphic data such as designs, written or printed messages
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/60—Digital content management, e.g. content distribution
- H04L2209/606—Traitor tracing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a dynamic traitor tracing method and a system thereof. The method comprises the following steps: (1) based on the formula that r is equal to Np plus 1, users are divided into r groups to form a collection I; (2) a code word is sent; (3) the spreading code word is detected; (4) the group corresponding to the code word is judged; (5) if the code word corresponds to the group of the collection I, then the group corresponding to the code word is extracted from the collection I, and the group is further divided into N sub-groups to form a lock collection of traitors. The collection I after extraction is re-grouped to keep the total number of groups to be r. If the code word corresponds to the group in the traitor lock collection, and the number of users in the group is more than 1, then the group is further divided into N sub-groups to form a lock collection of traitors, and the other groups corresponding to the code word in the original traitor lock collection that the group belongs to are combined with the collection I and re-grouped in order to keep the total number of groups to be r; and (6) steps (2)-(5) are repeated, until the number of users in the group which the code word corresponds to becomes 1. Then the user is determined to be a traitor and eliminated.
Description
Technical field
The present invention relates to digital copyright protecting, relate in particular to a kind of Traitor Tracing Techniques, concretely, dynamic rebel's method for tracing and system.
Background technology
Development along with internet video technology and Digital Television, and media content is abundant, the Digital Television operation mode of the customized video frequency program of oneself liking of user charges has occurred and has progressively promoted, and video content provider also is more prone to utilize digital television system issue program.Yet user's problem of piracy becomes a big problem of the digital television industries development of restriction.In the digital television system, video frequency program is through encrypting the back to all users broadcastings, each user has decryption device at receiving end, if a user has subscribed to certain program, then the decryption device of his correspondence can recover the plaintext of this program, if there is not subscription programs, then decryption device can't be decrypted program, abandons the program bag.Copy right piracy under this broadcast mode of Digital Television mainly is the bootlegger by attacking that decryption device obtains the program decryption key and with its illegal diffusion.Some conspirators (or collaborator) can send plaintext or the pirate demoder that can untie enciphered data that will construct to undelegated user.This undelegated visit to data is known as piracy (piracy).User's problem of piracy can become the major issue of puzzlement digital television program operator.If can not effectively address this problem, pay and watch that the pattern of program just may be seriously influenced.
Traitor Tracing Techniques (Traitor Tracing) is the anti-pirate scheme that proposes under this application background.From B.Chor, A.Fiat and M.Naor have proposed scheme that the rebel follows the trail of till now first in document [1], and Traitor Tracing Techniques has derived a plurality of research research directions.Part scholar has constructed many symmetries and asymmetric scheme from the angle of encryption system.In the symmetric scheme, video content provider is identical with user's key; In the asymmetric scheme, the two holds different session keys.Another part scholar analogizes to the digital finger-print encoded question with rebel's tracking problem, research emphasis be how in the shortest time (corresponding to the shortest step-length of digital finger-print coding) track rebel as much as possible.They are divided into static scheme and dynamic aspect with tracing scheme: in the static scheme, tracing system adopts pre-set encryption key distribution and replacing scheme, and in the dynamic aspect, tracing system can be monitored the key of pirate user diffusion behind distributed key, and according to the cipher key distribution scheme of this feedback information design subsequent.
Fiat and Tassa have proposed the notion that dynamic rebel follows the trail of (Dynamic TraitorTracing) in document [2], hope can utilize bootlegger's feedback information to shorten the needed time of rebel that tracks.Dynamically the roughly flow process of rebel's tracking as shown in Figure 1.
The publisher is first to user grouping, the code word that each component is sent out identical, the code word difference that different user's components is sent out.The bootlegger of several conspiracy can select one illegally to spread from the code word that they obtain.The code word that the publisher is illegally spread with the monitoring system monitoring, thus infer it from which user's group, then in conjunction with former code word reveal information and grouping information deduction pirate user.If can't judge, then, distribute code word and monitoring again according to the grouping of these information adjustment to the user, be enough to infer the bootlegger up to the information of collecting.Above said " code word " be an abstract concept, it can be the different decruption keys to same program, also can be the media file that is embedded with different finger print informations.Whole pursive strategy can be regarded as a sign indicating number sequence that dynamically generates according to bootlegger's feedback information, the number of times that tracing pirates need be adjusted user grouping can be regarded as the code length of yard sequence, and the number of the maximum user's group that can divide each time can be regarded as the operable system number of each code word of yard sequence.
Dynamically the rebel follows the trail of and can be divided into determinacy tracking and probability tracking.The suspicion bootlegger of determinacy tracing system output has necessarily participated in piracy, and the suspicion bootlegger of probability tracing system output has participated in pirate (being that system exists certain False Rate) with very big probability.
Fiat and Tassa have proposed the dynamic rebel's tracing scheme of determinacy (document [2]) by the thinking structure of binary tree (multiway tree) search, and point out, have only when the user grouping number when conspiring number of users, just may construct determinacy pursive strategy.Counting r and pirate user with maximum user grouping, to count the situation that the relation of upper bound p satisfies r=2p+1 be example, this pursive strategy utilizes a user to organize the possible not guilty user of I storage, and organize p possible pirate user of storage with a remaining 2p user, each user's group is to { Li has a bootlegger at least among the user among the Ri} in 2p user's group.If the illegal diffusion code word that monitors is to distribute to the code word of I, then I is divided into the identical Li of number of users and Ri two parts, and I is put sky; If the code word that monitors is distributed to Li, then Ri and I are merged, Li is divided into Li and Ri two parts; If the code word that monitors from Ri, then merges Li and I, Ri is divided into Li and Ri two parts.Every through a step, reduce by half with regard to having a number of users in user's group, be monitored to up to the code word of distributing to certain user who only comprises user group, then track a pirate user, this user is disconnected from system, and continue above-mentioned steps, be tracked to up to all pirate users.
In the dynamic tracing strategy of this r=2p+1 that Fiat and Tassa propose, the packet count in initial several steps of search procedure is far smaller than largest packet usually and counts r.And in actual applications, because the complicacy of many decruption keys system design or the restriction of transmission bandwidth, the largest packet number is restricted often, in other words, increase the largest packet number and must pay higher cost, therefore, above-mentioned dynamic tracing strategy can not utilize set system condition fully, causes search efficiency to be affected.
Summary of the invention
In order to solve as above problem, fundamental purpose of the present invention is to provide a kind of dynamic rebel's method for tracing, to make full use of the largest packet number, improves the search efficiency to the rebel.
Accordingly, the present invention also provides a kind of dynamic rebel's tracing system.
To achieve these goals, a kind of dynamic rebel's method for tracing of the embodiment of the invention comprises:
(1) according to formula r=Np+1 all users are divided into r user's group based on rebel's number p that will follow the trail of, this r user organizes and forms set I, and wherein N is integer and N 〉=2;
(2) organize the transmission code word to a described r user, same group user sends identical code word, and user does not on the same group send different code words;
(3) detect the code word that spreads;
(4) user who judges the code word correspondence of this diffusion organizes;
(5) user based on the code word correspondence of this diffusion organizes the adjustment user grouping;
If this code word is corresponding to the grouping of set among the I, then the grouping with this code word correspondence extracts from set I, be further divided into N grouping and lock set, and the set I after will extracting divides into groups again to form a rebel, and be r with maintenance total packet number;
If this code word locks a grouping in the set corresponding to the rebel, and the number of users in should dividing into groups is greater than 1, then the grouping of this code word correspondence is further divided into N grouping and locks set to form a rebel, and other groupings that the former rebel under the grouping of described code word correspondence is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, is r to keep the total packet number;
(6) repeating step (2)-(5), number of users is 1 in the grouping of detected code word correspondence, judges that then this user is the rebel, and this user is rejected.
(7) judge whether to detect all rebels, if not, other groupings that the rebel under the user who rejects is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, are r with maintenance total packet number;
(8) repeating step (2)-(7).
To achieve these goals, a kind of dynamic rebel's method for tracing of the embodiment of the invention comprises:
Grouped element is used for according to formula r=Np+1 all users being divided into r grouping based on rebel's number p that will follow the trail of, and wherein N is integer and N 〉=2;
The code assignment unit is used for sending code word to the user of each grouping, and same group user sends identical code word, and user does not on the same group send different code words;
Monitoring means is used to detect the code word of diffusion;
Tracing unit is used for judging the grouping of code word correspondence of described detection and the number of users of this grouping, and judged result is fed back to described grouped element; And
Output unit is used to analyze the judged result of described tracing unit, and number of users is 1 in the grouping of the code word correspondence that detects, and determines that the user is the rebel, exports this rebel's information;
Wherein said grouped element is adjusted user grouping based on the judged result of tracing unit; If this code word is corresponding to the grouping of set among the I, then this grouped element extracts the grouping of this code word correspondence from set I, be further divided into N grouping and lock set, and the set I after will extracting divides into groups again to form a rebel, and be r with maintenance total packet number; If this code word locks a grouping in the set corresponding to the rebel, and the number of users in should dividing into groups is greater than 1, then this grouped element is further divided into N grouping with the grouping of this code word correspondence and locks set to form a rebel, and other groupings that the former rebel under the grouping of described code word correspondence is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, is r to keep the total packet number; If number of users is 1 in the grouping of detected code word correspondence, then this grouped element is rejected this user, other groupings that rebel under the user who rejects locked in the set simultaneously are incorporated among the set I, and the set I after will merging divides into groups again, are r with maintenance total packet number;
Described code assignment unit is organized the transmission code word based on the adjusted grouping of described grouped element to all users, and to be detected by monitoring means, the code word that described tracing unit detects according to monitoring means is fed back and followed the trail of the result to grouped element.
The embodiment of the invention makes full use of based on the largest packet number in the dynamic tracing strategy of binary tree or multiway tree, has improved the search efficiency to the rebel.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, does not constitute limitation of the invention.In the accompanying drawings:
Fig. 1 is existing based on the schematic flow sheet of following the trail of the rebel in the dynamic tracing strategy of binary tree;
Fig. 2 is the process flow diagram of dynamic rebel's method for tracing of the embodiment of the invention;
Fig. 3 is the structural representation of dynamic rebel's tracing system of the embodiment of the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, specific embodiments of the invention are elaborated below in conjunction with accompanying drawing.At this, illustrative examples of the present invention and explanation thereof are used to explain the present invention, but not as a limitation of the invention.
Fig. 2 is the process flow diagram of dynamic rebel's method for tracing of the embodiment of the invention.As shown in Figure 2, this dynamic rebel's method for tracing comprises the steps:
If the code word of leaking is not to come from set I, then this code word comes from the rebel and locks a grouping in the set, enter step 206, if judge that further number of users in this grouping is greater than 1, then enter step 207, the grouping of this code word correspondence is further divided into N grouping locks set to form a rebel, and other groupings that the former rebel under the grouping of described code word correspondence is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, is r to keep the total packet number;
Repeating step 202-207, number of users is 1 in the grouping of detected code word correspondence, then enters step 208, judges that this user is the rebel, and this user is rejected.
Repeating step 202-210, until detecting all rebels, search finishes.
Below respectively with the binary tree search of P=2 and 3 o'clock, and the ternary tree search illustrates dynamic rebel's searching method of the present invention for example.
During at first for P=2, dynamic rebel's searching method of present embodiment comprises the steps:
(1) all users (digital cable customers as 1,000,000) are divided into 5 groupings (as every group 20 general-purpose family), initially these 5 groupings all belong to set I;
(2) send code word to described grouping, identical grouping sends identical code word, and different groupings sends different code words;
(3) detect the code word of leaking, and the pairing grouping of the code word of detected leakage taken out from set I and be divided into 2 two parts (i.e. two groupings that equate, each 10 general-purpose family of dividing into groups, has a rebel among the user of these two groupings at least, for convenience of description, this set dimerous is called the rebel and locks set), and other 4 groupings will gathering among the I merge, again being divided into 3 groupings after the merging, is 5 to keep the total packet number.
(4) send code word to adjusted grouping, detect the code word of leaking and judge the grouping of this code word correspondence.
If this grouping belongs to set I (promptly do not belong to the rebel and lock set), the grouping of this code word correspondence is extracted from set I, then this grouping is further divided into essentially identical 2 groupings of number of users (differing 1 as 2 identical or numbers of grouping), these 2 groupings form rebels and lock set.Set I after the extraction merges and grouping again, is 5 to keep the total packet number.
If the grouping of the code word correspondence of leaking does not belong to set I, lock set but belong to the rebel, and the number of users in should dividing into groups is greater than 1, then the grouping of this code word correspondence is further divided into 2 groupings, form a rebel and lock set, and the former rebel under the grouping of described code word correspondence is locked other groupings in the set be incorporated among the set I, and the set I after will merging divides into groups again, is 5 with maintenance total packet number.
(5) repeating step (4), number of users is 1 in the grouping of detected code word correspondence, judges that then this user is the rebel, and this user is rejected.
Under the situation for P=2, may exist 2 rebels to lock set altogether, have a rebel among each set person.Every through a step, the user who just has in user group of a set reduces by half, and is detected until the code word of distributing to certain user who only comprises user group, then just tracks a rebel.
(6) judge whether to detect all rebels, if not, other groupings that the rebel under the user who rejects is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, are 5 with maintenance total packet number;
(7) repeating step (4)-(6), until detecting all rebels, search finishes.
From as above the search flow process as can be seen, in search procedure, packet count remains r, compares with original r=2p+1 dynamic tracing algorithm, under the situation that grouping number is restricted, has utilized set condition more fully, has improved search efficiency.
During for P=3, the flow process of News Search is the same substantially, and different is all users to be divided into 7 groupings, and one meet together and exist 3 rebels to lock set, has a rebel among each set person.
When carrying out News Search based on the searching idea of ternary tree, flow process is identical with above-mentioned (1)-(7) basically, except the packet count difference, other difference is, when the grouping of the code word correspondence of leaking is divided into groups again is to be divided into 3 groups (for N fork number, be divided into the N group), rather than be divided into 2 groups.
Fig. 3 is a structural representation of carrying out the system of above-mentioned dynamic rebel's method for tracing in the embodiment of the invention.As shown in Figure 2, this dynamic rebel's tracing system comprises: grouped element, code assignment unit, monitoring means, tracing unit and output unit.
Wherein, described grouped element is used for according to formula r=Np+1 all users being divided into r grouping based on rebel's number p that will follow the trail of, and wherein N is integer and N 〉=2;
Described code assignment unit is used for sending code word to the user of each grouping, and same group user sends identical code word, and user does not on the same group send different code words;
Described monitoring means is used to detect the code word of diffusion;
Described tracing unit is used for judging the grouping of code word correspondence of described detection and the number of users of this grouping, and judged result is fed back to described grouped element;
Described output unit is used to analyze the judged result of described tracing unit, and number of users is 1 in the grouping of the code word correspondence that detects, and determines that the user is the rebel, exports this rebel's information;
In addition, described grouped element is adjusted user grouping based on the judged result of tracing unit; If this code word is corresponding to the grouping of set among the I, then this grouped element extracts the grouping of this code word correspondence from set I, be further divided into N grouping and lock set, and the set I after will extracting divides into groups again to form a rebel, and be r with maintenance total packet number; If this code word locks a grouping in the set corresponding to the rebel, and the number of users in should dividing into groups is greater than 1, then this grouped element is further divided into N grouping with the grouping of this code word correspondence and locks set to form a rebel, and other groupings that the former rebel under the grouping of described code word correspondence is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, is r to keep the total packet number; If number of users is 1 in the grouping of detected code word correspondence, then this grouped element is rejected this user, other groupings that rebel under the user who rejects locked in the set simultaneously are incorporated among the set I, and the set I after will merging divides into groups again, are r with maintenance total packet number;
Described code assignment unit is organized the transmission code word based on the adjusted grouping of described grouped element to all users, and to be detected by monitoring means, the code word that described tracing unit detects according to monitoring means is fed back and followed the trail of the result to grouped element.
According to rebel's dynamic tracing method and system as above, just can these a plurality of conspiracy rebels carry out track-while-scan fast, thereby effectively solve problem of piracy.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method can instruct relevant hardware to finish by program, this program can be stored in the computer read/write memory medium, such as ROM/RAM, magnetic disc, CD etc.
Above-described specific embodiment; purpose of the present invention, technical scheme and beneficial effect are further described; institute is understood that; the above only is specific embodiments of the invention; and be not intended to limit the scope of the invention; within the spirit and principles in the present invention all, any modification of being made, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
List of references:
[1]B.Chor，A.Fiat?and?M.Naor，“Tracing?Traitors”，Proc.CRYPTO’94，Lecture?Notes?in?Computer?Science(LNCS)，Vol.839，pp.257-270，Springer?Verlag，New?York，1994.
[2]A.Fiat?and?T.Tassa，“Dynamic?traitor?tracing”，Journal?of?Cryptology，Vol.14，No.3，pp.211-223，2001.
Claims (7)
1. dynamic rebel's method for tracing is characterized in that this method comprises:
(1) according to formula r=Np+1 all users are divided into r user's group based on rebel's number p that will follow the trail of, this r user organizes and forms set I, and wherein N is integer and N 〉=2;
(2) organize the transmission code word to a described r user, same group user sends identical code word, and user does not on the same group send different code words;
(3) detect the code word that spreads;
(4) user who judges the code word correspondence of this diffusion organizes;
(5) user based on the code word correspondence of this diffusion organizes the adjustment user grouping;
If this code word is corresponding to the grouping of set among the I, then the grouping with this code word correspondence extracts from set I, be further divided into N grouping and lock set, and the set I after will extracting divides into groups again to form a rebel, and be r with maintenance total packet number;
If this code word locks a grouping in the set corresponding to the rebel, and the number of users in should dividing into groups is greater than 1, then the grouping of this code word correspondence is further divided into N grouping and locks set to form a rebel, and other groupings that the former rebel under the grouping of described code word correspondence is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, is r to keep the total packet number;
(6) repeating step (2)-(5), number of users is 1 in the grouping of detected code word correspondence, judges that then this user is the rebel, and this user is rejected.
2. method according to claim 1 is characterized in that, this method also comprises:
(7) judge whether to detect all rebels; If not, other groupings that the rebel under the user who rejects is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, are r with maintenance total packet number;
(8) repeating step (2)-(7).
3. method according to claim 1 is characterized in that: N=2 or 3.
4. method according to claim 1 is characterized in that: P 〉=2.
5. dynamic rebel's tracing system is characterized in that this system comprises:
Grouped element is used for according to formula r=Np+1 all users being divided into r grouping based on rebel's number p that will follow the trail of, and wherein N is integer and N 〉=2;
The code assignment unit is used for sending code word to the user of each grouping, and same group user sends identical code word, and user does not on the same group send different code words;
Monitoring means is used to detect the code word of diffusion;
Tracing unit is used for judging the grouping of code word correspondence of described detection and the number of users of this grouping, and judged result is fed back to described grouped element; And
Output unit is used to analyze the judged result of described tracing unit, and number of users is 1 in the grouping of the code word correspondence that detects, and determines that the user is the rebel, exports this rebel's information;
Wherein said grouped element is adjusted user grouping based on the judged result of tracing unit; If this code word is corresponding to the grouping of set among the I, then this grouped element extracts the grouping of this code word correspondence from set I, be further divided into N grouping and lock set, and the set I after will extracting divides into groups again to form a rebel, and be r with maintenance total packet number; If this code word locks a grouping in the set corresponding to the rebel, and the number of users in should dividing into groups is greater than 1, then this grouped element is further divided into N grouping with the grouping of this code word correspondence and locks set to form a rebel, and other groupings that the former rebel under the grouping of described code word correspondence is locked in the set are incorporated among the set I, and the set I after will merging divides into groups again, is r to keep the total packet number; If number of users is 1 in the grouping of detected code word correspondence, then this grouped element is rejected this user, other groupings that rebel under the user who rejects locked in the set simultaneously are incorporated among the set I, and the set I after will merging divides into groups again, are r with maintenance total packet number;
Described code assignment unit is organized the transmission code word based on the adjusted grouping of described grouped element to all users, and to be detected by monitoring means, the code word that described tracing unit detects according to monitoring means is fed back and followed the trail of the result to grouped element.
6. system according to claim 5 is characterized in that:
N=2 or 3.
7. system according to claim 5 is characterized in that, P 〉=2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100836357A CN101534428B (en) | 2008-03-12 | 2008-03-12 | Dynamic traitor tracing method and system thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100836357A CN101534428B (en) | 2008-03-12 | 2008-03-12 | Dynamic traitor tracing method and system thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101534428A CN101534428A (en) | 2009-09-16 |
| CN101534428B true CN101534428B (en) | 2011-01-19 |
Family
ID=41104778
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100836357A Active CN101534428B (en) | 2008-03-12 | 2008-03-12 | Dynamic traitor tracing method and system thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101534428B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107947915B (en) * | 2017-11-10 | 2020-02-21 | 西安电子科技大学 | Anonymous traitor tracing method based on compressed sensing |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1554163A (en) * | 2001-01-26 | 2004-12-08 | �Ҵ���˾ | Method for tracing traitor receivers in a broadcast encryption system |
| CN1665185A (en) * | 2004-01-21 | 2005-09-07 | 株式会社东芝 | Content providing system, user system, tracing system, apparatus, method |
| CN1991853A (en) * | 2005-12-30 | 2007-07-04 | 国际商业机器公司 | Method and system for tracing traitor in a broadcast encryption system |
-
2008
- 2008-03-12 CN CN2008100836357A patent/CN101534428B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1554163A (en) * | 2001-01-26 | 2004-12-08 | �Ҵ���˾ | Method for tracing traitor receivers in a broadcast encryption system |
| CN1665185A (en) * | 2004-01-21 | 2005-09-07 | 株式会社东芝 | Content providing system, user system, tracing system, apparatus, method |
| CN1991853A (en) * | 2005-12-30 | 2007-07-04 | 国际商业机器公司 | Method and system for tracing traitor in a broadcast encryption system |
Non-Patent Citations (1)
| Title |
|---|
| 苏加军等.一种改进的动态叛徒追踪方案.西安电子科技大学学报（自然科学版）.2005,第32卷(第5期),786-789. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101534428A (en) | 2009-09-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7630497B2 (en) | System and method for assigning sequence keys to a media player to enable hybrid traitor tracing | |
| EP1354443B2 (en) | Method for broadcast encryption | |
| EP1215905B2 (en) | Reception apparatus having a storage unit for recording a scrambled broadcast signal and broadcast apparatus for scrambling a signal to be broadcast, and associated methods | |
| US20020076204A1 (en) | Key management device/method/program, recording medium, reproducing device/method, recording device, and computer-readable, second recording medium storing the key management program for copyright protection | |
| US7711114B2 (en) | System and method for assigning sequence keys to a media player to enable flexible traitor tracing | |
| Safavi-Naini et al. | Sequential traitor tracing | |
| CN103686333B (en) | A kind of audio and video guard method and audio-video terminal | |
| EP2201711B1 (en) | Method for detection of a hacked decoder | |
| US11025977B2 (en) | Constructing a transport stream | |
| JP2004527937A (en) | How to trace a traitor receiver in a broadcast encryption system | |
| AU2001243465A1 (en) | Method and system to uniquely associate multicast content with each of multiple recipients | |
| EP1264436A1 (en) | Method and system to uniquely associate multicast content with each of multiple recipients | |
| Adelsbach et al. | Fingercasting—joint fingerprinting and decryption of broadcast messages | |
| KR100717005B1 (en) | Method and apparatus for determining revocation key, and method and apparatus for decrypting thereby | |
| CN101534428B (en) | Dynamic traitor tracing method and system thereof | |
| CN113660088A (en) | Block chain transaction screening method based on dynamic address | |
| Naor et al. | Protecting cryptographic keys: The trace-and-revoke approach | |
| Tassa | Low bandwidth dynamic traitor tracing schemes | |
| Roelse | Dynamic subtree tracing and its application in pay-TV systems | |
| Jókay | The design of a steganographic system based on the internal MP4 file structures | |
| Sampat et al. | A novel video steganography technique using dynamic cover generation | |
| Zhu et al. | A hierarchical key distribution scheme for conditional access system in DTV broadcasting | |
| Huang et al. | Practical key distribution schemes for channel protection | |
| Adelsbach et al. | Fingercasting–joint fingerprinting and decryption of broadcast messages | |
| CN101534429A (en) | Pirate tracking method and system thereof |
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 |