EP1485769B1 - Verfahren und anordnung zum schutz von software - Google Patents

Verfahren und anordnung zum schutz von software Download PDF

Info

Publication number
EP1485769B1
EP1485769B1 EP03705611A EP03705611A EP1485769B1 EP 1485769 B1 EP1485769 B1 EP 1485769B1 EP 03705611 A EP03705611 A EP 03705611A EP 03705611 A EP03705611 A EP 03705611A EP 1485769 B1 EP1485769 B1 EP 1485769B1
Authority
EP
European Patent Office
Prior art keywords
software
licence
code
lock unit
unit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP03705611A
Other languages
English (en)
French (fr)
Other versions
EP1485769A1 (de
Inventor
Douglas Lundholm
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Publication of EP1485769A1 publication Critical patent/EP1485769A1/de
Application granted granted Critical
Publication of EP1485769B1 publication Critical patent/EP1485769B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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]
    • G06F21/105—Arrangements for software license management or administration, e.g. for managing licenses at corporate level
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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; CALCULATING OR 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 present invention relates to a method and arrangement for protecting licensed software from illicit use and/or copying.
  • a licence may be drawn to be valid for a specific number of users or group of users, which may be identified in beforehand, in order to limit usage of the sold software product.
  • the licence may be valid for a user group having a limited number of persons, such as in a school or a company. In practice, this means that it is permitted to use the software in a limited number of workstations at the same time.
  • a hardware lock of that kind consists of a lock unit, such as a small box, which is intended for connection to a parallel port of the workstation or computer of a certified user.
  • the program requires that the parallel port is first investigated, and if no valid lock is found there, the program cannot be started.
  • the input of a personal code may also be required which is defined for the lock unit.
  • the software is protected merely by a licence agreement between the software producer and the customer using it. Since it is difficult to verify externally the number of users simultaneously using a product in a network, a company may, for example, pay for licences valid for a specific number of users, and then in practice allow more users to utilise the product illicitly. If an inspector from the software producer then visits the company to check the usage, a data administrator at the company may, for example, easily limit the usage only temporarily, and then resume to the greater, illegal, number of users.
  • US5023907 discloses a network licence server daemon which provides access to a computer program based on information stored in user and license databases. When a software program is called from a workstation, it first transmits a signal to the server daemon, which reviews its user database and licence database to determine if access can be granted.
  • US5905860 discloses a licencing system for licencing applications in a network.
  • the licencing system includes a directory services database which stores all licence information.
  • the directory services database is accessed by providing a request to a licence service provider.
  • the licence service provider generates an executable entity based on the requested parameters, which searches the database and, if the appropriate units are available, assembles a licence.
  • the licence and the application are then transmitted to the requesting client.
  • EP0597599 discloses a system for establishing licensor changeable limits on shared software usage without the licensor having access to the system on which the shared software is running.
  • the invention is intended to prevent a software product protected by licence from being used by a greater number of users than what is covered by the licence.
  • This object and others are obtained by providing a method and arrangement where the number of simultaneous users is limited for a software protected by licence, which can be activated at a plurality of network connected workstations.
  • a start request is sent from the software to a network connected lock unit, wherein at least one physical licence unit associated with the protected software is connected to the lock unit and has a limited number of user positions. It is then investigated whether any licence unit, connected to the lock unit and corresponding to the software, has a free user position. The software is started if there is a free user position, but is terminated if there is no free user position.
  • a unique identity code can be read on each of the licence units being connected to the lock unit, wherein at least one licence unit is identified that corresponds to the software, and it is investigated whether any identified licence unit has a free user position.
  • a list of read identity codes may be sent from the lock unit to the software, and a new list may be created and sent to the lock unit comprising identity codes of identified licence units together with a max number giving a maximum number of permitted users for each identified licence unit.
  • the lock unit can then compare each such max number with the number of user positions currently being occupied for the corresponding licence unit.
  • the lock unit may be adapted to maintain information on which licence units are connected, and on the number of corresponding user positions currently being occupied in each licence unit.
  • the software may generate a random number or the like which is sent to the lock unit, wherein the lock unit sends this random number back to the software to indicate that a free user position is found, such that the software can be started.
  • encryption may be used where a public encryption key is sent from the lock unit to the software, the random number is encrypted with a session key generated by the software, the session key is encrypted with the public key, and the random number and the session key are sent as an encrypted message from the software to the lock unit.
  • the lock unit can decrypt the session key with a private key corresponding to the public key, and thereafter decrypt the random number with the session key.
  • the lock unit may send an erroneous random number to the software to indicate this fact, such that the software is terminated accordingly.
  • the lock unit may register a time for start of the software, such that the occupation duration of the corresponding user position can be checked and limited.
  • the lock unit may further assign a temporary identity code to the workstation which is saved in the lock unit together with the current time for start, in order to keep track on which workstations are active and thereby occupy a user position in a licence unit. Then, the lock unit also sends over the temporary identity code of the workstation to the software.
  • the software may be adapted to regularly renew its taken user position, by sending a renewal message to the lock unit after a predetermined time interval T, comprising its assigned temporary identity code.
  • the security can be increased by first selecting a licence unit associated with the software having at least one free user position, after which at least one signing code MAC is created, based on at least one parameter known by the software, and sent from the lock unit to the software. Then, the software creates corresponding signing code(s) locally, which is compared with received signing code(s). The software can be started if the received and locally created signing codes coincide with each other, or is terminated if the received and locally created signing codes do not coincide with each other.
  • the licence unit may be selected by the software from a list l' 1 , generated and sent by the lock unit L, comprising unique identity codes for all licence units being connected to the lock unit, and information, for each licence unit, on how many users are currently active and occupies a user position in the licence unit.
  • Said signing code(s) MAC may be sent to the software together with a session code SID assigned to the communication with the software, a created timestamp TM identifying the clock time when the communication with the software took place, and a current number of active users AA.
  • Said signing code(s) MAC may be created based on at least one of the following parameters: a readable identity code AID of the selected licence unit, a concealed identity code DAID of the licence unit, a readable identity code LID of the lock unit, a concealed identity code DLID of the lock unit, a functional code PLID of the function of the lock unit, a random number st 1 generated and sent by the software, the session code SID, the timestamp TM and the current number of users AA.
  • the relationship between the AID code and the DAID code can be determined in advance in the software, such that the DAID code can be derived from the AID code. Further, the relationship between the LID code and the DLID code may be determined in advance in the software, such that the DLID code can be derived from the LID code.
  • Said signing code(s) MAC may comprise a first signing code MAC 1 and a second signing code MAC 2 , wherein: MAC 1 is based on at least one of st 1 , SID, AID, AA, TM, LID, DLID and PLID; and MAC 2 is based on at least one of st 1 , SID, TM, AA, AID and DAID.
  • the software may be adapted to frequently renew its taken user position by sending a renewal message after a predetermined time interval T to the lock unit, comprising its assigned session code SID and a new generated random number st 2 .
  • the lock unit can identify the workstation using the software, the used licence unit and the latest saved timestamp TM, and determine whether a continued usage should be allowed.
  • a new timestamp TM' may be created corresponding to the current point of time, and a third signing code MAC 3 may be created and sent from the lock unit to the software, where MAC 3 is based on at least one of st 2 , SID, TM, TM', AID and DAID.
  • the present invention is network-based, which means that a software product protected by a licence agreement can be used in workstations or computers connected over a network to a specific central lock unit, such as over a local network, intranet or the Internet. This makes the solution particularly attractive, since licence-protected software is sold to companies and schools normally having personal computers connected together in a network.
  • the phrase "workstation” is used to cover all types of terminals, stations or personal computers from which a user can communicate over a network and activate the protected software.
  • the protected software may be a computer program of any type which is installed centrally in a computer or server accessible from the workstations, or locally in each of the workstations.
  • a data network 100 is shown to which a plurality of workstations 102 are connected. Also shown in the figure is a server 104 connected to the data network 100, in which a protected software 106, such as a computer program, is installed.
  • the software 106 is accessible and can be activated from a number of workstations 102, and is protected by a licence agreement being valid for a limited and predetermined number of users.
  • the protected software 106 can alternatively be installed locally in the workstations 102, not shown.
  • a central lock unit 108 is also connected to the data network 100, which can be utilised to control usage and limit the number of simultaneous users of the protected software 106, in accordance with the licence agreement.
  • the lock unit 108 may in practice comprise a programmable computer with a network connection.
  • the lock unit 108 is provided with any number of detachable physical licence units 110, each of which enables usage of the protected software 106 from a predetermined number of workstations 102, which is described in more detail below.
  • the number of licence units 110 being connected to the lock unit corresponds to the number of workstations covered by the licence agreement.
  • Each licence unit 110 is a small and very simple physical unit containing a readable unique identity code, or agreement identity AID, such a serial number or the like, which may be burnt on a card, chip or the like.
  • the unique identity code is associated with the software 106 and its licence agreement, permitting usage of the software at one or more workstations 102, which is determined in advance in accordance with the licence agreement.
  • the basic hardware for the lock unit 108 may, for example, consist of a product already known on the market called "TINI” (Tiny Internet Interface), which is produced by the company Dallas Semiconductors.
  • the licence units 110 may, for example, consist of small electronic buttons, so-called “iButtons”, produced by the same company, each containing a laser burnt unique serial number. Today, these buttons are often used as electronic keys for doors or the like.
  • the present invention is not limited to any particular design of the lock unit 108 and/or licence units 110, which are therefore not described any further.
  • the inventive lock arrangement operates in the following manner.
  • the lock unit 108 has been programmed in advance, e.g. in connection with installation of the software 106, in order to maintain a list of the workstations 102 currently using the software 106, and to register corresponding licence units 110 as being "occupied" during the period of usage.
  • Each licence unit 110 may embrace one or more user sites, depending on how the licence agreement is constructed.
  • Each licence unit 110 may further be valid for certain specified workstations 102 or for a specific number of unspecified workstations 102.
  • a licence unit 110 of this kind may also be used for plural programs protected by agreements.
  • the protected software 106 is adapted to first perform a check routine together with the lock unit 108, according to the following, before becoming available for use.
  • the software 106 When a user first activates the protected software 106 from a workstation 102, the software 106 sends a start request to the lock unit 108. It is then investigated whether any licence unit 110 corresponding to the software 106 is connected to the lock unit 108 and has a free user position, or whether all user positions are currently occupied by other workstations. If there is a free user position at any licence unit 110 for the software 106, the software 106 can be started for use at the workstation 102. However, if that or those licence units 110 associated with the software have been registered as occupied, or if no licence unit associated with the software is found, the software 106 terminates itself.
  • a lock unit 108 must be available in the data network 100 containing a specific computer program adapted to interact in said control routine. It is required for the present software 106 that a licence is associated with a connected licence unit 110 and its unique identity code. For example, a company may purchase and connect licence units 110 for the number of licences desired to obtain access to a software product. A licence unit 110 of this kind may then correspond to one or more licence agreements, where each agreement embraces one or more users or workstations, such that the number of connected licence units can be reduced. It is also possible to add upon demand further licences for a protected software, if required, by connecting further licence units 110 to the lock unit 108. However, this may in certain cases require that the protected software be updated with the added licence units 110. It is also possible to reduce the number of licence units 110 in a corresponding manner.
  • the software producer may protect its product by checking the licence units 110 over the data network 100 by means of the lock unit 108, in order to verify that at least one licence unit 110 associated with the product is connected thereto.
  • the lock unit 108 is programmed such that only the permitted number of users can use the product simultaneously by means of the maintained list of the workstations currently using the software 106, and thereby occupying user positions in the present licence units 110. In this way, only the number of users being paid for by the company can use a product simultaneously. If no licence unit 110 having a free user position is found, the software 106 terminates itself.
  • Data being sent between a workstation 102 and the lock unit 108 during the control routine may preferably also be protected by means of encryption, which is further described below.
  • encryption methods may be used with both session keys and public/private keys.
  • Session keys are randomly selected numbers of a specific length which are only used for one session, such as for transfer of data, and need to be known by both sender and receiver.
  • An advantage with such keys is that the encryption of data can be performed relatively fast.
  • the key being sent over to the receiver to enable decryption of the message must itself be encrypted to inhibit interception by anyone on its way, thereby enabling reading the complete message.
  • a public key may be used together with a private key, which is kept secret.
  • the public key is used by the sender, while the private key is used by the receiver for decryption.
  • the session key encrypts the actual message, while the public key encrypts the session key, thereby making the message unreadable for everyone, except the receiver having the private key.
  • Fig. 2 illustrates a signalling diagram between a protected computer program P and a central network connected lock unit L.
  • the computer program P may be any software protected by a licence agreement.
  • the program P is locally installed in a likewise network connected workstation, such that signals are transmitted physically between the workstation and the lock unit L over a common data network.
  • the program P may alternatively be installed centrally in a server accessible for workstations, as illustrated in Fig. 1.
  • the program P contains information on which licence units are associated therewith, as well as on the number of corresponding user positions.
  • the lock unit maintains information on which licence units are connected, and on the number of corresponding user positions currently being occupied in each licence unit.
  • a start request SF is sent to a lock unit L specified during installation of the program, in a first step 200.
  • lock unit L There may be a plurality of such lock units connected to the data network, which are identified by means of network addresses.
  • the lock unit L reads a unique identity code, such as a serial number, on each of the licence units being connected to the lock unit, and generates a list l 1 of these identity codes.
  • each lock unit may contain licence units associated with a plurality of protected computer programs.
  • One and the same licence unit may further contain user positions for plural computer programs.
  • the lock unit is further programmed to generate new pairs of keys for public encryption. This generation of keys is time consuming and proceeds preferably continuously in the background, since high random prime numbers must be generated in order to create a secure pair of keys. The required calculations may take several hours to perform, depending on the processor in the lock unit. Once a new key has been generated, it can be used to keep transmitted information secret, at least for a period of time, before any eavesdropper manage to crack the private key from the public one.
  • a next step 202 the list l 1 of all connected licence units is sent together with the latest generated public key pn, from the lock unit L to the computer program P. Since only the lock unit L has the corresponding private key, the data encrypted with the public key pn can only be decrypted by the lock unit L.
  • the program P identifies those licence units in the list l 1 being associated therewith. From these, the program P creates a new list l 2 containing identities of the associated licence units together with a max number indicating the maximum number of permitted users for each licence unit. If no such associated licence unit is found in the list l 1 , the protected program P is adapted to be terminated automatically at the workstation.
  • the program P When the new list l 2 has been created, the program P further generates a session key sn 1 and a specific random number st 1 or the like, intended to be used later to confirm that the program is allowed to be started, which is described below.
  • the list l 2 and the random number st 1 are encrypted with the session key sn 1 , e.g. according to an algorithm called TEA (Tiny Encryption Algorithm). Thereafter, the session key sn 1 is in turn encrypted with the public key pn, e.g. according to an algorithm called RSA (Rivest, Shamir, Adleman).
  • the list l 2 , the random number st 1 and the session key sn 1 are then sent as an encrypted message from the program P back to the lock unit in the next step 204, wherein the lock unit L can decrypt the session key sn 1 with its private key, and then the remaining message with the session key sn 1 .
  • the lock unit L investigates whether it has any connected licence unit currently being filled with a user quantity lower than the max number given by the program P as the maximum allowed for this licence unit. The lock unit then compares each such max number with the number of user positions currently being occupied for the corresponding licence unit. If no such licence unit with a free user position is found, the lock unit L is programmed to send back, in an alternative step 206a, an erroneous random number st(error) to the program P, which is then terminated automatically. However, if a licence unit having at least one free user position is connected, The present workstation is added to an active list for that licence unit, such that the lock unit knows that a user position is now occupied.
  • the lock unit L further registers a time for start, such that the occupation duration of the corresponding user position can be checked and limited.
  • the user position can then be released automatically after a certain period of time, or remain as the workstation renews its usage at frequent intervals, which is described in more detail below.
  • the correct decrypted random number st 1 is sent, in an alternative step 206b, to the program P, which thereby can be started for use in the workstation.
  • the lock unit L may preferably also assign a temporary identity code, TID, to the workstation, which is saved in the lock unit L together with the session key sn 1 of the workstation and the current time of start.
  • TID temporary identity code
  • the TID code is also sent over to the program P in step 206b, where the TID code is encrypted with the session key sn 1 , such that only the lock unit L and the program P can read the TID code.
  • the program P may then renew its taken user position, such that the lock unit is updated on whether it is still used.
  • the program P sends a renewal message to the lock unit L in a step 208, containing its assigned TID code, e.g. in a decrypted format, as well as a new random number st 2 and a new created session key sn 2 , both encrypted with the previous session key sn 1 .
  • This change of keys provides for keeping the keys secret for a longer period of time. Even if anyone unauthorised manages to crack the public key, and thus retrieves the first session key, it is further required that each such change of keys has been intercepted in order to reveal the latest valid session key, which is very unlikely.
  • the lock unit L can identify the workstation using the program P as well as the corresponding previous session key sn 1 , both of which are stored after step 204, wherein the new session key sn 2 and random number st 2 can be decrypted by means of the previous session key sn 1 .
  • the random number st 2 may be encrypted with the new session key sn 2 .
  • a new time of start is registered and the new session key sn 2 is saved. Similar to the alternative steps 206a,b, the correct or erroneous random number is sent back to the program P in alternative steps 210a or 210b, depending on whether the TID code given in step 208 is found in the lock unit L.
  • the program P remains active if the correct random number st 2 is received, alternative step 210b, and is terminated automatically if the erroneous random number st(error) is received, alternative step 210a.
  • the program P may also be adapted to terminate automatically if no random number or reply is received within a specific time limit.
  • Steps 208 and 210b may thus be repeated at specific time intervals to enable continued usage of the program P.
  • a new TID code may be created by the lock unit L each time the program P sends a renewal, and be sent over to the program P in step 210b, not shown.
  • a signing procedure can be used, according to an alternative embodiment.
  • Fig. 3 illustrates an alternative embodiment of the lock unit 108 and its connected licence units 110, accordingly. Otherwise, the same reference numbers as in Fig. 1 have been used for corresponding elements in Fig. 3.
  • the licence units 110 are provided with means for processing data and for sending data to the lock unit 108, e.g. in the form of a chip comprising a microcomputer and a communication unit.
  • each licence unit 110 is provided with both an identity code AID for the corresponding licence agreement, which is readable from the outside, and also a concealed identity code DAID which cannot be read from the outside, but only be overwritten by a new code if the original code should be lost.
  • the relationship between the AID code and the DAID code is defined in advance in the program P, such that it can derive the DAID code from the AID code, e.g. by means of an algorithm or a table.
  • the lock unit 108 may be provided with a readable identity code LID, as well as a concealed identity code DLID, and possibly a further functional code PLID uniquely identifying the function of the lock unit, and which preferably can be derived from the programmed program or software code of the lock unit.
  • the codes LID, DLID and PLID may be stored in an internal memory in the lock unit 108, or stored in a separate identity unit 300 connected to the lock unit 108, as indicated with dashed lines in Fig. 3, which may be of the same type as the licence units 110.
  • These codes AID, DAID, LID, DLID and PLID can in this embodiment be used in a signing procedure, in order to protect the licence units 110 and the lock unit 108 from being faked, and to protect transmitted messages, according to the following.
  • Each licence unit 110 is able to create a signing code called MAC (Message Authentication Code) by means of provided data, including its concealed code DAID. This code cannot be reversed, i.e. it is impossible to find out the concealed identity code by means of such a code.
  • MAC Message Authentication Code
  • a MAC code may include any information, likewise irreversible, which is sent over from the lock unit in connection with a request for creating a MAC code.
  • the program P can create the DAID code by means of the AID code, the program P can similarly create a local MAC* code. By comparing a local MAC* and the MAC that has been created by the licence unit 110 and then sent via the lock unit 108 to the program P, it can be determined whether the licence unit is authentic or not. If the lock unit further embeds data in the MAC code which is sent over to the program P, this may also determine whether the sent data is authentic or not.
  • a similar signalling procedure can also be used to ensure the authenticity of the lock unit 108, by utilising its LID code and DLID code, and optionally also PLID code.
  • the relationship between the LID code and the DLID code, and possibly also the PLID code, is likewise defined in advance in the program P, such that these codes can be derived correspondingly.
  • the identity of the lock unit can also be signed, together with information saved in the lock unit, in the form of a MAC code which is sent over to the program P and is checked in a way similar as for the licence unit 110.
  • Fig. 4 illustrates a signalling diagram between a protected program P and a lock unit L.
  • the program P may also be locally installed in a workstation or centrally in a server.
  • the program P contains information on which licence units are associated therewith, as well as on the number of corresponding user positions.
  • the lock unit L in turn maintains information on which licence units are connected, as well as on the number of corresponding user positions currently being occupied in each licence unit.
  • a start request SF is sent to the lock unit L, in a first step 400.
  • the lock unit L In response to the start request, the lock unit L generates a list l' 1 of unique identity codes, in this case AID codes, for all licence units being connected to the lock unit L.
  • the list l' 1 also includes, for each licence unit, information on how many users are currently active, thereby occupying a user position in the licence unit.
  • a next step 402 The list l' 1 is sent together with the LID code from the lock unit L to the program P, which then identifies the licence units in the list l' 1 which are associated with this program.
  • the program P selects a licence unit associated with the program still having at least one free user position, i.e. having a current number of active users AA less than its maximum permitted number AAmax. If more than one such licence unit having a free position is found in the list l' 1 , one of them can be selected arbitrarily. However, if no such associated licence unit with a free position is found, the protected program P is adapted to be terminated automatically in the workstation.
  • the program P When the program P has selected a license unit with an adherent AID code, it further generates a first random number st 1 , intended for use when creating unique signing codes, which is described below.
  • the AID code of the selected licence unit and the random number st 1 are then sent from the program P to the lock unit L, in a next step 404.
  • the lock unit L creates a session code SID identifying the communication with the program P, as well as a timestamp TM identifying the clock time this communication took place. Further, the lock unit L maintains an active list of SID codes for connected licence units. The present SID code is thus added to the active list for the selected licence unit with the adherent AID code, where the SID code and the timestamp TM are saved, resulting in that the number of users AA of the present licence unit is increased by one.
  • a first signing code MAC 1 is created by the lock unit, which is based on at least one of the following parameters: the received random number st 1 , the session code SID, the AID code of the licence unit, the current number of users AA, the created timestamp TM, as well as the identification codes of the lock unit LID, DLID and PLID.
  • the MAC 1 code may be created in a separate identity unit 300 connected to the lock unit L, if such is used, or internally in the lock unit.
  • a second signing code MAC 2 is also created by the licence unit, based on at least one of the following parameters: the random number st 1 , the session code SID, the timestamp TM, the number of users AA, as well as the identification codes of the lock unit itself AID, and DAID.
  • MAC 1 and MAC 2 can be created by means of predefined algorithms where one or more of the above-mentioned parameters are included. Preferably, all of the parameters listed above are used to provide maximum security, although fewer parameters may be sufficient in certain applications. Thus, the following applies to the preferred case:
  • the two signing codes MAC 1 and MAC 2 are sent in a next step 406 to the program P.
  • the program P creates corresponding signing codes MAC 1* and MAC 2* locally, in the same manner as in the licence unit and the identity unit. This is possible, since SID, TM and AA have been received in plain language, AID, LID and PLID are already stored in the program, and DAID and DLID can be derived from AID and LID, respectively.
  • the random number st 1 generated by the program is included, thereby making the signing codes unique for this communication.
  • the signing codes MAC 1* and MAC 2* created locally by the program P are then compared with the received signing codes MAC 1 and MAC 2 , respectively, wherein the program is terminated automatically if they do not coincide with each other.
  • the program P can be started and used.
  • the now signed, and thereby positively authentic, present number of users AA can be compared with the maximum number of users for the agreement, AAmax, identified by the code AID.
  • the number of users AA also includes the newly added user, further resulting in termination of the program if AA is greater than AAmax. Otherwise, the program P can be started for use in the workstation.
  • the lock unit L further registers a time for start of program usage, as in the previous embodiment, e.g. by using the timestamp TM, such that the occupation duration of the corresponding user position can be checked and limited.
  • the program can frequently renew its taken user position on the licence unit, such that the lock unit L is updated on the continued use thereof.
  • the program P sends a renewal message to the lock unit L in a step 408, containing its assigned session code SID and a new generated random number st 2 .
  • the lock unit L can then identify the workstation using the program P, as well as the present AID code and the latest saved timestamp TM, in order to determine whether a continued usage should be permitted.
  • the lock unit L creates a new timestamp TM' corresponding to the present point of time, which is saved in the list of users, such that the previous timestamp TM is replaced with the new timestamp TM'.
  • a third signing code MAC 3 is created in the licence unit L, based on at least one, preferably all, of the following parameters: the received random number st 2 , the SID code, the previous timestamp TM, the new timestamp TM', as well as the AID code and the DAID code for the present licence unit.
  • an error message FM is sent back to the program P, in an alternative step 410a.
  • the program may select whether it should be terminated automatically, or attempt to occupy a new user position by repeating the procedure, from step 404 if the same AID can be used, or from step 400 if a new AID is required. Otherwise, the signing code MAC 3 and the timestamp TM' are sent to the program P, in the alternative step 410b, which then can remain active in the workstation.
  • the program P may be adapted to create a corresponding signing code MAC 3* and compare it with the received signing code MAC 3 , in a similar way as for MAC 1 and MAC 2 , in order to determine whether the program P should remain active or be terminated automatically.
  • the lock unit L sends a message in step 410b approving continued usage.
  • the program P may also in this embodiment be adapted to be terminated automatically if no reply is received from the lock unit L within a specific time period after sending the renewal message in step 408.
  • Steps 408 and 410 may also be repeated at specific time intervals for continued use of the program P.
  • a new SID code may be created by the lock unit L each time the program P sends a renewal request, and be sent over to the program P in step 410b, not shown. Further, both the new SID code and the previous one may be included as parameters in the third signing code MAC 3 created by the licence unit L.
  • the present invention provides benefits to users of protected software, by means of increased control and security, a centralised administration and supervision, free parallel ports, as well as a simple upgrading of licences and of the number of licences.
  • An obvious benefit for the software producer is the potentially higher licence revenues, since the number of simultaneous users cannot exceed the licence agreement the customer has paid for.
  • the equipment required is relatively inexpensive and simple to handle.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Technology Law (AREA)
  • Multimedia (AREA)
  • Storage Device Security (AREA)
  • Stored Programmes (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Emergency Protection Circuit Devices (AREA)

Claims (20)

  1. Verfahren zum Beschränken der Anzahl gleichzeitiger Benutzer einer Software (106), die durch eine Lizenzvereinbarung geschützt ist, wobei die Software (106) durch eine Vielzahl mit einem Netzwerk verbundener Workstations (102) aktiviert werden kann, gekennzeichnet durch die folgende Schritte:
    A) Senden einer Start-Anforderung von der Software zu einer mit dem Netzwerk verbundenen zentralen Sperreinheit (108), wenn die Software durch eine Workstation aktiviert wird, wobei wenigstens eine physikalische Lizenzeinheit (110), die mit der geschützten Software (106) zusammenhängt und einen lesbaren einzigartigen Identitätscode enthält, mit der Sperreinheit (108) verbunden ist und eine beschränkte Anzahl von Benutzerpositionen aufweist, die von Benutzern der Software (106) belegt werden können,
    B) Ermitteln, ob eine Lizenzeinheit (110), die mit der Sperreinheit verbunden ist und mit der Software (106) zusammenhängt, eine freie Benutzerposition hat,
    C) Starten der Software (106) zur Benutzung in der Workstation (102), wenn in Schritt B) eine freie Benutzerposition gefunden wird, und
    D) Beenden der Software (106), wenn in Schritt B) keine freie Benutzerposition gefunden wird.
  2. Verfahren nach Anspruch 1, dadurch gekennzeichnet, dass Schritt B) die folgenden Teilschritte umfasst:
    E) Lesen des einzigartigen Identitätscodes an jeder der Lizenzeinheiten, die mit der Sperreinheit verbunden sind,
    F) Identifizieren wenigstens einer der Lizenzeinheiten, die der Software entspricht, und
    G) Ermitteln, ob eine in Schritt F) identifizierte Lizenzeinheit eine freie Benutzerposition hat.
  3. Verfahren nach Anspruch 2, dadurch gekennzeichnet, dass die Liste in Schritt E) gelesener Identitätscodes von der Sperreinheit zu der Software gesendet wird, einen neue Liste erzeugt und zu der Sperreinheit gesendet wird, die Identitätscodes in Schritt F) identifizierte Lizenzeinheiten zusammen mit einer Max-Anzahl umfasst, die eine maximale Anzahl zulässiger Benutzer für jede identifizierte Lizenzeinheit angibt, und die Sperreinheit jede derartige Max-Nummer mit der Anzahl von Benutzerpositionen vergleicht, die aktuell für die entsprechende Lizenzeinheit belegt sind.
  4. Verfahren nach Anspruch 3, dadurch gekennzeichnet, dass die Sperreinheit Informationen darüber, welche Lizenzeinheiten verbunden sind, sowie über die Anzahl entsprechender Benutzerpositionen führt, die aktuell in jeder Lizenzeinheit belegt sind.
  5. Verfahren nach einem der Ansprüche 1 - 4, dadurch gekennzeichnet, dass Software eine Zufallszahl oder dergleichen erzeugt, die zu der Sperreinheit gesendet wird, wobei die Sperreinheit diese Zufallszahl zu der Software zurücksendet, um anzuzeigen, dass in Schritt B) eine freie Benutzerposition gefunden worden ist, so dass die Software in Schritt C) gestartet werden kann.
  6. Verfahren nach Anspruch 5, dadurch gekennzeichnet, dass ein öffentlicher Verschlüsselungsschlüssel von der Sperreinheit zu der Software gesendet wird, die Zufallszahl mit einem Sitzungsschlüssel verschlüsselt wird, der von der Software erzeugt wird, der Sitzungsschlüssel mit dem öffentlichen Schlüssel verschlüsselt wird und die Zufallszahl sowie der Verschlüsselungsschlüssel als eine verschlüsselte Nachricht von der Software zu der Sperreinheit gesendet werden, so dass die Sperreinheit den Sitzungsschlüssel mit einem privaten Schlüssel, der dem öffentlichen Schlüssel entspricht, und anschließend die Zufallszahl mit dem Sitzungsschlüssel entschlüsseln kann.
  7. Verfahren nach einem der Ansprüche 1 - 6, dadurch gekennzeichnet, dass wenn in Schritt B) keine freie Benutzerposition gefunden wird, die Sperreinheit eine fehlerhafte Zufallzahl zu der Software sendet, um diese Tatsache anzuzeigen, so dass die Software in Schritt D) beendet wird.
  8. Verfahren nach einem der Ansprüche 1 - 7, dadurch gekennzeichnet, dass die Sperreinheit eine Zeit zum Starten der Software in Schritt C) registriert, so dass die Einnahmedauer der entsprechenden Benutzerposition geprüft und beschränkt werden kann.
  9. Verfahren nach Anspruch 8, dadurch gekennzeichnet, dass die Sperreinheit der Workstation einen temporären Identitätscode zuweist, der in der Sperreinheit zusammen mit der aktuellen Startzeit gespeichert wird, um verfolgen zu können, welche Workstations aktiv sind und so eine Benutzerposition in einer Lizenzeinheit belegen, wobei die Sperreinheit auch den temporären Identitätscode der Workstation an die Software sendet.
  10. Verfahren nach Anspruch 9, dadurch gekennzeichnet, dass die Software so eingerichtet ist, dass sie ihre belegte Benutzerposition regelmäßig aktualisiert, indem sie eine Aktualisierungsnachricht nach einem vorgegebenen Zeitintervall an die Sperreinheit sendet, die ihren zugewiesenen temporären Identitätscode umfasst.
  11. Verfahren nach einem der Ansprüche 1 - 10, dadurch gekennzeichnet, dass eine Lizenzeinheit, die mit der Software zusammenhängt, ausgewählt wird, die wenigstens eine freie Benutzerposition hat, mindestens ein Signier-Code MAC auf Basis wenigstens eines der Software bekannten Parameters erzeugt wird, und von der Sperreinheit zu der Software gesendet wird, die Software lokal einen/mehrere entsprechende/n Signier-Code/s erzeugt, der/die mit empfangenen signierten Codes verglichen wird/werden, wobei die Software gestartet wird, wenn die empfangenen und die lokal erzeugten Signier-Codes miteinander übereinstimmen, oder beendet wird, wenn die empfangenen und die lokal erzeugten Signier-Codes nicht miteinander übereinstimmen.
  12. Verfahren nach Anspruch 11, dadurch gekennzeichnet, dass die Lizenzeinheit durch die Software aus einer Liste 1' ausgewählt wird, die von der Sperreinheit erzeugt und gesendet wird und einzigartige Identitätscodes für alle Lizenzeinheiten die mit der Sperreinheit verbunden sind, sowie für jede Lizenzeinheit Informationen darüber umfasst, wie viele Benutzer aktuell aktiv sind und so eine Benutzerposition in der Lizenzeinheit belegen.
  13. Verfahren nach Anspruch 11 oder 12, dadurch gekennzeichnet, dass der/die Signier-Code/s MAC zusammen mit einem Sitzungs-Code SID, der der Kommunikation der Software zugewiesen ist, einem erzeugten Zeitstempel TM, der die Uhrzeit anzeigt, zu der die Kommunikation der Software stattgefunden hat und einer aktuellen Anzahl aktiver Benutzer AA zu der Software gesendet wird/werden.
  14. Verfahren nach Anspruch 13, dadurch gekennzeichnet, dass der/die Signier-Code/s MAC auf der Basis wenigstens eines der folgenden Parameter erzeugt wird/werden:
    eines lesbaren Identitätscodes AID der ausgewählten Lizenzeinheit, eines verborgenen Identitätscodes DAID der Lizenzeinheit, eines lesbaren Identitätscodes LID der Sperreinheit, eines verborgenen Identitätscodes DLID der Sperreinheit, eines Funktions-Codes PLID der Funktion der Sperreinheit, einer Zufallszahl st1, die durch die Software erzeugt und gesendet wird, des Sitzungs-Codes SID, des Zeitstempels TM und der aktuellen Anzahl von Benutzern AA.
  15. Verfahren nach Anspruch 14, dadurch gekennzeichnet, dass die Beziehung zwischen dem AID-Code und dem DAID-Code im Voraus in der Software bestimmt wird, so dass der DAID-Code aus dem AID-Code hergeleitet werden kann, und dass die Beziehung zwischen dem LID-Code und dem DLID-Code im Voraus in der Software bestimmt wird, so dass der DLID-Code aus dem LID-Code hergeleitet werden kann.
  16. Verfahren nach Anspruch 14 oder 15, dadurch gekennzeichnet, dass der/die Signier-Code/s MAC einen ersten Signier-Code MAC1 und einen zweiten Signier-Code MAC2 umfasst/umfassen, wobei:
    MAC1 wenigstens auf st1, SID, AID, AA, TM, LID, DLID oder PLID basiert und
    MAC2 wenigstens auf st1, SID, TM, AA, AID oder DAID basiert.
  17. Verfahren nach Anspruch 16, dadurch gekennzeichnet, dass die Software so eingerichtet ist, dass sie regelmäßig ihre belegte Benutzerposition aktualisiert, indem sie nach einem vorgegebenen Zeitintervall T eine Aktualisierungsnachricht zu der Sperreinheit sendet, die ihren zugewiesenen Sitzungs-Code SID und eine neue erzeugte Zufallszahl st2 umfasst, so dass die Sperreinheit die Workstation, die die Software benutzt, die benutzte Lizenzeinheit und den zuletzt gespeicherten Zeitstempel TM identifizieren kann und feststellen kann, ob eine weitere Benutzung gestattet werden sollte.
  18. Verfahren nach Anspruch 17, dadurch gekennzeichnet, dass ein neuer Zeitstempel TM' entsprechend dem aktuellen Zeitpunkt erzeugt wird und dass ein dritter Signier-Code MAC3 erzeugt und von der Sperreinheit zu der Software gesendet wird, wobei MAC3 wenigstens auf st2, SID, TM, TM', AID oder DAID basiert.
  19. Anordnung zum Beschränken der Anzahl gleichzeitiger Benutzer einer Software (106), die durch eine Lizenzvereinbarung geschützt ist, wobei die Software (106) durch eine Vielzahl mit einem Netzwerk verbundener Workstations (102) aktiviert werden kann, gekennzeichnet durch:
    eine mit dem Netzwerk verbundene zentrale Sperreinheit (108), mit der eine wählbare Anzahl physikalischer Lizenzeinheiten (110) verbunden werden kann, wobei jede Lizenzeinheit (110) eine beschränkte Anzahl von Benutzerpositionen hat, mit einem einzigartigen Identitätscode versehen ist und mit wenigstens einer Lizenzvereinbarung zusammenhängt,
    eine Software (106), die so eingerichtet ist, dass sie eine Start-Anforderung an die Sperreinheit (108) sendet, wenn die Software durch eine Workstation (102) aktiviert wird,
    eine Einrichtung, die ermittelt, ob eine Lizenzeinheit (110), die mit der Sperreinheit (108) verbunden ist und der Software entspricht, eine freie Benutzerposition hat,
    eine Einrichtung, die die Software (106) zur Benutzung in der Workstation startet, wenn eine freie Benutzerposition vorhanden ist, und
    eine Einrichtung, die die Software (106) beendet, wenn keine freie Benutzerposition vorhanden ist.
  20. Anordnung nach Anspruch 19, dadurch gekennzeichnet, dass die Sperreinheit so eingerichtet ist, dass sie Informationen darüber, welche Lizenzeinheiten verbunden sind, sowie über die Anzahl entsprechender Benutzerpositionen führt, die aktuell in jeder Lizenzeinheit belegt sind.
