Identification information embedding apparatus and identification information analysis apparatus
a technology of identification information and embedding apparatus, which is applied in the field of identification information embedding apparatus and identification information analysis apparatus, can solve the problems of reducing the motivation to illegally copy, affecting the economic merit of digital contents, and affecting the copying effect of digital contents
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Benefits of technology
Problems solved by technology
Method used
Image
Examples
first embodiment
[0058] As an application of an electronic watermark, description will be given as to a case where identification information which differs in accordance with each copy is embedded as watermark information in each of the copies (for example, a still picture, a moving picture, sound, music and others) of the same digital contents and identification information of colluders is traced. It is to be noted that description will be mainly given as to a case where a user identification information (user ID) of a user corresponding to the copy, namely, a user who utilizes the copy (for example, a user who delivers or lends the copy with a recording medium or a communication medium being used as a medium) is used as identification information hereinafter but information having the user ID subjected to a predetermined change may be used as identification information, or information other than the user ID or information obtained by conversion from such information may be used as identification i...
example 2
PRODEDURE EXAMPLE 2
[0285]FIG. 22 shows another example of the tracing algorithm of the outer code decoding device 222 of the decoding device 22 according to this embodiment.
[0286] It is to be noted that consideration is given as to a case where at least one of r(−)1=r+)1, r(−)2=r(+)2, . . . r(−)M=r(+)M cannot be achieved in the given residue-pair representation here.
[0287] One colluder group X suitable for the given residue-pair representation is first obtained (step S21).
[0288] Then, all the colluder groups Y (Y1, Y2, Y3, . . . ) which include at least the one same user ID as the user ID forming the obtained colluder group X and are suitable for the given residue-pair representation are obtained (step S22).
[0289] If no colluder group is obtained (step S23), all the user IDs forming the obtained colluder groups Y are determined as the colluder IDs (step S24), and the obtained colluder IDs are output (step S27).
[0290] In cases where one or a plurality of the colluder groups Y ar...
example 3
PROCEDURE EXAMPLE 3
[0298]FIGS. 25 and 26 show still another example of the tracing algorithm of the outer code decoding device 222 of the decoding device 22 according to this embodiment.
[0299] It is to be noted that FIGS. 25 and 26 show an example when the maximum collusion number c=3.
[0300] The number of the residue pairs of the residue-pair representation is determined as d (M in the above description) (step S51).
[0301] With respect to all sets of identification information u, the number of the residue pairs that u is congruent to the maximum residue or the minimum residue between u and the residue-pair representation is determined as V(u) (step S52). However, if even one pair such that the residue of u is larger than the maximum residue or smaller than the minimum residue exists, V(u)=0 is determined. Further, a set of the entire identification information where V(u) is not zero is determined as U′ (step S52).
[0302] It is to be noted that g indicates the number of pairs that ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


