System and method of marking desynchronised identification information of digital multimedia data

FIELD: physics; communications.

SUBSTANCE: invention relates to identification of multimedia information. The system and method of using desynchronised identification information can be used for audio applications and for video applications and includes embedding functions and detection and extraction functions. Unique keys are associated with each buyer of a copy of digital data. The embedding function includes application of pseudorandom conversion of selected embedding zones. The pseudorandom conversion key is specific for the user. Zones are selected using a secret hash function of the multimedia information. The detection and extraction functions include rough search in a set of user keys. If one of the keys is sufficiently probable, then that user is involved in making illegal copies.

EFFECT: increased number of individuals who should be identified, as well as increased cryptographic protection.

28 cl, 9 dwg

The technical field

The present invention relates to the identification of the multimedia information in General and, in particular, to a secure identification system and method for identifying persons involved in the illicit manufacture of copies of digital multimedia products.

The prior art inventions

Illegal copying of digital data media products (such as films and sound recordings) is a widespread problem. And, apparently, the only problem is growing, despite the technical advances in the field of copy protection and attempts to install for the implementation of intellectual property rights. Such violations of intellectual property rights can cause great financial harm to their owner.

A growing trend illegal copying is connected, apparently, with increasing use of digital media and equipment for storage and distribution of digital multimedia data. The rapid development of Internet technologies and storage of data in digital form has made it possible for simple and inexpensive manufacture of identical high-quality copies of the original. In addition, it has become possible to make these copies available to the entire Internet community. This process is becoming easier with the use of P2P-networks (networks point-to-point). With HC is the increased availability of Cam devices and increase their bandwidth for digital data, the need to limit illegal distribution of digital multimedia data (such as images, video and music) becomes an important issue.