EP03705611A 2002-02-19 2003-02-19 Verfahren und anordnung zum schutz von software Expired - Lifetime EP1485769B1 (de)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE0200484 2002-02-19
SE0200484A SE524778C2 (sv) 2002-02-19 2002-02-19 Förfarande och arrangemang för att skydda mjukvara för otillbörlig användning eller kopiering
PCT/SE2003/000276 WO2003071404A1 (en) 2002-02-19 2003-02-19 A method and arrangement for protecting software

Publications (2)

Publication Number Publication Date
EP1485769A1 EP1485769A1 (de) 2004-12-15
EP1485769B1 true EP1485769B1 (de) 2005-10-12

Family

ID=20287008

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03705611A Expired - Lifetime EP1485769B1 (de) 2002-02-19 2003-02-19 Verfahren und anordnung zum schutz von software

Country Status (11)

Country Link
US (1) US20050160049A1 (de)
EP (1) EP1485769B1 (de)
JP (1) JP2005518041A (de)
KR (1) KR20040096583A (de)
CN (1) CN1633632A (de)
AT (1) ATE306689T1 (de)
AU (1) AU2003206561A1 (de)
CA (1) CA2476465A1 (de)
DE (1) DE60301872D1 (de)
SE (1) SE524778C2 (de)
WO (1) WO2003071404A1 (de)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102468969A (zh) * 2010-10-29 2012-05-23 北大方正集团有限公司 一种客户端注册数量的控制方法及系统

