Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q30/00—Commerce
  • G06Q30/06—Buying, selling or leasing transactions
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/08—Payment architectures
  • G06Q20/12—Payment architectures specially adapted for electronic shopping systems
  • G06Q20/123—Shopping for digital content
  • G06Q20/1235—Shopping for digital content with control of digital rights management [DRM]
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/08—Payment architectures
  • G06Q20/14—Payment architectures specially adapted for billing systems
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
  • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
  • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
  • H04N21/633—Control signals issued by server directed to the network components or client
  • H04N21/6332—Control signals issued by server directed to the network components or client directed to client
  • H04N21/6334—Control signals issued by server directed to the network components or client directed to client for authorisation, e.g. by transmitting a key
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F2221/2135—Metering

Definitions

• the invention relates to the sharing of multimedia objects, for example peer- to-peer type sharing, and in particular to the regulation of such sharing.
• DRM Digital Rights Management
• DRM systems provide elaborate rights management to facilitate various different business models. For example, a user can purchase a right to play back a multimedia object ten times, or a right to distribute a copy of the multimedia object to another user.
• the sharing of the multimedia object is registered or metered, typically in the device in which such sharing takes place.
• the registered usage information can then be supplied to the (copy)rights holder for the multimedia object, or to a rights clearinghouse or to another third party.
• the receiving party can then bill the user for his sharing of the multimedia object in accordance with his actual file sharing activity. The rights holder thus now receives a fair compensation for the usage of his content.
• the method further comprises recording user profile information for the user, and crediting the bill with a sum upon receipt of the recorded user profile information together with the registered usage information.
• User profile information for example indicating which television program the user watches or what music he is interested in, can be very valuable information, especially to advertisers. To entice users in supplying this information, their usage bill is credited with a certain amount if they are willing to share their profiling information.
• This object is achieved according to the present invention in a device as claimed in claim 3.
• a device as claimed in claim 3.
• the identification and accounting means it becomes possible to register or meter the sharing of the multimedia object in the device.
• the registered usage information can then be transmitted to a third party for afterwards billing purposes.
• Such a device does not inhibit the sharing of the multimedia object.
• the user can share or otherwise use the content exactly as he wishes.
• the registered usage information allows a third party to send a bill so as to collect royalties for the usage of its content. This way, a fair balance between the interests of the rights holders and the desires of the users is struck.
• the identifying means are arranged to obtain the identifier from metadata associated with the content item, preferably using a watermark detector arranged to detect a watermark in the content item and to extract the identifier from the metadata encoded using the watermark.
• the identifying means comprise a fingerprint calculator arranged to obtain the identifier by computing a fingerprint for at least a portion of the multimedia object. This has the advantage that the identifier can be obtained for any type of multimedia object, even when associated metadata may have been lost because of some type of conversion or copying.
• the usage information being registered for the multimedia object preferably comprises a number of times the multimedia object is being shared, or an indication of a length of the multimedia object.
• the predetermined criterion preferably comprises a predetermined number of times the multimedia object has been shared. Other criteria are of course also possible.
• the device is further arranged to sharing of the multimedia object in response to the reporting means failing to transmit the recorded data to the third party. This provides a simple but effective penalty to users who try to prevent transmission of the recorded data in order to prevent being billed for their usage of the object.
• the device further comprises user profile maintenance means for maintaining a user profile, the reporting means being arranged to additionally transmit at least a portion of the user profile to the third party. This has the advantage that it allows the third party to credit the user on his bill for permitting the transmission of user profile data. Such data is valuable to entities like the third party, and the credit on the bill provides an incentive to the user to permit transmission of such data.
• the invention further advantageously provides a computer program product being arranged to cause a general purpose computer to operate as the device of the invention.
• Fig. 1 schematically shows a file sharing network comprising plural clients
• Fig. 2 shows a file sharing client in more detail
• Fig. 3 schematically shows a server and a fingerprint database in more detail.
• Fig. 1 schematically shows a file sharing network 100 comprising plural file sharing clients 101, 102, 103, 104 and 105.
• the network 100 is best regarded as a conceptual or virtual network. That is, it is not necessary that all clients 101-105 are physically or network- wise directly connected to each other all the time. All that is needed is that one client "on the network" can obtain files or objects from another client. Also, even when direct client-to-client connections are used, it is not necessary that all clients are connected to all other clients.
• the network 100 may comprise a server 110, which performs a directory service for the clients 101-105.
• a client 101 submits a list of the files (or objects) it wants to share to the server 110.
• the server 110 combines the lists it receives from all the clients connected to the network 100.
• Other clients 102-105 can then connect to the server 110 and browse the combined list or search for specific objects on the list. They can subsequently contact the client that has the object they are looking for, and obtain (download) it from that client directly.
• This way, the server 110 does not directly participate in the sharing of files or objects between the clients 101-105.
• This approach is well known in the worldwide Napster file sharing network. It is also possible to realize the network 100 without the server 110.
• a client 101 connects to the network 100 by connecting to one or more other clients 102-105 that are already on the network 100.
• a client searches the network by sending a search request to the clients it is connected to. These clients examine their list of objects which they share, and return a result if the requested object is in that list. Furthermore, the request is forwarded to other clients connected to these clients. This way, the request is distributed throughout the entire network 100 until it is received by a client which can fulfill it, or until all clients have received it and none are able to fulfill it.
• Such an embodiment is known from e.g. the Gnutella file sharing network.
• a disadvantage of this embodiment is that the network 100 is not scalable. Gnutella like networks currently for example cannot support 1 million clients. Furthermore the network becomes slow if there are a number of "slow" computers, i.e. computers with limited bandwidth to the network 100, processing power and/or memory.
• the client 101 can, after connecting to the one or more other clients 102-105, submit its list of files or objects it wants to share to those other clients 102- 105. The list is then passed on to all the clients on the network 100. This way, all clients know which clients have which files or objects available, and can contact that client directly.
• the known KaZaa file sharing network also operates without a server 110, but to overcome the above-mentioned problem uses two types of clients: a super node and a "normal" client.
• Super nodes are clients which have sufficient bandwidth, processing power and memory.
• a normal client connects to the network by connecting to a super node and sends the list of the files to be shared to the super node.
• a super node has connections to a number of clients and furthermore is also connected to a number of other super nodes.
• a super node is at the same time also a normal client. That is, for the user the fact that his computer is a super node is transparent.
• his client sends a request to the super node(s) to which his client is currently connected.
• the super nodes returns the matching files, that are in the lists send by its clients.
• the super node forwards the request, if necessary, to all the super nodes to which it is connected in a fashion similar to the one described above in the Gnutella embodiment.
• this approach is much faster than the Gnutella networks. Furthermore it can be scaled up to millions of clients.
• Such file sharing networks typically referred to as peer-to-peer or P2P file sharing networks
• P2P file sharing networks have an enormous popularity.
• Well known examples of these networks are: Napster, Musiccity, Gnutella, Kazaa, Imesh and Bearshare.
• Users Once users have installed the appropriate client software on their personal computers, they can share their files and they are able to download files shared by other users.
• the clients 101-105 may be connected to a network such as the Internet, which facilitates the establishment of the file sharing network 100.
• a client could e.g. use a direct TCP/IP connection to another client to obtain a file or object.
• On the most popular networks usually over 500,000 people are connected simultaneously.
• multimedia object will be used to denote files containing music, songs, movies, TV programs, pictures and other types of binary data, but also textual data can be shared in this fashion. It is to be noted that a multimedia object maybe made up of several different files.
• the file sharing clients 101-105 obtain identifiers for multimedia objects they share and register usage information for these multimedia objects.
• the usage information is then supplied to a third party 130.
• the third party 130 subsequently bills the user of the clients in accordance with the registered usage information.
• the third party 130 could for example be a copyright clearinghouse such as the RIAA or the Dutch BUMA/Stemra.
• the third party 130 could be a party to the file sharing network 100, although this is not necessary.
• the file sharing clients 101-105 could simply employ a direct Internet connection, e.g. using the World-Wide Web, to the third party 130, e-mail the usage information to an e-mail address for the third party 130 or use some other channel to transmit the usage information to the third party 130.
• Fig. 2 shows the file sharing client 101 in more detail.
• the file sharing client 101 is preferably realized as a personal computer on which file sharing software 201 is running, as is well-known in the art.
• the file sharing software 201 typically makes use of a networking module 202, such as the TCP/IP stack available in modern operating systems.
• the file sharing software 201 is arranged to download a multimedia object 200 over the file sharing network 100, e.g. from one of the other file sharing clients 102-105, as is known in the art.
• a storage medium 203 contains one or more multimedia objects which are shared by the file sharing software 201.
• Such a storage medium 203 would typically be a directory on a hard disk.
• the storage medium 203 may contain a separate portion in which downloaded multimedia objects are stored. This portion, typically also a directory, is not necessarily the same as the directory in which multimedia objects to be shared are stored.
• the file sharing client 101 also comprises a fingerprinting module 204, which can compute a fingerprint from a multimedia object.
• the fingerprinting module 204 is preferably realized as one or more hardware or software modules, for example as a plug-in module in the file sharing software 201 running on the client 101.
• a fingerprint of a multimedia object is a representation of the most relevant perceptual features of the object in question. Such fingerprints are sometimes also known as "(robust) hashes".
• the fingerprints of a large number of multimedia objects along with their associated respective metadata, such as the title, artist, genre and so on, are stored in a database.
• the metadata of a multimedia object is retrieved by computing its fingerprint and performing a lookup or query in the database using the computed fingerprint as a lookup key or query parameter. The lookup then returns the metadata associated with the fingerprint.
• European patent application 01200505.4 describes a method that generates robust fingerprints for multimedia objects such as, for example, audio clips.
• the audio clip is divided in successive (preferably overlapping) time intervals.
• the frequency spectrum is divided in bands.
• a robust property of each band e.g. energy
• a multimedia object is thus represented by a fingerprint comprising a concatenation of binary values, one for each time interval.
• the fingerprint does not need to be computed over the whole multimedia object, but can be computed when a portion of a certain length, typically about three seconds, has been received.
• the term "the fingerprint” will be used even in cases when multiple fingerprints for one multimedia object can exist.
• the fingerprint for the multimedia object 200 can be considered to be an identifier for the multimedia object 200 if the method used to calculate the fingerprint is robust enough. When reporting usage information the fingerprint can be supplied to the third party 130 as well, allowing the third party 130 to properly identify the multimedia object 200.
• a database lookup is performed to obtain metadata comprising a proper identifier. Such a lookup typically takes only a few seconds. If the lookup fails, the fingerprinting module 204 can easily compute a new fingerprint for the multimedia object 200 (e.g. from another part of the object) and to perform a database lookup using the new fingerprint. Usually, the database lookup is handled by a central server. This way, the client 101 does not need to maintain the rather large database necessary to identify multimedia objects by their fingerprints. The workings of such a central server are explained below with reference to Fig. 3.
• a fingerprint for a multimedia object can be computed while that object is being downloaded or uploaded (shared).
• Some methods of computing a fingerprint operate on small portions of a multimedia object at a time. For example, the above-mentioned European patent application computes a "sub-fingerprint" for every three seconds of audio data in the multimedia object, and constructs the actual fingerprint from all the sub- fingerprints. Computing the sub-fingerprints can then start once three seconds worth of data has been received.
• An accounting module 205 receives the fingerprint, or the metadata obtained through a database lookup based on the fingerprint, from the fmge ⁇ rinting module 204. The module 205 then registers usage information for the multimedia object in question in storage medium 206.
• the storage medium 206 could for example be a small hard disk in the client 101. To avoid tampering with the registered usage information, a secure storage medium can be used.
• Registering the usage information can take place whenever the file sharing software 201 actually transmits a multimedia object to another client 102-105, or when the object is placed in the storage medium 203.
• the registered usage information serves as the basis for afterwards billing.
• the accounting module 205 monitors the operations performed by the playback module 101 to obtain the necessary usage information.
• a reporting module 207 transmits the recorded data to the third party 130 to allow afterwards billing for sharing of the multimedia object 200 in accordance with the registered usage information for the multimedia object 200.
• An important issue is when the client 101 should submit the information, i.e. what predetermined criterion should be used to determine whether the registered usage information should be transmitted to the third party.
• the predetermined criterion could comprise a predetermined number of identifiers being recorded. This way, users who share a lot of multimedia objects are billed more often than people who only occasionally listen to a song. Further, it is now no longer necessary to send out bills for trivial amounts of money, which would be the case with periodic billing for people who only occasionally use multimedia objects.
• the module 205 could record that a particular object only lasts for 10 seconds, and another song is 4 minutes 30 seconds.
• the predetermined criterion could be chosen on the basis of the recorded amounts of time, for example as a predetermined total amount of time being recorded. This way, users can cheaply share short fragments, but those who distribute complete songs, or complete albums will be billed often.
• a budget-based approach is also possible. This requires that the accounting module 205 has at least some knowledge of the costs associated with particular types of sharing. For example, the user of the client 101 may be provided with a budget of 20 Euros.
• the accounting module 205 determines the costs associated with such playback and subtracts it from the budget.
• the predetermined criterion then represents the case that the budget has reached zero, or is within a certain distance from zero.
• a similar effect can be achieved by choosing as the predetermined criterion a maximum amount of money and instead of subtracting from the budget, adding up the costs until the predetermined maximum has been reached.
• the client 101 may further comprise a user profile maintenance module 208 which maintains a user profile for the user.
• a profile comprises information regarding the user's browsing habits, lifestyle, interests, favorite search keywords and other information that can be gathered by observing the user's browsing behavior.
• the client 101 to recommend multimedia objects that may be of interest to the user, or to filter out multimedia objects that are less likely to be of interest. It is also possible to use such user profile information for targeted marketing or advertising. See e.g. international patent application PCT/ LB02/00073 (attorney docket PHNL020072) by the same applicant as the present application. It is thus desirable from a
• the reporting module 207 is now arranged to additionally transmit at least a portion of the user profile to the third party 130.
• the reporting module 207 could cause the file sharing module 201 to inhibit sharing of the multimedia object. This inhibition can be lifted once the reporting module 207 is able to transmit the recorded data again.
• the registered usage information should be protected against unauthorized modifications.
• the fingerprinting module 204 should be protected against tampering, so that a user cannot disable the fingerprinting or the accounting afterwards. There are various ways to achieve this. In one embodiment, some or all parts of the client 101 are implemented as hardware modules, making them difficult to modify. In another embodiment, the modules 204, 205, 207 and the storage medium 206 are provided on a smart card which prevents tampering. The file sharing software 201 then should refuse to operate if the smart card is not inserted.
• TPMs trusted platform modules
• PC general purpose computer
• TPMs trusted platform modules
• the chips known as trusted platform modules (or TPMs)
• TPMs can generate and securely store on-chip digital certificates and private keys, provide hardware support for multiple authentication schemes and handle encryption and decryption of files on demand.
• Fig. 3 schematically shows a server 300 and a fingerprint database 310 in more detail.
• the server 300 here comprises an input module 301, an optional fingerprinting module 302, a Database Management System (DBMS) backend module 303, and a response module 304.
• the input module 301 receives a fingerprint from the client 101 and supplies the fingerprint to the DBMS backend module 303.
• the input module 301 receives a plurality of audio clips from the client 101 instead of a number of fingerprints. These audio clips are then fed to the fingerprinting module 302.
• the fingerprinting module 302 computes a fingerprint from the received audio clip.
• the fingerprinting module 302 then supplies the computed fingerprint to the DBMS backend module 303.
• the DBMS backend module 303 performs a query on the database 310 to retrieve a set of metadata associated with the received fingerprints from the database 310.
• the database 310 comprises fingerprints FP1, FP2, FP3, FP4 and FP5 and respective associated sets of metadata MDS1, MDS2, MDS3, MDS4 and MDS5.
• the above- mentioned European patent application 01200505.4 (attorney docket PHNL010110) describes various matching strategies for matching fingerprints computed for an audio clip with fingerprints stored in a database.
• European patent application 01202720.7 (attorney docket PHNL010510) describes an efficient method of matching a fingerprint representing an unknown information signal with a plurality of fingerprints of identified information signals stored in a database to identify the unknown signal. This method uses reliability information of the extracted fingerprint bits.
• the fingerprint bits are determined by computing features of an information signal and thresholding said features to obtain the fingerprint bits. If a feature has a value very close to the threshold, a small change in the signal may lead to a fingerprint bit with opposite value.
• the absolute value of the difference between feature value and threshold is used to mark each fingerprint bit as reliable or unreliable. The reliabilities are subsequently used to improve the actual matching procedure.
• the database 310 can be organized in various ways to optimize query time and/or data organization.
• the output of the fingerprinting module 204 (or fingerprinting module 302) should be taken into account when designing the tables in the database 310.
• the database 310 comprises a single table with entries (records) comprising respective fingerprints and sets of metadata.
• a first table comprises a plurality of unique identifiers (primary keys) each associated with respective sets of metadata.
• Such tables can be obtained from various music identification sources. The combination of artist, title and year of release could be combined to form a unique identifier, although this is not guaranteed to be unique, so preferably a really globally unique value is used.
• a second table is then set up with entries comprising for each multimedia object the fingerprints and the unique identifiers from the first table. This way, multiple fingerprints can be associated with one set of metadata without having to duplicate metadata. If multiple fingerprints are possible for one multimedia object, all these fingerprints are stored in the second table, all associated with the one unique identifier for that multimedia object.
• the DBMS backend module 303 then matches the received fingerprints against the fingerprints in the second table, obtains an identifier and matches the identifier against the first table to obtain the metadata. If the database 310 is an SQL database, the two tables could be joined on the identifier.
• the DBMS backend module 303 feeds the results of the query to the response module 304, which transmits the metadata found back to the client 101.
• identifiers embedded in multimedia objects using digital watermarks could be used.
• the client 101 then comprises a watermark detector arranged to detect a watermark in the multimedia object 200 and to extract the identifier from the watermark.
• Watermarking the process of inserting extra information in a signal such as an audio or video signal, is an important and well-known technique to mark or protect those signals.
• Watermarking an image is essentially a process of altering the pixel values of an image in a manner that ensures that a viewer of the image does not notice any perceptual change between the original and the watermarked image. Altering a large number of pixel values in an arbitrary manner will result in noticeable artifacts.
• Every pixel value of an image can be altered only to a certain limit without making perceptible differences to the image quality.
• the audio signal is modified in a way that a person listening to the resulting audio signal does not notice any perceptual change between the original and the watermarked signal.
• Technologies for watermarking audio and/or video, and for reliably detecting such watermarks are well known in the art and will not be elaborated upon further.
• the alterations in the audio or video signal are typically used to hold some extra information.
• a watermark detector can extract this extra information by looking at the specific alterations. For instance, a simple watermarking technique manipulates the least significant bit (LSB) of every data word representing the signal. If a bit of the extra information represents a zero, the corresponding LSB is also set to zero.
• LSB least significant bit
• the extra information represents the identifier for the multimedia object 200.
• the identifier could be simply an (alpha)numerical string which uniquely identifies the multimedia object 200. For instance, if the multimedia object 200 comprises an electronic book, its ISBN could be embedded using a watermark. The ISBN uniquely identifies the book.
• the invention can be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer.
• the device claim enumerating several means several of these means can be embodied by one and the same item of hardware.
• the mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

