WO2000056059A1 - A method and apparatus for generating multiple watermarked copies of an information signal - Google Patents
A method and apparatus for generating multiple watermarked copies of an information signal Download PDFInfo
- Publication number
- WO2000056059A1 WO2000056059A1 PCT/GB2000/000767 GB0000767W WO0056059A1 WO 2000056059 A1 WO2000056059 A1 WO 2000056059A1 GB 0000767 W GB0000767 W GB 0000767W WO 0056059 A1 WO0056059 A1 WO 0056059A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- watermarked
- segment
- information signal
- receiver
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
-
- 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
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32288—Multiple embedding, e.g. cocktail embedding, or redundant embedding, e.g. repeating the additional information at a plurality of locations in the image
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0435—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N2201/3204—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to a user, sender, addressee, machine or electronic recording medium
Definitions
- the present invention generally relates to a method of watermarking an information signal to generate multiple different watermarked copies of the information signal.
- the electronic information can be watermarked to include information identifying the recipient of the information e.g. a unique user ID that does not perceptually alter the quality of the electronic information.
- the watermarking technique should not be evident in the electronic information.
- one form of watermarking documents is to vary spaces within the documents in accordance with a particular algorithm.
- the audio signal can be modified in an inperceptible manner in order to provide the watermarking.
- the images can be watermarked by varying the compression parameters. This can similarly be applied to MPEG compression parameters for video images.
- Electronic information is commonly transmitted from an information source to a recipient over a network.
- networks are a cable network and the Internet or an intranet.
- the source can watermark the electronic information transmitted to the recipient with information identifying the recipient so that in an event illegal copies are detected, the source of the copies can be determined from the watermark.
- Multicast transmission over networks has the advantage over unicast transmission in that the sender need only transmit a single copy which is transmitted to multiple recipients. However, because the source only transmits a single copy, it has not been possible using the multicast transmission of the prior art for each recipient to receive a uniquely watermarked copy of the electronic information.
- a recipient In multicast sessions over networks, conventionally a recipient will subscribe to the transmission and thus the source is able to transmit the electronic information in an encrypted form. The subscribers are given the key to decrypt the electronic information when they receive it. This offers security in that only recipients which have the key are able to decrypt the electronic information. This does not however prevent illegal copies being made of the legitimately received and decoded electronic information. It would however, be of great benefit to be able to trace the origin of any illegal copies.
- routers in the Internet are required to route electronic information, possible sources of illegal copies of the electronic information include not only the legitimate recipients, but also network operators having control over the routers through which the electronic information passes.
- the present invention provides a method of watermarking an information signal to generate multiple different watermarked copies of the information signal.
- the information signal is segmented into information segments and a plurality of differently watermarked versions of each information segment are generated.
- One of the watermarked versions of each segment for each one of the multiple different copies to be generated is selected to generate a sequence of differently watermarked segments for each copy.
- the sequence is probabilistically unique for each copy. The selection is controlled on the basis of information on the identity and/or location of the receivers of each copy.
- each copy of the information signal is watermarked using a unique sequence of watermarks .
- the present invention is applicable to unicast transmission, the present invention is particularly beneficial when used with multicast transmissions over a network.
- the intelligence available at nodes in the network is utilised to carry out the selection process.
- the source of the information signal generates the plurality of differently watermarked versions of each segment of the information signal. These are transmitted to a node in the network.
- Each node in the network then selectively filters out one of the watermarked versions of each segment dependent upon the position of the node in the tree and the path down which the information signal is to be transmitted before passing the packet downstream.
- This selection is preferably carried out pseudo-randomly using the information on the network node position and path as a key for the pseudo-random number generation.
- the selection takes the form of the selection of only one of the watermarked versions of each segment to be transmitted to the receiver so that the receiver only receives one watermarked version of each segment.
- the selection process in this final node is additionally dependent upon information identifying the receiver.
- each node in the network filters out at least one of the watermarked versions, in order for there to be at least two watermarked versions received by the final node in the network to which a receiver is connected, the number of generated watermarked versions must be greater than the longest route between the source and a receiver i.e. a route having the largest number of nodes. Because in IP (Internet Protocol) multicast sessions in particular, receivers are able to actively join and leave multicast sessions, the longest route in a multicast session may vary during the session. Thus, information on the number of nodes in each route between the receivers and the source is monitored at the source so that the number of differently watermarked versions of each segment of the information signal can be varied as necessary.
- IP Internet Protocol
- the origin of copies of the information signal can be detected by using stored information on the identity of the recipients, and a copy of the information signal .
- the watermarking and selection procedure By applying the watermarking and selection procedure to the original information signal and comparing it with the copy to be checked, it is possible to identify the receiver from which the copy originated.
- the information required in order to identify the origin of a copy is information on the identity of the receiver and information on the route taken by the copy through the network. This information is stored during transmission to be used if necessary to trace the origin of suspected illegal copies.
- Figure 1 is a functional diagram of the present invention
- Figure 2 is a schematic diagram of an example of a network in which a source S multicasts an information signal to a plurality of receivers R to R 7 ;
- Figure 3 is a schematic diagram of the network tree structure of the network of Figure 2 ;
- Figure 4 is a flow diagram of the steps carried out at a router in the configuration of the network to carry out the selection process in accordance with an embodiment of the present invention
- Figure 5a is a flow diagram illustrating the steps carried out at routers in the network to pass packets onto other routers in accordance with an embodiment of the present invention
- Figure 5b is a flow diagram illustrating the steps carried out by a final router to pass packets onto a receiver in accordance with an embodiment of the present invention
- Figure 6 is an illustration of the structure of the watermarked data generated by the source in accordance with an embodiment of the present invention.
- Figure 7 is an illustration of an example of the data structure received by a receiver in accordance with an embodiment of the present invention.
- Figure 8 is a diagram of the tree structure of the network of Figure 3 illustrating the flow of packets over the network to the receivers in accordance with an embodiment of the present invention
- Figure 9 is a flow diagram illustrating the steps carried out when a new subscriber wishes to join a multicast session in accordance with an embodiment of the present invention
- Figure 10 is a schematic diagram of the structure of the source apparatus for the information signal in accordance with an embodiment of the present invention
- Figure 11 is a schematic diagram of a router in accordance with an embodiment of the present invention.
- Figure 12 is a flow diagram of the analysis method of an embodiment of the present invention.
- FIG. 1 illustrates the functional components of a generalised embodiment of the present invention.
- An information signal source 2 provides the information signal for which multiple unique watermarked copies are required.
- An information segmenter 3 segments the information signal from the information signal source 2 and inputs this into a watermarking module 4 which will carry out the watermarking of the information segments .
- the watermarking module 4 generates a plurality of differently watermarked copies of each segment using watermarking parameters stored in the watermarking data store 1.
- the plurality of differently watermarked copies of each information segment are then received by a selector 5 which selects a watermarked copy for each of the information segments for each of a plurality of receivers 7 in dependence upon information on the receivers 7 stored in the receiver data store 6.
- the selector 5 will generate M unique sequences of differently watermarked segments from a stream of information segments each having N different watermarked copies.
- the benefit of the present invention is that the number N of differently watermarked sequences generated in the watermarking module 4 is less than the number M of uniquely watermarked copies of the information signal generated and received at the receivers 7 i.e. M > N.
- the processing required in the generation of the multiple uniquely watermarked copies is thus greatly reduced because the watermarking operation is carried out less times.
- the selection of watermarked copies of each segment is a simple operation which is not computational intensive compared to the generation of watermarked copies.
- the present invention thus provides for a considerable reduction in processing requirements particularly when M » N.
- An analyser module 8 is also provided to enable illegal copies of the information signal to be analysed to identify the receiver from which it originated.
- the analyser module needs to have copies of the information signals received by the receivers 7. These can either be provided directly by the selector 5 or using information from the receiver data store 6 , the watermarking data store 1, and the information signal source 2, they can be reconstituted to predict what information signals would have been received by the receivers 7.
- An input device 9 is provided to allow the input of the alleged illegal copy of the information signal into the analyser module 8 for comparison with the predicted copies of the information signal for receivers. The comparison will determine from which receiver the alleged illegal copy originates.
- This embodiment of the present invention is applied to the multicast transmission of an information signal over an IP (Internet Protocol) network such as the Internet or an intranet.
- IP Internet Protocol
- this embodiment of the present invention particularly benefits from the advantages of the present invention because the processing required to select the watermarked copies of each segment is distributed among the nodes of the network.
- the source need only generate the N multiple watermarked version of each segment without actually generating the unique watermarked copy for each receiver.
- This embodiment to the present invention is able to achieve this because of the intelligence which can be made available within routers in IP networks.
- Figure 2 is a schematic diagram of an IP network in which a source S multicasts an information signal over the network to receivers R x to R 7 who subscribe to the multicast session.
- the source S is arranged on a local area network 10 which has an interface to a node N x (a router) in the network.
- the node Nj has IP connections to two other nodes N 2 and N 3 .
- the node N 2 has IP connections to two receivers R : and R 2 , as well as a connection to another node N A and to node N 4 .
- Node N A has a connection to other nodes (not shown) and to a node N B which interfaces to a local area network (LAN) 11. In the LAN 11 there are no receivers which have subscribed to the multicast session.
- the node N 3 has an IP connection to a node N 5 which in turn has an IP connection to a receiver R 5 , an IP connection to other nodes (not shown) and an IP connection to node N 6 .
- Node N s has IP connections to two receivers R 6 and R 7 and IP connections to other nodes (not shown) .
- Node N 4 has IP connections to four receivers only two of which R 3 and R 4 are subscribers to the multicast session.
- a source path message (SPM) is transmitted to the node N, which broadcasts the SPM to the other nodes in the network.
- SPM source path message
- This enables the nodes to identify the path of the multicast session. For example, in node N 4 there are two possible paths from nodes N 2 and N 3 . However, the IP connection to N 3 is preferred for example because it is shorter and thus the IP connection between N 2 and N 4 is dropped for the multicast session.
- nodes N A and N B there are no subscribers requiring receipt of the multicast information and thus nodes N A and N B play no part in the multicast session: they do not require the information signal to be transmitted to them.
- the node N B will know the route back to request connection to the multicast session and will thus connect to node N A which in turn will connect to node N 2 thus forming a route to the new receiver on the LAN 11.
- the nodes in the network store information on multicast sessions and IP connections to enable a receiver to subscribe and join a multicast session which can entail the opening up of new routes through the network.
- the routes taken by information signals through the network can thus be redrawn as a tree structure as illustrated in Figure 3.
- Nodes which are not in the communication route between the source and the receivers are not relevant as will become clearer hereinafter.
- a node is assigned a unique label. Each level corresponds to a number of "hops" between nodes.
- the letters indicate the interface IP addresses.
- node 1 is labelled ab
- node 2 is labelled abce
- node 3 is labelled abdf
- node 4 is labelled abdfkm
- node 5 is labelled abdfer
- node 6 is labelled abdflrtv.
- FIG 4 is a flow diagram illustrating the steps carried out at each router in order to set up the router ready to receiver and filter the information signal.
- a source path message (SPM) is transmitted by the source which wishes to set up a multicast session. This is then received by the first hop router and it propagates through the network from router to router as will be described hereinafter.
- a router receives one or more source path messages (SPMs) and adds the incoming interface IP address to it. If the router receives SPMs for more than router, it selects the SPM which was received first i.e. the one which provides the shortest route.
- the router determines the label from the SPM which comprises the received SPM and the added incoming interface IP address.
- the outgoing interface IP address is then added to the SPM and this is transmitted over the interface.
- the router determines whether there are any more interfaces which requires the SPM message to be transmitted over. If so, the process returns to step S4.
- Each router includes a random number generator as described later with reference to Figure 11.
- a random number generator is initialised using the router label and the interface IP address as the key for each interface.
- the interface address is the IP address of the router on the interface to the next router or to a receiver. Where more than one router or receiver is connected to the router a unique random number sequence must be generated for segments passing down each connection and thus the psuedo random number generator must be initialised using a unique key for each connection. Thus a separate pseudo random number sequence is generated for each IP address (i.e. interface).
- the IP address provides the uniqueness indicating the path from the router and the router label provides the information identifying the router.
- the random number generator key comprises not just the router label, and the IP address on which the receiver is connected, but also the unique ID for the receiver e.g. the subscriber ID.
- the router is then ready to receive the information signal and carry out the filtering (selection) procedure using the random number generator as the selector to determine which packets pass through the router.
- the last hop router thus stores not just a label but also the receiver ID information for receivers connected to it. This information together with the source path message (SPM) is transmitted back to the source S to be stored for later analysis if necessary in order to determine the origin of illegal copies of the information signal.
- step S10A packets arrive at the router.
- step S11A the router waits until a whole transmission group i.e. all of the multiple copies for a segment are received.
- step S12A one packet which is identified in the group by the random number generator is discarded.
- the remaining packets in the transmission group are then transmitted to the next router in step S13A.
- Figure 5b is a flow diagram illustrating the steps for forwarding data at a last hop router to a receiver.
- step S10B packets arrive at the last hop router and the router waits in step SUB for the whole transmission group to be received. Once all packets of the transmission group have been received one of the packets which is identified by the value generated by the random number generator is selected in the group and in step S13B the selected packet is transmitted through the receiver.
- each receiver only receives one packet in a transmission group i.e. only one watermarked copy of each segment of the information signal.
- FIG. 6 illustrates the data structure of the watermarked information signal generated at the source.
- a transmission group T comprises multiple differently watermarked versions of a segment of the information signal.
- there are five different watermarked versions A, B, C, D and E i.e. N 5.
- Each transmission group (1,2....P) is transmitted sequentially.
- the information signal is segmented into P segments and thus there are P transmission groups transmitted i.e. 5P packets.
- the data structure of Figure 6 is received by the first node N x .
- a random number generator is initialised using the same label (1) for the node but using the interface IP addresses of each path to pseudo-randomly select one of the packets in each transmission group to be filtered out.
- nodes N 2 and N 3 receive transmission groups of length 4.
- Nodes N 4 and N 5 then receive transmission groups of length 3 and the furthest node N 6 receives a transmission group of length 2.
- a random number generator is initialised using the node label, the IP address and the receiver ID in order to select from each of the received transmission group one packet to be transmitted to the receiver.
- each receiver receives only one packet for each segment.
- An example of the unique watermark sequence of segments is illustrated in Figure 7 for receiver R x .
- each node in the network receives a transmission group of length N-D where D is the depth of the node along the route i.e. the number of previous nodes or "hops" through which the transmission groups have passed.
- D is the depth of the node along the route i.e. the number of previous nodes or "hops" through which the transmission groups have passed.
- the number of watermarked versions of each segment received at a node having a receiver must be at least 2 and thus the number of packets in a transmission group must therefore be at least D for the longest route to a receiver.
- N the number of segments required for the sequence of watermark segments to be unique is reduced.
- each transmission group will contain headers indicating the number of segments in a transmission group. This is continuously changed at each node as the number of packets in a transmission group is reduced as the group passes through the network.
- Each packet within the transmission group also contains a header identifying its sequence in the transmission group. Once again this will need to be updated as packets are filtered out by routers e.g. if a router receives A, B, C, D, E and filters out D, E must be relabelled as the 4th packet in the transmission group.
- a place holder packet can be transmitted indicating to subsequent routers that the packet has been intentionally discarded. This place-holder packet can be transmitted in conjunction with a following data packet to avoid the necessity to transmit a separate packet.
- Multicast IP sessions allow subscribers to join and leave the sessions at any point i.e. midway through reception of an information signal.
- the routes taken by the information signal through a network can change e.g. if a router fails.
- the source must continuously receive updated information on the paths taken by the information signal. This is achieved using the source path message (SPM).
- SPM source path message
- the SPM is periodically broadcast over the network and information is received from the last hop routers connected to receivers giving route information to the source. If the route information indicates that the largest number of routers D in a path to a receiver is greater than or equal to the number of differently watermarked versions of each segment N, the source must increase the number of differently watermarked versions of each segment so that N > D.
- the bandwidth required for the transmission of the watermarked information signal over the network can be reduced by reducing N whilst still maintaining the relationship N > D.
- the source monitors the network in order to monitor the routes to the receivers. If the number of differently watermarked versions of each segment is changed, the time at which it is changed i.e. the segment of the information signal at which the change takes place, is stored since this will affect the sequence of watermarked segments at each receiver.
- step S20 the source assigns subscribers unique IDs and stores subscriber information.
- the receiver acquires the subscriber ID from the source.
- step S21 the new subscriber contacts the nearest router (last hop router) and communicates to it the unique subscriber ID which is required in order to join the multicast session.
- step S22 the router then waits for receipt of the SPM, if it has not already received it.
- the router then sends to the source in step S23 the source path message (SPM) which indicates the route to the router, the subscriber ID identifying the new receiver, and the ID of the first data packet which is sent to the receiver i.e. an identification of the time at which the receiver first started to receive the copy of the information signal.
- SPM source path message
- step S24 the new depth d of the network for the new subscriber is determined from the source path message (SPM).
- step S25 it is determined whether this new depth is larger than the current depth i.e. is d > D. If so, in step S26 the source increases the number of differently watermarked versions of each segment N to maintain the relationship N > d and in step S27 the last hop router then receives and forwards the information signal to the receiver. If in step S25 it is determined that the new depth is no greater than the current depth D used by the source to determine N, in step S27 the last hop router receives and forwards the information signal to the receiver. It should be noted here that the last hop router before the receiver will not transmit packets to the receiver unless it receives multiple copies to choose from.
- the last hop router must receive at least two differently watermarked copies of each segment so that the pseudo random number generator can be used to randomly select from these for a number of receivers which may be connected to the router so that each receiver receives a unique sequence of watermarked segments.
- IP multicast security techniques can be used such as encryption of the input information signal.
- a subscriber will be provided with the key to enable them to decrypt the information signal .
- the key for the encryption is usually common to all receivers of the multicast session.
- headers used for identifying the number of packets in a transmission group and for identifying the packet sequence in the transmission group are not encrypted since the routers need to use the header information for the filtering process.
- the tree topology together with the receiver ID is the secret used by the source to perform the watermarking. Participating routers should therefore refuse requests to reveal any part of that topology.
- the selective discard function aims to provide the multicast routers and their clients with the minimum degree of freedom possible in order to facilitate the later tracing of cheating routers or users. Every router in the tree indelibly affects the stream by dropping certain packets; thus a cheating router should be identifiable as every user downstream from that router would need to collude to reproduce the watermark data passing through the router. The higher up the tree, the less likely it is; the lower down the tree the easier to eliminate targets from an investigation.
- any host on that network can receive the same packets with no extra effort.
- Non-subscribers on a network can intercept such packets, but do not have the decryption key needed to read them.
- two legitimate subscribers on the same sub-network will receive the same watermarked data. This however, is typically not a problem since multiaccess sub-networks are typically under the administrative control of a single agency. If one of the users of such a network illegally copies the information signal, it is traceable to the agency controlling that network and this is sufficient in most cases.
- the source of this embodiment to the present invention can comprise any suitably programmed computer with network access.
- a schematic diagram of the structure of such an apparatus will now be described with reference to Figure 10.
- the computer apparatus includes a readonly memory (ROM) 22 which contains the conventional bios for the computer system.
- Random access memory (RAM) 21 is provided as the working memory to be used by a processor 23 during the processing operations.
- the processor 23 accesses a storage device 24 in order to load up programs to implement a watermarking application 23a, an encryption application 23b, a network monitoring application 23c and an analyser application 23d.
- the watermarking application 23a carries out the segmentation and watermarking of the segments to generate a plurality of differently watermarked copies of each segment using watermarking parameters stored in the storage device 24 together with information on the depth of the tree D i.e. to determine the number N of differently watermarked copies of each segment generated.
- the encryption application 23b carries out conventional encryption of the watermarked segments for transmission over the network.
- the network monitoring application 23c carries out monitoring functions in order to receive information from the network on routes to receivers, receiver IDs', information on the depth of the tree, which can be retrieved from the source path message (route information), and the times when receivers receive the first segments i.e. an identification of the first segments received by the receivers. This information is then stored in the storage device 24.
- the processor 23 also implements a program module from the storage device 24 in order to implement an analyser application 23d for the analysis of a watermarked copy of an information signal in order to determine the receiver or receivers from which it originated. This process will be described in more detail hereinafter.
- a removable memory device 33 is provided to enable the copy of the information signal to be analysed to be input.
- a removable memory device 33 can for example be a floppy disk drive or CDROM.
- the copy of the information signal to be analysed can be input over the network 30 via the network interface 25.
- the information signal to be multicast can be obtained from an information source in the form of a database 26, or it can be obtained real time via an input/output device 27 which is connected to, in this example, a video camera 28.
- the information signal input from the input/output device 27 or the database 26 is watermarked by the watermarking application 23a operated by the processor 23 and encrypted by the encryption application 23b before being multicast over the network 30 by the network interface 25.
- the computer apparatus is also provided with a conventional display 29, a keyboard 31 and a pointing device 32 to allow a user to interface with the computer apparatus.
- the storage device 24 stores:
- a copy of the multicast information signal is either stored in the storage device 24 or a reference to its storage location in the database 26 is stored.
- Other parameters which are stored in the storage device 24 are: a database of valid users so that when a request is made during a multicast session the validity of the request can be checked, and data on the encryption scheme used to encrypt the multicast information signal.
- Watermarked segments will be stored temporarily in the RAM 21. Instead of storing the watermarking scheme, and parameters used for each packet and a copy of the original information signal in the storage device 24, the watermarked segments can be stored.
- the storage device 24 also stores the multicast addresses to be used for the multicast session or sessions and the transmission protocol. Further, if the information signal is compressed or encoded, information on the compression or encoding scheme is stored.
- a functional diagram of the functional components of a router 40 used in the network 30 for switching the information signal over routes in the network will now be described with reference to Figure 11. Many of the functions illustrated and described hereinafter are implemented by a processor operating in accordance with processor instructions.
- the router 40 is provided with a first interface 41 which receives data from either another router further up the tree or from the source. Also SPMs' are received and transmitted. Received data is passed through a filter module 42 for filtering the data to remove at least one of the packets in a transmission group.
- the filter module 42 operates under the control of a random number generator (RNG) 43.
- RNG random number generator
- the random number generator 43 is initialised using parameters stored in a volatile memory 44.
- the volatile memory 44 stores a label for the router, the IP address for each interface and the current state of the random number generator 43. Data is thus filtered by the filter module 42 and is output to the second interface 45 and the third interface 46. SPM's are received by the interface 41 and are utilised by the pragmatic general multicast (PGM) protocol engine 47.
- PGM protocol engine 47 adds the IP address of the router 40 to the SPM and returns the SPM to the source via the interface 41. It also passes the SPM message to the second and third interfaces 45 and 46 for output to the next routers or the receivers.
- the router 40 also includes a subscription manager 48 for managing subscriptions by receivers.
- subscriptions messages are sent to the respective interface 45 or 46 and are then passed to the subscription manger 48.
- the subscription messages include the subscriber ID and this is stored in the volatile memory 44 for use in addition to the router label and the interface IP address for the initialisation of the random number generator 43 for an interface to the receiver. Also the subscriber ID in a volatile memory 44 is passed back to the source.
- the subscription messages also include requests to join and leave a multicast session.
- the PGM protocol can be replaced with any suitable protocol e.g. general multicast transport service (GMTS).
- GMTS general multicast transport service
- step S30 a packet is selected and in step S31 all recipients of packets i.e. both routers and users are marked as suspects. This list of suspects will be reduced during the following steps in order to try to predict the most likely suspect.
- step S32 the operation starts by predicting the operation of the first hop router.
- step S33 the next interface on the list of suspects at the router is considered and in step S34 it is determined whether the random number generator is initialised for this interface on this node. If not in step S35 the random number generator is initialised with the router label and the interface ID (and for the last router also the subscriber ID) .
- step S36 the random number generator is then run to determine the packet sequence.
- step S37 it is then determined whether the router sent the packet on this interface. If so in step S38 it is determined whether there is a router at the end of the interface. If so, the process moves down the tree in step S39 to the router at the end of the interface and the process returns to step S33. If in step S38 it is determined that a receiver is at the end of the interface the process then moves on to step S41.
- step S40 If in step S37 it is determined that a router did not send the packet, in step S40 the interface and all its children are removed from the list of suspects. Then in step S41 it is determined whether there are any remaining suspected interfaces on the router. If so the process returns to step S33. If not in step S42 it is determined whether the router being considered is the first hop router. If not in step S43 the parent router is then considered and the process returns to step S41. In this way by continuously looping in steps S41, S42 and S43 the tree can be traversed back up to the first hop router.
- step S42 it is determined that the router being considered is the first hop router, then the whole of the tree will have been traversed for the selected packet and thus in step S44 it is determined whether this is the last packet. If not, the process returns to step S30 to be repeated for the next packet. If all of the packets have been considered, in step S45 the union of the set of suspects is then found as the group of likely culprits. This method will identify more than one culprit if the information signal has been patched together from the sections from different receivers trying to get round the watermarking security measure. Because the comparison is done packet by packet, the receivers who colluded to generate the illegal copy will be identifed. This technique enables the identification of not only the receivers but also any routers from which illegal copies could have originated.
- the present invention is applicable to any form of network such as a cable network which has some intelligence capability in the network switches .
- the protocol allows a maximum number of 32 nodes in a route and thus the depth D is limited. This limits the number of multiple different watermarked versions of a segment which needs to be generated and transmitted over the IP multicast system.
- the present invention is, however, applicable to any network and benefits from the present invention are obtained so long as the number of nodes in the network are less than the number of receivers.
- the segmentation, watermarking and selection means can be embodied as instructions for controlling a processor.
- the segmentation and watermarking means are implemented by software at a source ' s computer and the selection means is implemented by software in each of the routers in the network.
- the present invention can be implemented as software controlling a multi-purpose computer
- the present invention can be embodied as a storage medium such as a CD-ROM, floppy disc, solid state memory device, or tape on which are stored instructions in the form of computer codes for controlling a processor to carry out the process.
- the computer code can be transmitted over a network to be installed on a computer to allow it to implement the invention, and thus the present invention is also embodied as a signal carrying the computer code .
- the watermarking technique used to form the differently watermarked versions of each segment can comprise the same watermarking technique using different watermarking parameters, or different watermarking techniques. Different watermarking techniques can be used so long as they do not perceivably affect the data.
- the routers await reception of a whole transmission group before filtering, the filtering or selection process need not await the receipt of a whole transmission group.
- the selection process is not limited to the use of a pseudo random selection procedure, and anything which will give a plurality of deterministic sequences keyed by receiver information can be used.
Abstract
Description
Claims
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA002367880A CA2367880A1 (en) | 1999-03-12 | 2000-03-03 | A method and apparatus for generating multiple watermarked copies of an information signal |
GB0121185A GB2363555A (en) | 1999-03-12 | 2000-03-03 | A method and apparatus for generating multiple watermarked copies of an information signal |
AU29261/00A AU2926100A (en) | 1999-03-12 | 2000-03-03 | A method and apparatus for generating multiple watermarked copies of an information signal |
JP2000605387A JP2002539723A (en) | 1999-03-12 | 2000-03-03 | Method and apparatus for generating multiple watermarked copies of an information signal |
IL14533100A IL145331A0 (en) | 1999-03-12 | 2000-03-03 | A method and apparatus for generating multiple watermarked copies of an information signal |
EP00907785A EP1169849A1 (en) | 1999-03-12 | 2000-03-03 | A method and apparatus for generating multiple watermarked copies of an information signal |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB9905777.0 | 1999-03-12 | ||
GBGB9905777.0A GB9905777D0 (en) | 1999-03-12 | 1999-03-12 | A method and apparatus for generating multiple watermarked copies of an information signal |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2000056059A1 true WO2000056059A1 (en) | 2000-09-21 |
Family
ID=10849559
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB2000/000767 WO2000056059A1 (en) | 1999-03-12 | 2000-03-03 | A method and apparatus for generating multiple watermarked copies of an information signal |
Country Status (7)
Country | Link |
---|---|
EP (1) | EP1169849A1 (en) |
JP (1) | JP2002539723A (en) |
AU (1) | AU2926100A (en) |
CA (1) | CA2367880A1 (en) |
GB (2) | GB9905777D0 (en) |
IL (1) | IL145331A0 (en) |
WO (1) | WO2000056059A1 (en) |
Cited By (28)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2358313A (en) * | 1999-12-20 | 2001-07-18 | Ibm | Unique watermarking of web documents |
GB2361136A (en) * | 2000-04-05 | 2001-10-10 | Sony Uk Ltd | Watermarking and signature generation |
US20030190054A1 (en) * | 2000-10-03 | 2003-10-09 | Lidror Troyansky | Method and system for distributing digital content with embedded message |
JP2005503621A (en) * | 2001-09-20 | 2005-02-03 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Using multiple watermarks to protect content material |
GB2419249A (en) * | 2004-10-15 | 2006-04-19 | Zootech Ltd | Watermarking an audiovisual product by selecting and reproducing a sequence of watermark characters upon playback |
WO2007040475A1 (en) * | 2005-09-21 | 2007-04-12 | Thomson Licensing | Recoverable marks for films |
WO2007110806A2 (en) * | 2006-03-24 | 2007-10-04 | Koninklijke Philips Electronics N.V. | Method of locating a receiver that redistributes content |
US7555650B1 (en) * | 2002-03-20 | 2009-06-30 | Thomson Licensing | Techniques for reducing the computational cost of embedding information in digital representations |
US20090204778A1 (en) * | 2008-02-11 | 2009-08-13 | Aaron Marking | Simple non-autonomous peering environment, watermarking and authentication |
US7644282B2 (en) | 1998-05-28 | 2010-01-05 | Verance Corporation | Pre-processed information embedding system |
US7664332B2 (en) | 1998-05-28 | 2010-02-16 | Verance Corporation | Pre-processed information embedding system |
US7818577B2 (en) | 2000-04-05 | 2010-10-19 | Sony United Kingdom Limited | Identifying material using a watermark and a signature |
US8020004B2 (en) | 2005-07-01 | 2011-09-13 | Verance Corporation | Forensic marking using a common customization function |
US8838978B2 (en) | 2010-09-16 | 2014-09-16 | Verance Corporation | Content access management using extracted watermark information |
US8869222B2 (en) | 2012-09-13 | 2014-10-21 | Verance Corporation | Second screen content |
US8923548B2 (en) | 2011-11-03 | 2014-12-30 | Verance Corporation | Extraction of embedded watermarks from a host content using a plurality of tentative watermarks |
US9106964B2 (en) | 2012-09-13 | 2015-08-11 | Verance Corporation | Enhanced content distribution using advertisements |
US9153006B2 (en) | 2005-04-26 | 2015-10-06 | Verance Corporation | Circumvention of watermark analysis in a host content |
US9189955B2 (en) | 2000-02-16 | 2015-11-17 | Verance Corporation | Remote control signaling using audio watermarks |
US9208334B2 (en) | 2013-10-25 | 2015-12-08 | Verance Corporation | Content management using multiple abstraction layers |
US9251549B2 (en) | 2013-07-23 | 2016-02-02 | Verance Corporation | Watermark extractor enhancements based on payload ranking |
US9262794B2 (en) | 2013-03-14 | 2016-02-16 | Verance Corporation | Transactional video marking system |
US9323902B2 (en) | 2011-12-13 | 2016-04-26 | Verance Corporation | Conditional access using embedded watermarks |
US9547753B2 (en) | 2011-12-13 | 2017-01-17 | Verance Corporation | Coordinated watermarking |
US9571606B2 (en) | 2012-08-31 | 2017-02-14 | Verance Corporation | Social media viewing system |
US9596521B2 (en) | 2014-03-13 | 2017-03-14 | Verance Corporation | Interactive content acquisition using embedded codes |
US9648282B2 (en) | 2002-10-15 | 2017-05-09 | Verance Corporation | Media monitoring, management and information system |
US11734393B2 (en) | 2004-09-20 | 2023-08-22 | Warner Bros. Entertainment Inc. | Content distribution with renewable content protection |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0840513A2 (en) * | 1996-11-05 | 1998-05-06 | Nec Corporation | Digital data watermarking |
EP0898396A2 (en) * | 1997-08-20 | 1999-02-24 | Canon Kabushiki Kaisha | Electronic watermark system, electronic information distribution system, and image filing apparatus |
WO1999010858A2 (en) * | 1997-08-29 | 1999-03-04 | Leighton F Thomson | Method for protecting content using watermarking |
EP0901124A2 (en) * | 1997-09-02 | 1999-03-10 | Sony Corporation | Signal/data transmission, reception, recording and/or reproduction |
-
1999
- 1999-03-12 GB GBGB9905777.0A patent/GB9905777D0/en not_active Ceased
-
2000
- 2000-03-03 AU AU29261/00A patent/AU2926100A/en not_active Abandoned
- 2000-03-03 GB GB0121185A patent/GB2363555A/en not_active Withdrawn
- 2000-03-03 EP EP00907785A patent/EP1169849A1/en not_active Withdrawn
- 2000-03-03 JP JP2000605387A patent/JP2002539723A/en active Pending
- 2000-03-03 WO PCT/GB2000/000767 patent/WO2000056059A1/en not_active Application Discontinuation
- 2000-03-03 IL IL14533100A patent/IL145331A0/en unknown
- 2000-03-03 CA CA002367880A patent/CA2367880A1/en not_active Abandoned
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0840513A2 (en) * | 1996-11-05 | 1998-05-06 | Nec Corporation | Digital data watermarking |
EP0898396A2 (en) * | 1997-08-20 | 1999-02-24 | Canon Kabushiki Kaisha | Electronic watermark system, electronic information distribution system, and image filing apparatus |
WO1999010858A2 (en) * | 1997-08-29 | 1999-03-04 | Leighton F Thomson | Method for protecting content using watermarking |
EP0901124A2 (en) * | 1997-09-02 | 1999-03-10 | Sony Corporation | Signal/data transmission, reception, recording and/or reproduction |
Cited By (37)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7664332B2 (en) | 1998-05-28 | 2010-02-16 | Verance Corporation | Pre-processed information embedding system |
US9117270B2 (en) | 1998-05-28 | 2015-08-25 | Verance Corporation | Pre-processed information embedding system |
US7644282B2 (en) | 1998-05-28 | 2010-01-05 | Verance Corporation | Pre-processed information embedding system |
GB2358313A (en) * | 1999-12-20 | 2001-07-18 | Ibm | Unique watermarking of web documents |
US9189955B2 (en) | 2000-02-16 | 2015-11-17 | Verance Corporation | Remote control signaling using audio watermarks |
GB2361136A (en) * | 2000-04-05 | 2001-10-10 | Sony Uk Ltd | Watermarking and signature generation |
US7840816B2 (en) | 2000-04-05 | 2010-11-23 | Sony United Kingdom Limited | Identifying material stored using a signature as a retrieval index |
US7818577B2 (en) | 2000-04-05 | 2010-10-19 | Sony United Kingdom Limited | Identifying material using a watermark and a signature |
US20030190054A1 (en) * | 2000-10-03 | 2003-10-09 | Lidror Troyansky | Method and system for distributing digital content with embedded message |
JP2005503621A (en) * | 2001-09-20 | 2005-02-03 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Using multiple watermarks to protect content material |
US7555650B1 (en) * | 2002-03-20 | 2009-06-30 | Thomson Licensing | Techniques for reducing the computational cost of embedding information in digital representations |
US9648282B2 (en) | 2002-10-15 | 2017-05-09 | Verance Corporation | Media monitoring, management and information system |
US11734393B2 (en) | 2004-09-20 | 2023-08-22 | Warner Bros. Entertainment Inc. | Content distribution with renewable content protection |
US7783888B2 (en) | 2004-10-15 | 2010-08-24 | Zoo Digital Limited | Watermarking in an audiovisual product |
GB2419249B (en) * | 2004-10-15 | 2007-09-26 | Zootech Ltd | Watermarking in an audiovisual product |
GB2419249A (en) * | 2004-10-15 | 2006-04-19 | Zootech Ltd | Watermarking an audiovisual product by selecting and reproducing a sequence of watermark characters upon playback |
US9153006B2 (en) | 2005-04-26 | 2015-10-06 | Verance Corporation | Circumvention of watermark analysis in a host content |
US8020004B2 (en) | 2005-07-01 | 2011-09-13 | Verance Corporation | Forensic marking using a common customization function |
KR101223291B1 (en) | 2005-09-21 | 2013-01-16 | 톰슨 라이센싱 | Recoverable marks for films |
WO2007040475A1 (en) * | 2005-09-21 | 2007-04-12 | Thomson Licensing | Recoverable marks for films |
WO2007110806A3 (en) * | 2006-03-24 | 2007-12-13 | Koninkl Philips Electronics Nv | Method of locating a receiver that redistributes content |
WO2007110806A2 (en) * | 2006-03-24 | 2007-10-04 | Koninklijke Philips Electronics N.V. | Method of locating a receiver that redistributes content |
US8775811B2 (en) * | 2008-02-11 | 2014-07-08 | Secure Content Storage Association Llc | Simple non-autonomous peering environment, watermarking and authentication |
US20090204778A1 (en) * | 2008-02-11 | 2009-08-13 | Aaron Marking | Simple non-autonomous peering environment, watermarking and authentication |
US8838977B2 (en) | 2010-09-16 | 2014-09-16 | Verance Corporation | Watermark extraction and content screening in a networked environment |
US8838978B2 (en) | 2010-09-16 | 2014-09-16 | Verance Corporation | Content access management using extracted watermark information |
US9607131B2 (en) | 2010-09-16 | 2017-03-28 | Verance Corporation | Secure and efficient content screening in a networked environment |
US8923548B2 (en) | 2011-11-03 | 2014-12-30 | Verance Corporation | Extraction of embedded watermarks from a host content using a plurality of tentative watermarks |
US9323902B2 (en) | 2011-12-13 | 2016-04-26 | Verance Corporation | Conditional access using embedded watermarks |
US9547753B2 (en) | 2011-12-13 | 2017-01-17 | Verance Corporation | Coordinated watermarking |
US9571606B2 (en) | 2012-08-31 | 2017-02-14 | Verance Corporation | Social media viewing system |
US9106964B2 (en) | 2012-09-13 | 2015-08-11 | Verance Corporation | Enhanced content distribution using advertisements |
US8869222B2 (en) | 2012-09-13 | 2014-10-21 | Verance Corporation | Second screen content |
US9262794B2 (en) | 2013-03-14 | 2016-02-16 | Verance Corporation | Transactional video marking system |
US9251549B2 (en) | 2013-07-23 | 2016-02-02 | Verance Corporation | Watermark extractor enhancements based on payload ranking |
US9208334B2 (en) | 2013-10-25 | 2015-12-08 | Verance Corporation | Content management using multiple abstraction layers |
US9596521B2 (en) | 2014-03-13 | 2017-03-14 | Verance Corporation | Interactive content acquisition using embedded codes |
Also Published As
Publication number | Publication date |
---|---|
CA2367880A1 (en) | 2000-09-21 |
GB9905777D0 (en) | 1999-05-05 |
GB0121185D0 (en) | 2001-10-24 |
EP1169849A1 (en) | 2002-01-09 |
JP2002539723A (en) | 2002-11-19 |
GB2363555A (en) | 2001-12-19 |
AU2926100A (en) | 2000-10-04 |
IL145331A0 (en) | 2002-06-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2000056059A1 (en) | A method and apparatus for generating multiple watermarked copies of an information signal | |
Brown et al. | Watercasting: Distributed watermarking of multicast media | |
Chu et al. | A secure multicast protocol with copyright protection | |
CN100435515C (en) | System and method for converting requests between different multicast protocols in communication network | |
EP1646238B1 (en) | Content distribution apparatus, content receiving apparatus, and content distribution method | |
CN1822545B (en) | Method of controlling communication between a head-end system and a plurality of client systems | |
Judge et al. | WHIM: Watermarking multicast video with a hierarchy of intermediaries | |
US8261315B2 (en) | Multicasting multimedia content distribution system | |
Katabi | Information slicing: Anonymity using unreliable overlays | |
MX2007004142A (en) | Method and system for broadcasting multimedia data. | |
US7643478B2 (en) | Secure and personalized broadcasting of audiovisual streams by a hybrid unicast/multicast system | |
Tian et al. | A survey of key technologies for constructing network covert channel | |
US7454518B1 (en) | System, device, and method for receiver access control in a multicast communication network | |
SE522794C2 (en) | Device and method for communicating electronic data via a network infrastructure having a unicast mechanism and multicast mechanism | |
JP2007527576A (en) | System, receiver, method, and program for distributing content | |
KR100670786B1 (en) | Apparatus for providing selective IPTV service using user profile and method thereof | |
US20020087725A1 (en) | Site selection based on internet protocol address | |
CN113973007A (en) | Anonymous query method and system based on broadcast encryption and onion routing and adopting time-controlled encryption | |
KR20020023596A (en) | Internet broadcasting system and method for transfering data in internet broadcasting system | |
KR100280825B1 (en) | How to Manage Session Membership in Internet Multicast Applications | |
Yu et al. | Nemor: A congestion-aware protocol for anonymous peer-based content distribution | |
CN113783900B (en) | Encryption and multi-stage calibration method for stream media of unmanned aerial vehicle | |
KR101040312B1 (en) | A system and method for providing a hybrids IP-TV service | |
Melchor et al. | pMIX: Untraceability for Small Hiding Groups. | |
JP4374749B2 (en) | Viewing control method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
ENP | Entry into the national phase |
Ref country code: GB Ref document number: 200121185 Kind code of ref document: A Format of ref document f/p: F |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2000907785 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 29261/00 Country of ref document: AU |
|
ENP | Entry into the national phase |
Ref document number: 2367880 Country of ref document: CA Ref country code: CA Ref document number: 2367880 Kind code of ref document: A Format of ref document f/p: F |
|
ENP | Entry into the national phase |
Ref country code: JP Ref document number: 2000 605387 Kind code of ref document: A Format of ref document f/p: F |
|
WWP | Wipo information: published in national office |
Ref document number: 2000907785 Country of ref document: EP |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09936413 Country of ref document: US |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2000907785 Country of ref document: EP |