Families Citing this family (109)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2862149A1 (fr) * 2003-11-06 2005-05-13 France Telecom Procede de controle automatique des fraudes dans un systeme de transactions electroniques
US7113765B2 (en) * 2004-01-13 2006-09-26 Qualcomm Inc. System and method for allowing user based application licensing across multiple wireless communications devices
DE102013108713B8 (de) * 2013-08-12 2016-10-13 WebID Solutions GmbH Verfahren zum Verifizieren der ldentität eines Nutzers
RU2587422C2 (ru) 2013-12-27 2016-06-20 Закрытое акционерное общество "Лаборатория Касперского" Способ и система автоматического управления лицензиями
US11574621B1 (en) * 2014-12-23 2023-02-07 Amazon Technologies, Inc. Stateless third party interactions
JP6287964B2 (ja) * 2015-06-09 2018-03-07 株式会社デンソー ソフトウェア複製防止システム
US10198561B2 (en) * 2015-07-20 2019-02-05 Google Llc Systems, methods, and media for media session concurrency management with recurring license renewals
US10546444B2 (en) 2018-06-21 2020-01-28 Capital One Services, Llc Systems and methods for secure read-only authentication
CA3115084A1 (en) 2018-10-02 2020-04-09 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10783519B2 (en) 2018-10-02 2020-09-22 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10489781B1 (en) 2018-10-02 2019-11-26 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
WO2020072474A1 (en) 2018-10-02 2020-04-09 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10771254B2 (en) 2018-10-02 2020-09-08 Capital One Services, Llc Systems and methods for email-based card activation
US10686603B2 (en) 2018-10-02 2020-06-16 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10607214B1 (en) 2018-10-02 2020-03-31 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
WO2020072583A1 (en) 2018-10-02 2020-04-09 Capital One Services, Llc Systems and methods for establishing identity for order pick up
US10592710B1 (en) 2018-10-02 2020-03-17 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
CA3113590A1 (en) 2018-10-02 2020-04-09 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US11210664B2 (en) 2018-10-02 2021-12-28 Capital One Services, Llc Systems and methods for amplifying the strength of cryptographic algorithms
US10748138B2 (en) 2018-10-02 2020-08-18 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10511443B1 (en) 2018-10-02 2019-12-17 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
KR20210069033A (ko) 2018-10-02 2021-06-10 캐피탈 원 서비시즈, 엘엘씨 비접촉식 카드의 암호화 인증을 위한 시스템 및 방법
US10579998B1 (en) 2018-10-02 2020-03-03 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10581611B1 (en) 2018-10-02 2020-03-03 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10505738B1 (en) 2018-10-02 2019-12-10 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
WO2020072537A1 (en) 2018-10-02 2020-04-09 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10949520B2 (en) 2018-10-02 2021-03-16 Capital One Services, Llc Systems and methods for cross coupling risk analytics and one-time-passcodes
US10554411B1 (en) 2018-10-02 2020-02-04 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10542036B1 (en) 2018-10-02 2020-01-21 Capital One Services, Llc Systems and methods for signaling an attack on contactless cards
US10582386B1 (en) 2018-10-02 2020-03-03 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
CA3115252A1 (en) 2018-10-02 2020-04-09 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10565587B1 (en) 2018-10-02 2020-02-18 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
WO2020072413A1 (en) 2018-10-02 2020-04-09 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10615981B1 (en) 2018-10-02 2020-04-07 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10909527B2 (en) 2018-10-02 2021-02-02 Capital One Services, Llc Systems and methods for performing a reissue of a contactless card
SG11202101171VA (en) 2018-10-02 2021-03-30 Capital One Services Llc Systems and methods for cryptographic authentication of contactless cards
US10797882B2 (en) 2018-10-02 2020-10-06 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10771253B2 (en) 2018-10-02 2020-09-08 Capital One Services, Llc Systems and methods for cryptographic authentication of contactless cards
US10664830B1 (en) 2018-12-18 2020-05-26 Capital One Services, Llc Devices and methods for selective contactless communication
US11361302B2 (en) 2019-01-11 2022-06-14 Capital One Services, Llc Systems and methods for touch screen interface interaction using a card overlay
US11037136B2 (en) 2019-01-24 2021-06-15 Capital One Services, Llc Tap to autofill card data
US10510074B1 (en) 2019-02-01 2019-12-17 Capital One Services, Llc One-tap payment using a contactless card
US11120453B2 (en) 2019-02-01 2021-09-14 Capital One Services, Llc Tap card to securely generate card data to copy to clipboard
US11082229B2 (en) 2019-03-18 2021-08-03 Capital One Services, Llc System and method for pre-authentication of customer support calls
US10984416B2 (en) 2019-03-20 2021-04-20 Capital One Services, Llc NFC mobile currency transfer
US10643420B1 (en) 2019-03-20 2020-05-05 Capital One Services, Llc Contextual tapping engine
US10535062B1 (en) 2019-03-20 2020-01-14 Capital One Services, Llc Using a contactless card to securely share personal data stored in a blockchain
US10970712B2 (en) 2019-03-21 2021-04-06 Capital One Services, Llc Delegated administration of permissions using a contactless card
US11521262B2 (en) 2019-05-28 2022-12-06 Capital One Services, Llc NFC enhanced augmented reality information overlays
US10516447B1 (en) 2019-06-17 2019-12-24 Capital One Services, Llc Dynamic power levels in NFC card communications
US10871958B1 (en) 2019-07-03 2020-12-22 Capital One Services, Llc Techniques to perform applet programming
US11694187B2 (en) 2019-07-03 2023-07-04 Capital One Services, Llc Constraining transactional capabilities for contactless cards
US11392933B2 (en) 2019-07-03 2022-07-19 Capital One Services, Llc Systems and methods for providing online and hybridcard interactions
US12086852B2 (en) 2019-07-08 2024-09-10 Capital One Services, Llc Authenticating voice transactions with payment card
US10713649B1 (en) 2019-07-09 2020-07-14 Capital One Services, Llc System and method enabling mobile near-field communication to update display on a payment card
US10885514B1 (en) 2019-07-15 2021-01-05 Capital One Services, Llc System and method for using image data to trigger contactless card transactions
US10832271B1 (en) 2019-07-17 2020-11-10 Capital One Services, Llc Verified reviews using a contactless card
US10733601B1 (en) 2019-07-17 2020-08-04 Capital One Services, Llc Body area network facilitated authentication or payment authorization
US11182771B2 (en) 2019-07-17 2021-11-23 Capital One Services, Llc System for value loading onto in-vehicle device
US11521213B2 (en) 2019-07-18 2022-12-06 Capital One Services, Llc Continuous authentication for digital services based on contactless card positioning
US10506426B1 (en) 2019-07-19 2019-12-10 Capital One Services, Llc Techniques for call authentication
US10541995B1 (en) 2019-07-23 2020-01-21 Capital One Services, Llc First factor contactless card authentication system and method
CN114746913A (zh) 2019-10-02 2022-07-12 第一资本服务有限责任公司 使用非接触式传统磁条数据的客户端设备认证
US10733283B1 (en) 2019-12-23 2020-08-04 Capital One Services, Llc Secure password generation and management using NFC and contactless smart cards
US10657754B1 (en) 2019-12-23 2020-05-19 Capital One Services, Llc Contactless card and personal identification system
US11651361B2 (en) 2019-12-23 2023-05-16 Capital One Services, Llc Secure authentication based on passport data stored in a contactless card
US11615395B2 (en) 2019-12-23 2023-03-28 Capital One Services, Llc Authentication for third party digital wallet provisioning
US10885410B1 (en) 2019-12-23 2021-01-05 Capital One Services, Llc Generating barcodes utilizing cryptographic techniques
US11113685B2 (en) 2019-12-23 2021-09-07 Capital One Services, Llc Card issuing with restricted virtual numbers
US10862540B1 (en) 2019-12-23 2020-12-08 Capital One Services, Llc Method for mapping NFC field strength and location on mobile devices
US10853795B1 (en) 2019-12-24 2020-12-01 Capital One Services, Llc Secure authentication based on identity data stored in a contactless card
US11200563B2 (en) 2019-12-24 2021-12-14 Capital One Services, Llc Account registration using a contactless card
US10664941B1 (en) 2019-12-24 2020-05-26 Capital One Services, Llc Steganographic image encoding of biometric template information on a card
US10909544B1 (en) 2019-12-26 2021-02-02 Capital One Services, Llc Accessing and utilizing multiple loyalty point accounts
US10757574B1 (en) 2019-12-26 2020-08-25 Capital One Services, Llc Multi-factor authentication providing a credential via a contactless card for secure messaging
US11038688B1 (en) 2019-12-30 2021-06-15 Capital One Services, Llc Techniques to control applets for contactless cards
US10860914B1 (en) 2019-12-31 2020-12-08 Capital One Services, Llc Contactless card and method of assembly
US11455620B2 (en) 2019-12-31 2022-09-27 Capital One Services, Llc Tapping a contactless card to a computing device to provision a virtual number
US11210656B2 (en) 2020-04-13 2021-12-28 Capital One Services, Llc Determining specific terms for contactless card activation
US10861006B1 (en) 2020-04-30 2020-12-08 Capital One Services, Llc Systems and methods for data access control using a short-range transceiver
US10915888B1 (en) 2020-04-30 2021-02-09 Capital One Services, Llc Contactless card with multiple rotating security keys
US11030339B1 (en) 2020-04-30 2021-06-08 Capital One Services, Llc Systems and methods for data access control of personal user data using a short-range transceiver
US11222342B2 (en) 2020-04-30 2022-01-11 Capital One Services, Llc Accurate images in graphical user interfaces to enable data transfer
US11823175B2 (en) 2020-04-30 2023-11-21 Capital One Services, Llc Intelligent card unlock
US10963865B1 (en) 2020-05-12 2021-03-30 Capital One Services, Llc Augmented reality card activation experience
US11100511B1 (en) 2020-05-18 2021-08-24 Capital One Services, Llc Application-based point of sale system in mobile operating systems
US11063979B1 (en) 2020-05-18 2021-07-13 Capital One Services, Llc Enabling communications between applications in a mobile operating system
US11062098B1 (en) 2020-08-11 2021-07-13 Capital One Services, Llc Augmented reality information display and interaction via NFC based authentication
US11165586B1 (en) 2020-10-30 2021-11-02 Capital One Services, Llc Call center web-based authentication using a contactless card
US11482312B2 (en) 2020-10-30 2022-10-25 Capital One Services, Llc Secure verification of medical status using a contactless card
US11373169B2 (en) 2020-11-03 2022-06-28 Capital One Services, Llc Web-based activation of contactless cards
US11216799B1 (en) 2021-01-04 2022-01-04 Capital One Services, Llc Secure generation of one-time passcodes using a contactless card
US11682012B2 (en) 2021-01-27 2023-06-20 Capital One Services, Llc Contactless delivery systems and methods
US11687930B2 (en) 2021-01-28 2023-06-27 Capital One Services, Llc Systems and methods for authentication of access tokens
US11792001B2 (en) 2021-01-28 2023-10-17 Capital One Services, Llc Systems and methods for secure reprovisioning
US11562358B2 (en) 2021-01-28 2023-01-24 Capital One Services, Llc Systems and methods for near field contactless card communication and cryptographic authentication
US11438329B2 (en) 2021-01-29 2022-09-06 Capital One Services, Llc Systems and methods for authenticated peer-to-peer data transfer using resource locators
US11777933B2 (en) 2021-02-03 2023-10-03 Capital One Services, Llc URL-based authentication for payment cards
US11637826B2 (en) 2021-02-24 2023-04-25 Capital One Services, Llc Establishing authentication persistence
US11245438B1 (en) 2021-03-26 2022-02-08 Capital One Services, Llc Network-enabled smart apparatus and systems and methods for activating and provisioning same
US11961089B2 (en) 2021-04-20 2024-04-16 Capital One Services, Llc On-demand applications to extend web services
US11935035B2 (en) 2021-04-20 2024-03-19 Capital One Services, Llc Techniques to utilize resource locators by a contactless card to perform a sequence of operations
US11902442B2 (en) 2021-04-22 2024-02-13 Capital One Services, Llc Secure management of accounts on display devices using a contactless card
US11354555B1 (en) 2021-05-04 2022-06-07 Capital One Services, Llc Methods, mediums, and systems for applying a display to a transaction card
US12041172B2 (en) 2021-06-25 2024-07-16 Capital One Services, Llc Cryptographic authentication to control access to storage devices
US12061682B2 (en) 2021-07-19 2024-08-13 Capital One Services, Llc System and method to perform digital authentication using multiple channels of communication
US12062258B2 (en) 2021-09-16 2024-08-13 Capital One Services, Llc Use of a payment card to unlock a lock
US12069173B2 (en) 2021-12-15 2024-08-20 Capital One Services, Llc Key recovery based on contactless card authentication
US12124903B2 (en) 2023-03-16 2024-10-22 Capital One Services, Llc Card with a time-sensitive element and systems and methods for implementing the same

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5023907A (en) * 1988-09-30 1991-06-11 Apollo Computer, Inc. Network license server
WO1993011480A1 (en) * 1991-11-27 1993-06-10 Intergraph Corporation System and method for network license administration
US5343526A (en) * 1992-10-30 1994-08-30 At&T Bell Laboratories Method for establishing licensor changeable limits on software usage
US5905860A (en) * 1996-03-15 1999-05-18 Novell, Inc. Fault tolerant electronic licensing system
US6029145A (en) * 1997-01-06 2000-02-22 Isogon Corporation Software license verification process and apparatus
US6021438A (en) * 1997-06-18 2000-02-01 Wyatt River Software, Inc. License management system using daemons and aliasing
WO1999004354A1 (en) * 1997-07-15 1999-01-28 Shinko Electric Industries Co., Ltd. A license management system
GB2343025A (en) * 1998-10-23 2000-04-26 Ibm License management system
US6343280B2 (en) * 1998-12-15 2002-01-29 Jonathan Clark Distributed execution software license server
GB2346989A (en) * 1999-02-19 2000-08-23 Ibm Software licence management system uses clustered licence servers
EP1163566A1 (de) * 1999-03-08 2001-12-19 Spyrus, Inc. Verfahren und gerät zur reglementierung des zugangs zu einem rechnerbetriebsmittel mittels eines lizenzzertifikats
US6453305B1 (en) * 1999-05-21 2002-09-17 Compaq Computer Corporation Method and system for enforcing licenses on an open network
US6842896B1 (en) * 1999-09-03 2005-01-11 Rainbow Technologies, Inc. System and method for selecting a server in a multiple server license management system
US6810389B1 (en) * 2000-11-08 2004-10-26 Synopsys, Inc. System and method for flexible packaging of software application licenses

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102468969A (zh) * 2010-10-29 2012-05-23 北大方正集团有限公司 一种客户端注册数量的控制方法及系统