Landscapes

• Business, Economics & Management (AREA)
• Engineering & Computer Science (AREA)
• Accounting & Taxation (AREA)
• Finance (AREA)
• Theoretical Computer Science (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Strategic Management (AREA)
• General Business, Economics & Management (AREA)
• Development Economics (AREA)
• Economics (AREA)
• Software Systems (AREA)
• Marketing (AREA)
• Computer Security & Cryptography (AREA)
• Multimedia (AREA)
• Technology Law (AREA)
• Computer Hardware Design (AREA)
• General Engineering & Computer Science (AREA)
• Signal Processing (AREA)
• Computer Networks & Wireless Communication (AREA)
• Storage Device Security (AREA)
• Information Transfer Between Computers (AREA)

Priority Applications (5)

Applications Claiming Priority (2)

Publications (1)

Family

ID=30470306

Family Applications (1)

Country Status (8)

Cited By (10)

Families Citing this family (61)

Citations (4)

Family Cites Families (23)

• 2003
  • 2003-07-10 KR KR1020057001159A patent/KR20050029723A/ko not_active Ceased
  • 2003-07-10 AU AU2003281646A patent/AU2003281646A1/en not_active Abandoned
  • 2003-07-10 US US10/521,704 patent/US20060031381A1/en not_active Abandoned
  • 2003-07-10 JP JP2004522624A patent/JP2005534098A/ja active Pending
  • 2003-07-10 WO PCT/IB2003/003064 patent/WO2004010353A1/en not_active Ceased
  • 2003-07-10 EP EP03740962A patent/EP1527399A1/en not_active Withdrawn
  • 2003-07-10 RU RU2005104956/09A patent/RU2005104956A/ru not_active Application Discontinuation
  • 2003-07-10 CN CNA038177099A patent/CN1672155A/zh active Pending

Patent Citations (4)

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events