One of the ways to deter illegal copying is an increased risk of being caught after the complicity was discovered. The introduction of a unique, invisible marks in each copy (in other words, sensitive, and reliable introduction of the label in the perceived content of the digital media signal is a way to increase this risk. Thus, if an illegal copy is found anywhere else, then it becomes possible to find the owner of the copy and apply the actions stipulated by the legislation. This type of security arrangements is called "using fingerprint" or "identification information" (also known in some circles as "the introduction of the label"used by law enforcement officers).

The idea of identification is to uniquely mark each copy. This makes each copy is different at the level of the digital representation in the media, but at the same time perceived the contents of the different copies remains perceptually similar. Thus, it becomes possible to distinguish between all legal copies. The tagging can be used to identify copies and, therefore, the user, if his identity were some of the time associated identification information. For example, if the identified copies were sent only to people who identified themselves, it becomes possible in the case of determination of illegal copies to identify the owner of a legal copy, which was made illegal copies.

For example, the owner of the film on digital video disc (DVD) makes a copy of this movie for sale. Each of the copies contain identifying information. The owner sells a copy to the user, pre-individually and uniquely marked each sold copy of the identification information, and associating each identification information with the individual customer. Later, some buyers, referred to as pirates, they create illegal copies they distribute (in this situation, the pirates are also referred to as partners). The owner of the film can analyze an illegal copy and try to figure out who the buyers participated in the creation of illegal copies.

Equipment identification information includes embedding identification information in each copy of a digital product using the scheme "watermark" (also known as "the introduction of the label"). Utilizing a watermark allows you to quietly introduce identificational information to perceive the contents of such clicks the zoom, this identification information can be recovered only with the help of a secret key. It should be noted that this type of scheme is completely different from traditional DRM-technology content protection (DRM - Digital Rights Management). There are two important differences between the watermarks (for shielding the contents to prevent illegal copying or recording) and identification information (for tracking leaks by law enforcement officials). First, at that time, as in “water” signs hidden message (label) is the same for all buyers (and this label is often identifies the owner of the content, identification information of the label is set in accordance with the identity of the buyer. Secondly, the collusion of buyers cannot be set on the basis of “watermark” (as marked copies of the same content are the same for all buyers). However, the identification information of the tag is different for each buyer and buyers, entered into a conspiracy, it is possible to carry out the conspiracy by comparing existing copies, localization and removal of bits of the label. Thus, when attacking marked with the identification information of the digital products group dishonest users show the reports to create illegal copies, who will hide their identity by combining different parts of the existing copies. The attack is designed to find and delete from the copy hidden and embedded in her identity.

One of the problems associated with current methods of using the identification information, is that all these methods are limited by the number of partners that can be identified. For example, some used now traditional identification methods can only identify four to eight partners. Some newer authentication methods use the codes identifying information to obtain significantly better results compared to traditional methods of identification. However, in the production of illegal copies is involved a large number of partners. This means that the currently used authentication methods cannot accurately identify more than one hundred persons. This often limits the deterrent effect of identification using identification information as the partners know what they need to do is to attract more owners of other copies in order to make identification impossible.

Another problem related with the applied methods identify the purpose, is the sensitivity of these methods to the appraisal attacks. Estimated attack is when an attacker take all the frames in the scene and calculate the average number of all frames, thereby producing an estimation of the original unmarked content. Alternatively, different methods can be used to assess identification information of each copy based on the analysis of the inherent redundancy in the signal carrier. This can significantly weaken or eliminate all identifying information. Consequently, requires identifying systems and methods that can accurately identify at least order of magnitude more people than currently used identification methods. You also need to have systems and methods using the identification information has been cryptographically protected and would be resistant to estimate attacks.

The invention

The invention disclosed below, includes a system and method desynchronizing using identification information that is resistant to attack and which can identify a large number of partners without the use of codes identifying information. In particular, the system and method using desynchronizing identification information, rusk is itie here able to identify significantly more partners than currently used methods of using the identification information.

The system and method of use desynchronizing identification information can be used for any type of multimedia data, in particular for audio and video applications. In General, for each user assigned to different keys. Function implementation involves applying a pseudo-random transformation of the selected zones. The key for the pseudo-random transformation is specific to each user. These zones are selected using a secure hash function multimedia information. Detection and extraction include simple (rough) search in the field of user keys. If one of the keys is “likely” to be appropriate, then this means that this user was involved in the production of illegal copies.

The way to use desynchronizing identification information includes the process desynchronizing implementation and the processes of discovery and retrieval. The process desynchronizing implementation involves the generation of copies of the original multimedia product (where each copy is a pseudo-random desynchronization version of the original) and random the selection desynchronizers zone and zone implementation in which you want to embed the identification information. Pseudo-random intentional desynchronization before actual implementation of the label ensures that partners will be hard to find a good estimate of unlabeled original signal (for example, attacks using methods of averages). This is because partners have to "align" their copies relative to each other to obtain the assessment, and this becomes more difficult with increasing number of participating (taking into account the fact that the total computational power is limited). The random process of de-involves mapping (transformation) of the width of each zone of desynchronization in a pseudo-randomly selected value that varies from copy to copy for different clients. The master key is used during random desynchronization. Similarly, the master key and the hash function used for the random selection of areas for implementation. Then the unique information about copies and secret keys embedded in the area of implementation. In General, it is not necessary that the area of implementation and the timing were the same, so they can overlap.

The discovery and extraction include obtaining illegal copies of the original digital multimedia product. For this illegal copiepresse hash values, used to determine the areas of implementation by comparing it with the hash values of the zones of the implementation of the original content. In essence, complex (robust) hash function over the perceived content used for the closure of implementation at the receiver. Then, detection is performed “water” sign in each zone implementation for each of your secret key. Is determined by the identification information and information about the partner is extracted to build the list of partners. This list of partners represents persons who participated in the production of illegal copies.

Brief description of drawings

For a better understanding of the presented invention provides the following description and the accompanying drawings, which illustrate aspects of the invention. Other characteristics and advantages will become apparent from the subsequent detailed description of the invention given with reference to the accompanying drawings, which illustrate, as an example, presents principles of the invention.

All drawings number, as links, are the relevant parts:

FIGURE 1 is a block diagram illustrating an example implementation of the system and method of use desynchronizing identification information is described here.

FIGURE 2 is about the overall diagram of the processes, illustrating the General operation of the system using desynchronizing identification information shown in figure 1.

FIGURE 3 is a General diagram of the processes, illustrating the operation of the process desynchronizing introduction according to the method of use desynchronizing identification information shown in figure 2.

FIGURE 4 is a detailed diagram of the processes, illustrating in detail the operation of the process desynchronizing implementation, shown in FIGURE 3.

FIGURE 5 is a General diagram of the processes, illustrating the operation of the processes of detection and extraction method using desynchronizing identification information shown in figure 2.

6 illustrates an example of a suitable computing environment systems, in which the system and method of use desynchronizing identification information shown in figure 1, can be implemented.

7 is a block diagram illustrating details of the system use desynchronizing identification information shown in figure 1.

FIG is a block diagram illustrating the details of the module implementation is shown in FIG.7.

FIG.9 is a block diagram illustrating the details of the detection module and retrieve shown in FIG.7.

Detailed description the s inventions

In the following description of the invention made with reference to the accompanying drawings, which are part of the description and showing, as an illustration, a specific example, in accordance with which the invention can be applied. It is clear that can be used in other embodiments and that can be made structural changes without departing from the scope of the presented invention.

I. Introduction

Illegal copying and distribution of digital multimedia data is becoming a widespread problem, which is expressed in a loss of revenue for the owner of the intellectual property. One of the ways to increase the risk of being caught is the application of methods using identification information that uniquely identifies the copy of the product containing the digital multimedia data with the buyer. However, the currently used authentication methods are very limited in the number of partners that can be identified. In addition, these methods use identification codes, the implementation of which can be difficult. Moreover, the currently used methods are vulnerable to estimate attacks that can virtually eliminate the identification information.

System and method using desynchronizes the private identification information, described here is able to identify at least an order of magnitude more partners than the methods currently used. Moreover, the system and method achieve this without the use of codes identifying information. Although codes and can be used with the system and method of use desynchronizing identification information, but their use is optional. In addition, the system and method of use desynchronizing identification information is made resistant to estimate attacks by using a new process is random in timing, which randomly changes the width of randomly selected areas of desynchronization. Then, the identification information is embedded into each copy of the digital media data in the areas of implementation, which may be identical with the areas of de-or to be different from them. By increasing the number of partners that can be identified, and by creating a more sustainable way assessment against attacks, the system and method of use desynchronizing identification information serve as a reliable deterrent to illegal copying.

II. General description

FIGURE 1 is a block diagram illustrating a typical implementation of the system and method of use desynchronizing the Noah identification information, here described. It should be noted that FIGURE 1 is just one of several ways in which the system and method of use desynchronizing identification information can be implemented and used.

The system and method of use desynchronizing identification information operate on the digital multimedia data (such as images, video and audio). In General, there are two parts of the system and method of use desynchronizing identification information. The first part consists in using the system and method of use desynchronizing identification information for the implementation of unique information inside each copy of the digital media product (such as a movie or audio recording). This unique information catalogued, so that a copy of the product is associated with a specific person (such as the buyer copies of the product). The second part includes analysis of illegal copies of the product (such as, for example, the analysis of law enforcement agencies) to identify persons involved in the production of illegal copies.

In an exemplary implementation, shown in figure 1, the digital multimedia product is a film. More specifically, as shown in figure 1, the system and method 100 of using desynchronizing identificatio the Noi information used for making the master copy of the film 105. As described in detail below, the system and method 100 of using desynchronizing identification information using the master key 110 and a lot of secret keys 115. In this exemplary implementation, the number of secret keys is equal to N. After processing the result of applying the system and method 100 of using desynchronizing identification information is N copies of the film 105. In particular, the system and method 100 of using desynchronizing identification information make a copy of the film (1) 120 with identification information, a copy of the film (2) 125 with identification information, a copy of the film (3) 130 with the identification information, and so on until copies of the film (N) 135 identification information. Each copy of the film with the identification information has a corresponding one of the secret keys 115. The secret key associated with the copy of the film with identification information that allows the key holder to access the unique information contained in the copy of the film.

Each of the copies of the film identification information is then distributed in any way. Usually, the distribution includes offer for sale. However, other methods of distribution, such as distribution for any other purpose, such as recensione is s, assessment, and so on. In the example implementation shown in figure 1, the distribution is to purchase any copies of the film with the identification information. In particular, the first buyer (B(1)) 140 buys a copy of the film (1) 120 with the identification information, the second buyer (B(2)) 145 buys a copy of the film (2) 125 identification information, the third buyer (B(3)) 150 buys a copy of the film (3) 130 with the identification information, and so forth, that the N-th buyer (B(N)) 155 buys a copy of the film (N) 135 identification information. Recorded about each buyer and the number of copies of the film, which they had bought.

Illegal copy of the film 160 is normally made by the collaboration of several buyers, as shown by the arrow 165 in figure 1. However, the identity of the buyers who participated in the making at this stage is not known. The system and method 100 of using desynchronizing identification information used for processing illegal copies 160 and identify partners.

Illegal copy of the film 160 is processed by the system and method 100 of using desynchronizing identification information by attempts to apply each of the secret keys 115. If the secret key 115 opens the piece of information that is embedded in an illegal copy 160, Patel, associated with this key, can be suspected of involvement in the making of illegal copies of the film 160. In this exemplary implementation, shown in figure 1, buyers B(6) 165(7) 170 and(9) 175 were identified as involved in the production of illegal copies of the film 160. Then can be applied the appropriate legal measures to keep others from participating in the making of illegal copies (such as imprisonment of perpetrators 180).

It should be noted that the system and method 100 of using desynchronizing identification information can identify a much larger number of partners than the three shown. In fact, one advantage of the system and method 100 of using desynchronizing identification information is their ability to identify a very large number of partners. However, to simplify this example embodiment shows only three.

III. Review of operations

The following is a description of the operation of the system and method 100 of using desynchronizing identification information shown in figure 1. FIGURE 2 is a General diagram of the processes, illustrating the General operation of the system using desynchronizing identification information shown in figure 1. The way to use desynchronizing the ID is authorized information starts with the receipt of the original digital media product (step 200) and the production of copies (step 210). Different and unique secret key is assigned to each copy along with the unique information associated with this key (block 220). For example, the unique information may be the number of copies.

Each copy is identified by the introduction of the secret key and the unique information associated with the process desynchronizing implementation (stage 230). Then, the resulting desynchronization identified copies are distributed (step 240). For example, copies may be available or can be leased.

Some holders of copies later can be combined for making illegal copies. For example, a small part of copies of each participant can be used to produce a single illegal copy. Usually, this requires the involvement of a large number of participants. In General, the idea that the increase in participants is not output, because each of them will still be identified as an accomplice.

Illegal copy is obtained (step 250) and processed by way of using desynchronizing identification information. The method finds and extracts embedded in the illegal copy of the identification information (step 260). Embedded identification information is detected and extracted using process discovery and retrieval desynchronizing identification information and the secret key. The process of detecting and extracting desynchronizing identification information defines and identifies partners who participated in the making of illegal copies.

IV. A detailed description of operations

FIGURE 3 is a General diagram of the processes, illustrating a process desynchronizing introduction how to use desynchronizing identification information shown in figure 2. In General, the process desynchronizing implementation performs two functions. First, the process introduces unique information in the copy of the multimedia product in an arbitrary (random) zone introduction. Secondly, the process randomly desynchronize different copies relative to each other (using the master key) in different zones of desynchronization. In one variation of the embodiment of the areas of implementation and areas of desynchronization are located in the same places. Alternatively, the zone of introduction can be located in the same places as the area of timing.

With reference to FIGURE 3, the process desynchronizing introduction first things first receives a copy of the multimedia product (step 300). Further, the area of implementation and areas of de-copies of the multimedia product are chosen randomly (step 310). Area of implementation is a place in copies of the multimedia product, where unigrams the identification information. Area of desynchronization is the place where changes are made arbitrary (random) width. These changes are arbitrary width with high probability is different for each user. If the media product is a film, it is preferable that the area of implementation was not one shot or scene. Alternatively, the zone of introduction can be one scene containing several frames. If the media product is sound, the area of implementation may be a clip or record fragment containing part of the recording. Similar requirements apply to the areas of desynchronization. Usually, the clip, in which the embedded identification information, much shorter than the entire record.

The number of zones implementation and timing can be selected randomly or can be specified by the user. In addition, the perceived characteristics of content is also important in this choice. Usually, it is not desirable to introduce labels in zones with low activity (zones with small entropy) for reasons of deterioration of perception and lower levels of secrecy. Of course, this should influence the choice of the number of zones. Even if you have a large quantity of high-level areas suitable for the introduction of labels for the privacy and security), select the number of zones implementation is com what AMISOM between privacy and cost. More zones implementation means more number of identification information and a higher secrecy and, consequently, high costs. On the other hand, fewer zones implementation implies a smaller number of identification information, and less secrecy, and, consequently, a greater number of partners that can't be missed. However, it also means lower costs for detecting and extracting identification information.

Random desynchronization produced for each zone in timing (step 320). Random desynchronization is a new feature of the method of use desynchronizing identification information, which is used in order to make way to use desynchronizing identification information is more protected from the evaluation of the attacks. One of the problems of using identification information is a class organized attacks that occur if you have a large number of copies of the product and if the same scene identified a large number of keys. For example, the partner can take all the frames of this scene and calculate the average value for all frames (also known as appraisal charge, when the partner generates a score for the original unmarked content. As lternative, partner can choose and combine different parts of a scene from different copies, thus forming a new copy (also known as attack of copy&paste (copy-and-paste). These types of attacks (assuming correct performance) tend to destroy all identifying information.

In contrast to these types of attacks (such as the evaluation of the attack, copy&paste attacks, and the like) way to use desynchronizing identification information uses a random desynchronization to arbitrarily change the number of frames that contains the scene. It should be noted that for the implementation of the organized attacks must be made one important requirement, namely that all client copies must be "aligned". After applying a pseudo-random desynchronization each copy contains a different number of frames in the same scene. These quantities are chosen pseudo-randomly for each user, and therefore, they are with high probability is different for each user. This method is applied to a randomly selected areas, called zones of desynchronization. Method of timing, which is a unique way to use desynchronizing identification information, reduces the likelihood that partners will erase the identification information. Thus, the copy in the first scene of the film may contain 28 frames, while copy 2 can contain 32 of the frame. This greatly limits the potential partner to apply concerted attack. This is because the method makes it difficult to synchronize all copies and average it. Moreover, a larger number of copies means the biggest challenges for synchronization of copies, and their combination for the early evaluation of the attack.

Next, information is embedded in each of the areas of implementation (step 330). In General, regions in timing and zone implementation should not be the same, but may overlap. Embedded information, for example, there may be a number of copies of the multimedia product. And finally, get a copy of the media product (step 340) with desynchronizing identifiable information.

FIGURE 4 is a detailed diagram of the processes, illustrating in more detail the work process desynchronizing implementation, shown in FIGURE 3. Creates a copy of the multimedia product (step 400). Then, use the master key for arbitrary choice of the areas of de-inside copies of the multimedia product (step 410). Also, the master key and the hash function used for the random selection of areas of implementation (step 420). The hash value is calculated and implemented in each area of implementation (step 430).

The process of random desynchronization includes random variation Shi the ins zones in timing, so to desynchronizing copies of the product. This process is random in timing involves the use of a master key to randomly calculate a new width for each zone of de and its corresponding changes (step 440). Unique information on the copy is embedded in each zone implementation (step 450). In addition, the secret and a unique key embedded in each zone implementation (step 460). Finally, given desynchronization copy of the product (step 470) with the identification information.

FIGURE 5 is a General diagram of the processes, illustrating a process of discovery and extraction according to the method of use desynchronizing identification information shown in figure 2. The process starts with obtaining illegal copies of the original multimedia product (step 500). Then, it calculates the hash value of illegal copies (step 510). Then, based on the calculated hash values are detected zone implementation (step 520).

Then for each zone implementation and for each secret key is the process of detecting a watermark (step 530). Thus, for each zone implementation is tested each secret key. This eliminates the need for codes identifying information or codes of other types. When using this process with the increase in the cost of computing the mod is et to be detected partners more than is currently available. Alternatively, there may be selected a random number of keys that can be applied to illegal copies. This reduces the cost of computation, but increases the risk that some partners may be lost.

Then there is the detection of the identification information associated with the private secret key (step 540). This information may be, for example, the name and address of the buyer copies of the product. When the identification information is found, it is extracted and associated with the partner for more information on the partner (step 550). Can then be compiled list of partners (step 560).

V. a Typical operating environment

The system and method 100 of using desynchronizing identification information created for a computing environment on a computing device. Below we discuss the computing environment in which work the system and method of use desynchronizing identification information 100. The following description is intended to provide a brief and General description of a suitable computing environment that can be implemented system and method of use desynchronizing identification information 100.

6 illustrates an example of a suitable vychislitel the Noah environment, in which the system and method 100 of using desynchronizing identification information shown in figure 1, can be implemented. Computing environment 600 is only one example of a suitable computing environment and is not intended to imposing any limitation to the scope of use or functionality of the invention. Also, you should not consider a computing environment 600 as having any dependency or requirement relating to any one or combination of components shown in the typical operating environment 600.

The system and method 100 of using desynchronizing identity work in a large number of other General or special purpose computing systems, environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the system and method 100 of using desynchronizing identification information include, but are not limited to, personal computers, servers, handheld computers, laptops, or mobile computer or communications devices such as cell phones and PDAs (personal digital assistants or PDAs), multiprocessor systems, set-top boxes, programmable will consume Liska electronics, network personal computers, minicomputers, large computers, distributed computing environments that may include any of the above systems or devices, and the like.

The system and method 100 of using desynchronizing identification information can be described in the General context mashinostryenia instructions, such as program modules, executed by the computer. Generally, program modules include procedures, programs, objects, components, data structures and so on that perform particular tasks or implement particular abstract data types. The system and method 100 of using desynchronizing identification information can also be tested in distributed computing environments where tasks are performed by remote computing devices linked through a communications network. In distributed computing environments, software modules can be located on both the local and remote computer storage media including memory devices. As shown in FIG.6, a typical system for implementing the system and method 100 of using desynchronizing identification information includes a computing device for General purposes in the form of a computer 610.

Components of a PC is and 610 may include, but not limited to, a processor 620, a memory 630, and a system bus 621, which connects various system components including the system memory to the processor 620. The system bus 621 may be any of many types of bus structures including a memory bus or memory controller, a peripheral bus and a local bus using any of a variety of bus architectures. As an example, but not as a limitation, such architectures include ISA (industrial standard architecture), MCA (microchannel bus architecture), EISA (extended ISA bus), VESA local bus Standards Association Video Electronics) and PCI (bus connection of peripheral components), also known as the expansion bus.

The computer 610 typically includes a set of computer-readable media. Readable computer storage media can be any available media that the computer 610 may access, and include both volatile and nonvolatile media, removable and non-removable media. As an example, but not as a limitation, computer readable media may include computer storage media and communication environment. Computer storage media includes both volatile storage media, and nonvolatile, removable and non-removable media implemented with what ispolzovaniem any method or technology for storage of information, such as computer-readable instructions, data structures, program modules or other data.

Computer media storage include, but are not limited to, RAM, ROM, EEPROM (electrically erasable programmable permanent memory), flash memory or other storage technologies, (CD-ROM), digital versatile disk (DVD) or other memory on the optical disk, magnetic cassettes, magnetic tape, memory, magnetic disk or other magnetic storage devices, or any other medium that can be used to store the desired information and which can be accessible to the computer 610. The communication environment typically includes computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier signal, or other transport mechanism and includes any shipping carrier information.

The term "modulated data signal" means a signal that has established or modified one or more of its characteristics in such a manner as to encode information in the signal. As an example, but not as a limitation, the communications environment includes wired media such as a wired network or direct-wired connection, and wireless media such as sound is, radio, infrared and other wireless media. The combination of any of the above should also be included in the concept of computer-readable media.

System memory 630 includes computer storage media for storing in the form of volatile and/or nonvolatile memory, such as RAM 632 or ROM 631. BIOS 633 (basic input/output), containing the basic routines that help to transfer information between elements within the computer 610, such as launching, is usually written in the ROM 631. RAM 632 typically contains data and/or software modules that are available instantly and/or can directly be processed by processor 620. As an example, but not as a limitation, FIG.6 depicts the operating system 634, the application program 635, other program modules and program data 636 637.

The specified computer 610 may also include other removable/non-removable, volatile/nonvolatile computer storage media for storage. As an example, FIG.6 shows the drive 641 on hard drives that reads from or writes to non-removable, nonvolatile magnetic media, a hard drive 651 on magnetic disks that reads from or writes to a removable non-volatile magnetic disk 652, and the drive 655 on optical disks, which cheat the et from or writes to a removable non-volatile optical disk 656, such as CD-ROM or other optical media.

Other removable/non-removable, volatile/non-volatile computer storage that can be used in a particular operating environment include, but are not limited to, tapes, magnetic tape, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state persistent storage device, and the like. The hard drive 641 typically connected to the system bus 621 via the interface to the non-removable memory, such as an interface 640, storage on magnetic disks 651 and the optical drive 655 typically connected to the system bus 621 using a removable memory interface such as interface 650.

The drives and their associated computer storage media discussed above and depicted in FIG. 6, provide storage of computer-readable instructions, data structures, program modules and other data for the computer 610. In Fig. 6, for example, the drive 641 on hard drives is depicted as storing operating system 644, application program 645, other program modules 646 and software data 647. It should be noted that these components may be the same or different from operating system 634, application programs, 635, other p is ogromnyh modules data and program data 636 637. Operating system 644, application programs 645, other software modules 646 and software data 647 assigned here great numbers to illustrate what they are, at least, different copies. The user can enter commands and information into the computer 610 through input devices such as keyboard 662, microphone 661, a pointing device such as a mouse, trackball and touchpad.

Other input devices (not shown) may include a joystick, game pad, satellite dish, scanner and the like. These and other devices are typically connected to the processor 620 through the user interface 660 input, which is connected to the system bus 621, but may be connected by other interface and bus structures, such as a parallel port, game port, or a USB (universal serial bus). Monitor 691 or display devices of other types are also connected to the system bus 621 through this interface, as the interface 690. In addition to the monitor, computers may also include other peripheral output devices such as speakers 697 and printer 696, which can be connected via the peripheral interface 695 output.

The computer 610 may operate in a networked environment using logical connections to one or bleeeding computers such as remote computer 680. This remote computer 680 may be a personal computer, a handheld device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above with respect to computer 610. The logical connections depicted in FIG. 6, include a LAN (local area network) 671 and WAN (wide area network) 673, but may also include other networks. Such networking environments are commonplace in offices, computer networks, intranets and the Internet.

When used in a local network environments, the computer 610 is connected to a LAN 671 through a network interface or adapter 670. When used in the global network environments, the computer 610 typically includes a modem 672, which may be internal or external, may be connected to the system bus 621 through the user input interface 660, or other suitable mechanism. In network environments, program modules depicted relative to the computer 610 or combinations thereof, may be stored on remote storage devices. As an example, but not limitation, FIG.6 depicts the remote application program 685 hosted on a remote computer 681. It is clear that these network connections are shown as examples and Thu may use other methods for establishing a communication channel between computers.

VI. System components

The system and method 100 of using desynchronizing identification information shown in figure 1, include a set of software modules that enable the system 100 to uniquely marked copies of the multimedia product and later to identify the partners involved in the production of illegal copies of the product. In General, the system 100 includes a feature implementation and feature detection and extraction. Next will be described software modules for each of these functions.

7 is a block diagram illustrating details of the system 100 use desynchronizing identification information shown in figure 1. System 100 essentially has two functions, which is shown in broken lines: (a) desynchronizing implementation; and (b) detecting and extracting identification information. In particular, the introduction of the original digital multimedia product 700 (such as a movie or audio) is received at the input into the system 100 using desynchronizing identification information. The module 710 implementation, which is located in the system 100 using desynchronizing identification information is used to process 700 product in such a way that creates desynchronization copies 720 with identification the information product 700.

As for feature detection and extraction, illegal copy 730 700 product is obtained and analyzed by the system 100 using desynchronizing identification information. Module 740 discovery and retrieval, which is located in the system 100 using desynchronizing identification information is used to detect the embedded identification information and retrieve information from the identification information. This information is used to uniquely identify partners who were involved in making illegal copies 730. Then, the system 100 using desynchronizing identification information can create a list of 750 partners.

FIG is a block diagram illustrating the details of the module 710 implementation shown in FIG.7. In particular, the module 710 implementation includes the module 800 up, the selector 810 zones implementation, the selector 820 areas of timing, the module 830 random in timing and module 840 implementation. The module 800 copy is used for making many copies of the original digital media product 700. Each of these copies is processed by the module 840 implementation. The selector 810 zones implementation randomly selects zones in each of the copies, which will be the introduction of identificatio the Noi information. Similarly, the selector 820 zones of de-randomly selects zones in each of the copies, which will be applied to arbitrary desynchronization using changes the width of the zone.

In some embodiments embodiment, the selector 810 areas of implementation and the selector 820 areas of desynchronization also choose a number of areas of implementation and timing.

Module 830 random desynchronization randomly selects the width of each zone of desynchronization. This means that the width of the zones in timing will be slightly different from copy to copy of the product 700. Under the width refers to the number of frames (if the product 700 is a movie) or the duration of audiosegment (if the product 700 is an audio recording). Module 840 implementation embeds the identification information in each area of implementation for forming desynchronizing copies 720 with identification information of the product 700.

FIG.9 is a block diagram illustrating the details of the module 740 detection and extraction is shown in FIG.7. Module 740 detection and extraction includes the module 900 retrieve the hash value of the module 910 detection zones implementation, the detector 920 identification information and the module 930 extract information about the partner. The module 900 retrieve the hash value analyzes an illegal copy 730 and extracts x is W-values. Module 910 detection zones implementation uses the extracted hash value for comparison with the hash values of the zones of the implementation of the original signal to determine the location of areas of implementation in the copy 730. Detector 920 identification information, searches for the identification information in each area of implementation. Each of the secret keys is used to detect identification information. Module 930 extract information about the partners retrieves information about the partners on the basis of the secret key used when the detected identification information. If the identification information is detected using a specific key, the unique information associated with this key is used to identify the partners that were involved in the production of illegal copies 730. Due to the fact that usually there are a large number of partners, it generates a list of 750 partners involved in the production of illegal copies.

VII. Working example

For a better understanding of the system and method of use desynchronizing identification information described here gives the details of the functioning of the working example. It should be noted that this working example is only one of the ways in which the system and method 100 of using desynchronizing the second identification information can be implemented. In this working example, the system and method of use desynchronizing identification information used for object streaming multimedia information.

The system and method of use desynchronizing identification information can be used for both audio and video applications. In General, different keys are assigned to each user. Function implementation involves applying a pseudo-random transformation of the selected zones. The key for the pseudo-random transformation is specific to the user. These zones are selected using a hash function secure multimedia information. Detection and extraction includes search by enumeration of the set of keys of the users. If one of the keys is appropriate, then this means that the user was involved in the production of illegal copies.

Legend

Let this multimedia signal consists of separate "objects" s₁, s₂, ..., s_Mwhere M is the total number of objects. For example, in a video application, the frame may be treated as an object and M may indicate the total number of frames in the video. Alternatively, in audio applications, the unit of a fixed length can be treated as an object and M may indicate the total number is aka blocks of a fixed length. Let N be the total number of clients (or customers). Accordingly, it is desirable to produce N different copies of the media signal. Let K_iwill the secret key for user i, where 1≤i≤N. Suppose To be a secret master key, which is different from the

.

The hash function

Let the given hash function,

which handles objects

the value of which is in the range

.

The hash function is the operator of the formation of pseudo-random values, which operates on the basis of the secret key K.

Letdenotes the normalized interval Hamming (normalized to L, the length of the output hash value). Suppose that

1.is almost uniformly distributed infor each i.

2.where s_iand s_jdifferent objects.

3.where s_iand s'_iperceptual such objects. Note that the area of probability is determined for different keys on the above criteria. For most practical purposes, 0<T₀<T₁<0.5 and T₀and T₁are separated from each other far enough.

<> “Watermarks” for a group of objects

In this working example uses a pseudo-random function implementation watermark

which works on most R objects. Here K_iis the key for the generator of pseudo-random numbers used for the watermark. Given 1≤r≤R objects, s₁, ... s_r-1, s_rfunction introduction watermarking produces r objects

as a function of a key K_i. Objects

are perceptually such objects

In this context, the function of the introduction watermarking can be considered as pseudo-random transformation, indexed secret key. Next, a working example contains a corresponding detection “watermark”

which works with the same set of objects as a function of implementation. The range of values of the function definition is {0,1}, where 1 indicates the presence of the watermark key K_iand 0 otherwise. Assume that the detection works reliably, ie,

1.whereare attacked versionsso they perceptually such

2.and.

The introduction of labels in the streaming media data

Algorithm implementation the labels for user i(1≤i≤N) is given as follows.

1. Select P from different places, randomized on the basis of the master key K. Let t₁, t₂, ..., t_pdo these places where

2. Find and store the hash value

3. For each t_jis nearby around him in the range

thus is determined by the area

Then, to choose

pseudo-randomly using the master key K such that for all

and area j does not intersect with area k for all

4. For each 1≤j≤P be replaced

where K_iis the secret key for user i.

Decoding of streaming media data

Let the input to the decoder is fed multimedia signal, which consists of objects x₁x₂, ..., x_M'. Note that in General it is possible to have

the discovery Process and retrieve (or decoding), used in the working example, includes the steps:

1. For each 1≤j≤M' is calculated hash value of the received signal h_K(x_j).

2. For each 1≤j≤M' is the following:

a) if there is t_k, 1≤k≤P, such that

then continue with the next step.

b) For all K_i, 1≤i≤N starts the execution of the detection algorithm watermark widththe area around the t_k: calculate