Also Published As

Publication number Publication date
KR20040096583A (ko) 2004-11-16
WO2003071404A1 (en) 2003-08-28
SE0200484D0 (sv) 2002-02-19
ATE306689T1 (de) 2005-10-15
EP1485769A1 (de) 2004-12-15
US20050160049A1 (en) 2005-07-21
DE60301872D1 (de) 2005-11-17
SE0200484L (sv) 2003-08-20
CN1633632A (zh) 2005-06-29
CA2476465A1 (en) 2003-08-28
AU2003206561A1 (en) 2003-09-09
SE524778C2 (sv) 2004-10-05
JP2005518041A (ja) 2005-06-16

Similar Documents

Publication Publication Date Title
EP1485769B1 (de) Verfahren und anordnung zum schutz von software
US6233567B1 (en) Method and apparatus for software licensing electronically distributed programs
KR100749867B1 (ko) 보안장치상에 암호화시스템을 보안가능하게 설치하는시스템 및 방법
US6047242A (en) Computer system for protecting software and a method for protecting software
US6098056A (en) System and method for controlling access rights to and security of digital content in a distributed information system, e.g., Internet
US5568552A (en) Method for providing a roving software license from one node to another node
US6334118B1 (en) Software rental system and method for renting software
CN102891843B (zh) 本地服务单元认证安卓客户端应用程序的方法
US6516413B1 (en) Apparatus and method for user authentication
US7644278B2 (en) Method for securely creating an endorsement certificate in an insecure environment
US7685421B2 (en) System and method for initializing operation for an information security operation
CN105103119A (zh) 数据安全服务系统
CN105027130A (zh) 延迟数据访问
CN105122265A (zh) 数据安全服务系统
CN112422287B (zh) 基于密码学的多层级角色权限控制方法和装置
JP2003527035A (ja) 遠隔の第三者監視を有する自動識別保護システム
KR20020067663A (ko) 데이터배포시스템
US6651169B1 (en) Protection of software using a challenge-response protocol embedded in the software
CN111583482A (zh) 一种基于二维码的门禁控制系统及其控制方法
CN112787996B (zh) 一种密码设备管理方法及系统
CN112187777A (zh) 智慧交通传感数据加密方法、装置、计算机设备及存储介质
CN112769560B (zh) 一种密钥管理方法和相关装置
JP2008306685A (ja) セキュリティ情報設定システム、そのマスタ端末、一般端末、プログラム
JP2002135239A (ja) 暗号化データ配信サービスシステム
CN116167020A (zh) 一种软件授权方法及系统

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040909

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT SE SI SK TR

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: LI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20051012

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: CH

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 60301872

Country of ref document: DE

Date of ref document: 20051117

Kind code of ref document: P

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060112

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060112

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060112

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060112

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060113

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060123

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060220

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060228

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060313

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060413

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20060713

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20061020

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

EN Fr: translation not filed
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20070219

Year of fee payment: 5

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20080219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20051012

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20080219