C) For each 1≤i≤N if d_i=1, to declare that the label user i has been detected in the received input data.

VIII. Improved algorithm timing based on a hash function of the image for digital video.

In the working example in the previous section presents a description of the General algorithm of the system and method of use desynchronizing identification information. In step 2 of algorithm implementation of the label and the step 2A of the algorithm for decoding a working example of one hash value was used to determine the location of introduction of the label. In practice, however, this is not enough. In particular, for digital video, the hash values of one frame is often not enough for a reasonably accurate determination of the places of implementation. Thus, this section presents an improved version of the procedure of search areas based on hash functions. This method uses multiple hash values instead of a single hash value.

In this section, discussion is limited to digital video and robust hash functions images that are applied to individual frames (individual images). However, it should be noted that this methodology can be extended to a set of frames or digital audio signals. As shown in FIG.9, an improved method of search areas based on hash functions presented in this section can be applied in module 910 detection zones implementation.

The problem is that the video with embedded labels can be changed, which will cause the problem of time synchronization detection or decoding. Often time attack is of this class. In particular, any type of malicious attacks that change the order of the video content along the time axis (such as inserting scenes, changes and swap, rounding and interpolation of time and shifts), can create potential problems for the decoder. Moreover, even in nationalizing cases it is possible to cut and paste video or insert the advertisement in the video for a variety of purposes in the entertainment business. Therefore, the region with the embedded tag in the original video may not be in one place in the resulting type is O. In such cases, the search of places of penetration marks on the receiver is a non-trivial problem. To overcome this problem, an improved method of determining the coincidence of the zones based on hash functions presented in this section allows to achieve time synchronization in digital video by using robust hash functions images for detecting the introduction of labels.

This method assumes that the result is robust hash functions image is invariant to the introduction of the watermark, as well as acceptable attacks (in other words, maintaining visual quality). Further, for completeness, will be defined in the legend for this section. It should be noted that the legend in this section differ from the legend in section VII.

Legend

Bold lowercase letters represent frames, lowercase letters denote the indices of elements in sets or vectors. Let N be the total number of frames we are interested in the original video, and {s₁,s_2,...,s_N} and {x₁,x₂, ...,x_N} denote the original video frames and the video frames with embedded tags. Let NN denotes the total number of frames in the attacked video (which is input to the decoder) and {y₁,y_{2 , ...,yNN} denotes the attacked video. It should be noted that, in General, N is not equal to NN. In other words, the length of the attacked video may differ from the length of the original video with embedded tags. Let M is the total number of zones implementation (i.e. areas where the identification information has been embedded). Let h(.) and d(.,.) are robust hash function image (which is suitable for use in the method of the search areas based on hash functions, the description of which is given in section VII) and the interval between the two Hamming binary inputs, respectively. Let td(.,.) indicates the time interval (with direction) between any two frames of this type, for example, td(sm,sn) = n-m.}

The encoding and decoding

On the side of the module introduction for each zone implementation j (1<=j<=M), K frames selected to represent the temporary space in this zone. These representative frames is known as a "milestone" in the terminology used in this section and denoted as {P_jk}, where j (ACC. k) correspond to the areas of implementation (in accordance with the index milestones within this zone), 1<=j<=M, 1<=k<=K. it is Obvious that the set {p_jk} is a subset (subset) {s₁,s₂, ...,s_N}. How to choose {p_jk} for zone j here is not absurde the Xia. However, in General, as a practical way, milestones should be selected approximately uniformly within the zone of introduction to present this area as accurately as possible. Let {a_jk} are the hash values {p_jk}, i.e. for each j,k a_jk=h(p_jk). The hash values {a_jk} passed to the receiver as additional information. In other words, it is assumed that the receiver (or decoder) is well aware of {a_jk}.

The hash values {a_jk} used to lock the receiver to adjust the position of the attacked video {y_i} for each zone j implementation. To perform this task, the following process must be taken into account, where ε and α are parameters that depend on user:

1. Find {b1, b2, ..., bNN}, where b_i=h(y_i), 1<=i<=NN.

2. For each milestonep_jkformed perceptual such sets (sets) F_jkfrom {y_i}, where F_jk={yi|d(bi,a_jk)< α, 1<=i<=N}.

3. For each zone j implementation is formed by the set of G_jwhich consists of all "appropriate time" K-tuples of such sets (sets) F_jk:

G_j={g_j1,g_j2, ...,g_jK)| |td(g_jk,g_j,k+1)-td(p_jk,_pj,k+1)|< ε,g_jkE F_jk, 1<=k<K}.

4. To find the optimum K-tuple for zone j introduction from the point of view of similarity by using the hash values: ( g_j1^*,g_j2^*, ...,g_jK^*) = argmin Σ_k=1^Kd(h(g_jk),a_jk), where the minimization is performed over all elements of G_j.

5. K-tuple (g_j1^*,g_j2^*, ...,g_jK^*) determines the j-th zone implementation in {y_i}.

Note

It should be noted that when using this direct process, stages 3 and 4 require O(K P_k=1^K|F_jk|) operations. The reason for this is that the total number of possible K-tuples is N_k=1^K|F_jk| (i.e. the degree K) and for each K-tuple is required to perform O(K) operations to find the optimal conformity with accounting perceptual similarity (in other words, the interval of Hamming for the original hash values). However, in these operations, there is a redundancy, because there are K-tuples that have common elements for which the interval between Hamming hash values does not require recalculation. Thus, from the point of view of computing is more efficient to perform steps 3 and 4 together, what can be done using dynamic programming.

Pseudo-code

The following pseudo-code illustrates the basic idea of using dynamic programming. It can replace the above steps 3 and 4 for pleasure is about j. Moreover, let F_jk= {g_jkl}, where l is the serial number of each element of the set.

I. set themindistequal to a very large number, andk=1, l=1.

II. While1<=l<=F_jkto do:

II.I. to Initialize K-tuplepathso, whatpath(m)=0ifm!=kandpath(k)=g_jklwherepath(k)isk-mpath.

II.II. Initializedist=d(ajk, h(path(k))), VALIDITY=GOOD.

II.III. to use the functionFINDOPTPATH(path,dist,k+1,l, VALIDITY)that is defined below.

II.IV. Increaselon1, go to step 1.

function FINDOPTPATH(path,dist,k,l,VALIDITY)

I. initialize ll=1.

II. whilell<=|Fjk|to do

II.I. to calculate

timedist=|td(path(k-1),g_j,k,ll)-td(p_j,k-1,p_jk)|.

II.II. If (k<K) and (timedist > ε),

II.II.I. to establish VALIDITY=BAD.

II.II.II. to apply a function

FINDOPTPATH(path,dist,K,ll, VALIDITY).

II.III. Else if (k<Kand (timedist <= ε),

II.III.I setpath(k)=g_j,k,lland increase thedistond(a_jkh(path(k))).

II.III.II to Apply a function

FINDOPTPATH(path,dist,k+1,ll, VALIDITY).

II.IV. Else if (k=Kand (dist<mindistand (VALIDITY=GOOD), setmindist=distandminpath=path.

II.V. increaselon1, proceed to step II.I.

The preceding description of the invention has been presented for illustration and description. It is not a Ki is exhaustive or limiting of the invention just described in the form. There are many possible modifications and variations in light of the disclosed above. This means that the scope of the invention is limited not by this detailed description, but rather by the claims appended thereto.

1. The computer performs a method for desynchronizing mark identification information of the digital data containing the steps:
choose the zone of introduction into digital data for embedding identification information;
choose the area of desynchronization in the digital data for the timing of copies of digital data with respect to each other;
perform random desynchronization for each of the zones in timing to randomly change the width of each zone in timing and implement the identification information in each of the areas of implementation for forming desynchronizing marked with the identification information of the digital data.

2. The computer performs the method according to claim 1, further containing the step of randomly selecting areas of implementation and areas of desynchronization.

3. The computer performs the method according to claim 1, further containing the step of using the master key and a hash function for a random selection of areas of implementation.

4. The computer performs the method according to claim 3, additionally containing finding and saving the hash values for each of the zones implementation.

5. Performed computer is m the method according to claim 1, additionally contains the use of the master key for the random selection of areas of desynchronization.

6. The computer performs the method according to claim 1, in which step of the random timing of each of the areas of timing further comprises using the master key to randomly calculate the width of each of the zones of de so that this width varies from copy to copy digital data.

7. The computer performs the method according to claim 1, additionally containing the generation of multiple copies of digital data and a mark of identification information each copy.

8. The computer performs the method according to claim 1, additionally containing the implementation of the unique secret key in each of the areas of implementation.

9. Machine-readable media having executable computer instructions for performing the computer performs the method described in claim 1.

10. Machine-readable media having executable computer instructions for desynchronizing mark identification information of the digital multimedia data, to perform steps generate multiple copies of digital multimedia data;
randomly select the zone implementation in each copy;
randomly select the area of the timing in each copy;
calculate random width DL is each of the zones of de-thus, that the width of each of the zones in timing varies from copy to copy; and
implement the information in each area of implementation for forming desynchronization marked with the identification information copies of the digital media data.

11. Machine-readable media of claim 10 in which the step of randomly selecting areas of implementation further comprises the step of using the operator computing a pseudo-random value and the master key.

12. Machine-readable media according to claim 11, in which the operator computing a pseudo-random value is a hash function.

13. Machine-readable media of claim 10, further comprising stages of finding and storing the hash values for each of the zones implementation.

14. Machine-readable media of claim 10, in which a random selection of areas in timing further comprises the step of using the master key.

15. Machine-readable media of claim 10, in which the calculation of random width for each of the zones in timing further comprises the step of using the master-key to calculate random values for width and change this width, respectively.

16. Machine-readable media of claim 10, in which the introduction of information in each of the zones of introducing further comprises introducing unique information about copies of the unique secret key.

17. Machine-readable media according to clause 16, which further comprises the step of cataloging information that is unique to the copy so that each of the multiple copies is associated with a specific person.

18. Machine-readable media according to clause 16, which additionally contains Association information that is unique copy with a unique secret key.

19. Machine-readable media on p, in which the unique information is the number of a particular copy of the multiple copies.

20. Machine-readable media according to 17, further comprising stages:
extracting unique information about copies of illegal copies of digital multimedia data and
the definition of unique information about copies of the identification information on the persons involved in the production of illegal copies.

21. Method of detecting and extracting the identification information from the digital data, comprising:
the calculation of the set of hash values of the digital data;
detection zones introduction into digital data using the multiple hash values;
the use of multiple secret keys to perform the detection of the identification information of each of the areas of implementation and the detection identification information associated with the secret key.

22. the manual on item 21, optionally containing extract information about the partner of the identification information.

23. The method according to item 22, further containing a list of partners of the information about the partner representing the list of persons who collaborated in the formation of digital data.

24. Machine-readable media having machine-readable instructions, which when implemented by one or more processors are forcing one or more processors to perform the method according to item 21.

25. The flagging system desynchronizing identification information for mark desynchronizing identification information copies of the original digital multimediynogo product and identification of partners involved in the production of illegal copies of the original digital media product that contains:
module implementation for embedding identification information in each copy of the product through the introduction of identification information in each of the zones introduction into digital data, and zone implementation is selected and desynchronization relative to each other to form desynchronizing marked with the identification information of the digital data in these areas of implementation; and
module detection and extraction for the detection of embedded ID is authorized information by identifying areas of introduction into digital data, extraction of these zones introduction the embedded identification information and retrieve information about the partner of the above-mentioned identification information for identification of the partners involved in the production of illegal copies of the digital multimedia product.

26. The flagging system desynchronizing identification information A.25, in which the module implementation contains a selector zone implementation for the random selection of areas of implementation in each copy of the product that you want to embed the identification information.

27. The flagging system desynchronizing identification information A.25, in which the module implementation further comprises a selector zone in timing for the random selection of areas in timing in which you want to apply deliberate desynchronization.

28. The flagging system desynchronizing identification information item 27 in which the module implementation module further comprises a random desynchronization for the random selection and application of the width of the zones of de so that the width of the zone in timing varies from copy to copy of the product.