Title of Invention

"PROCESSING AND MEMORIZING UNIT"

Abstract

Processing and memorizing unit (30) enabling a user to access, by means of a client machine (20) of the computer type, at least one server machine(Mk) enabling access to atleast one interactive service (Si) belonging to at least one cluster of services, said unit being characterized in that it includes at least: means for memorizing a cluster identifier (BU) enabling to determine the cluster to which the processing and memorizing unit belongs, means for memorizing a processing and memorizing unit Identifier (UTM) enabling to characterize the processing and memorizing unit (30) put at the user's disposal, and means for memorizing a decryption key (KD) enabling the decrypting of information coming from a service of the cluster.

Full Text

The present invention relates to processing and memorizing unit. The subject of the invention concerns the domain of technical means adapted to restrict access to resources belonging to interactive services being part of at least one cluster of services. The subject of the invention finds a particularly advantageous application in the domain of restricted access to resources belonging to interactive services. As hon-lirniting example, can be considered interactive services such as the consultation of bank accounts, the consultation of legal and/or commercial information on corporations, the consultation of horoscopes, interactive online games, etc. Said interactive services comprise restricted access resources. For instance, for a service relative to the consultation of bank accounts, a restricted access resource is the display of a bank account which is accessible only to the holder of the account. To illustrate the subject of the invention, fig. 1 shows the example of an installation 1 enabling users to access interactive services being part of at least a group or cluster. The installation 1 includes for each user, a client machine 2 enabling to execute a client program adapted to exchange, from a transmission network 3, data with a server program associated to each interactive service. In a simplified manner, each server program of an interactive service is executed by a server machine linked up to the transmission network 3. As non-limiting example, each client machine 2 can be a personal computer, the client program can be a software program of the Internet browser type, the transmission network 3 can be the Internet or an Intranet, the server program can be a web server, and the server machine can be a server of the data processing type. m the rest of the description, the interactive services shall be referred to as services identifiers Si (with i varying from 1 to I), the clusters shall be referred to as clusters identifiers Bj, (with j varying from 1 to J), and the server machines shall" be referred to as machines identifiers Mk, (with k varying from 1 to K). In the illustrated example, interactive services having as services identifiers S1, S2, S3 and S4, are accessible respectively from server machines having as machines identifiers MI, Mb, Ma and Ma. Moreover, the interactive service having as service identifier Si is part of the cluster having as cluster identifier BI, the interactive service having as service identifier. 82 is part of the cluster having as cluster identifier 62, the interactive service having as service identifier 83 is part of the cluster having as cluster identifier BI and the interactive service having as service identifier 84 is part of the two clusters having as clusters identifiers BI and 62. hi other words, each user wishing to access one of the interactive services having as services identifiers Si, 82 , 83 or 84 belonging respectively to the cluster(s) having as clusters identifiers BI, 82, BI, BI and 62, must submit a request respectively to the server machine having as machine identifier MI, M2, M3 or M3. For certain applications, the need appears to restrict to the benefit of authorized users, access to interactive services or at least to certain resources of said services. Thus, an interactive service supplier can make at least certain resources of its interactive service accessible to the benefit of users having received an authorization or an access right. Such authorization can be granted to a user in return, for instance, for a subscription to the service, free or in return for payment. To fulfill the need expressed above, it appears necessary to authenticate in a reliable manner, a user who has sent a request of access to a restricted access resource of a service and to authorize access to said resource only if the user has an authorization. The subject of the invention aims at fulfilling that authentication need by proposing a process to enable access to restricted access resources of interactive services belonging to at least one cluster, only to the benefit of authorized users. So as to reach such a goal, the subject of the invention concerns a process to restrict, to the benefit of authorized users, access to at least one resource belonging to at least one interactive service of at least one cluster of services, each user having a client machine capable of executing a client program adapted to exchange from a transmission network, data with a server program associated to each interactive service which has a service identifier, access to a resource being provided by a request sent by the client program to the server program which processes said request and returns to the client program the response to the request. The process according to the invention includes the following steps: —> for each cluster, putting at the disposal of each user, a processing and memorizing unit designed to be linked up to the client machine of the user when he wishes to access at least one restricted access resource, the processing and memorizing unit including: - a cluster identifier enabling to determine the cluster to which the processing and memorizing unit belongs, - a processing and memorizing unit identifier enabling to characterize the processing and memorizing unit put at the user's disposal, - and a decryption key enabling the decrypting of information coming from a service of the cluster, —» enabling each client program, to read in the processing and memorizing unit which is linked up to it: • the cluster identifier, • and the processing and memorizing unit identifier, —» sending by each server program for a service, at least once to any client program which has submitted a request to it for said service, a list of clusters identifiers enabling to determine to which cluster(s) belongs the service to which the request was submitted, —> memorizing by each client program which receives a list of clusters identifiers in response to a request for a service which has a service identifier, a relation between each cluster identifier and the identifier of the concerned service, —> determining, at the time of the sending of a request to a service which has a service identifier, if the client program has memorized at least one relation between a cluster identifier and the identifier of the concerned service, and in the case where: - a cluster identifier is found, comparing said cluster identifier with the cluster identifier coming from the processing and memorizing unit and if they are equal, adding to the request sent by the client program, the processing and memorizing unit identifier, —»when a server program receives a request for a service containing a processing and memorizing unit identifier and which requests to access a restricted access resource, determining by using at least the identifier of the concerned service and the processing and memorizing unit identifier, if the user who owns the processing and memorizing unit is entitled to access said resource, and if the user: - is not entitled to access the resource, returning to the client program by the server program, a response corresponding to a refused access, - is entitled to access the resource: • determining using at least the processing and memorizing unit identifier, the encryption key corresponding to the decryption key contained in the processing and memorizing unit linked up to the client machine of the user who has sent the request, • encrypting by the server program, at least in part, the response to the request of access to the restricted access resource using the encryption key, so as to obtain an encrypted response, • and returning to the client program by the server program, said encrypted response, —> and when a client program receives an encrypted response: — decrypting the encrypted response received by the client program using the decryption key contained in the processing and memorizing unit linked up to it, - and presenting the user with the response to his request, as if said request had reached him non encrypted. Another subject of the invention aims at satisfying that authentication need by proposing a process enabling access to restricted access resources being part of interactive services belonging to at least two clusters. So as to reach such a goal, the process according to the invention comprises: —> determining, at the time of the sending of a request to a service, if the client program has memorized at least one relation between a cluster identifier and the identifier of the concerned service, and in the case where: - several clusters identifiers are found, comparing said clusters identifiers with the cluster identifier coming from the processing and memorizing unit and if an equality is found, adding the cluster identifier to the request sent by the client program and already containing the processing and memorizing unit identifier, —»when a server program receives a request for a service containing a processing and memorizing unit identifier and a cluster identifier and which requests to access a restricted access resource, determining by using at least the cluster identifier, the identifier of the concerned service and the processing and memorizing unit identifier if the user who owns the processing and memorizing unit is entitled to access said resource, and if the user: - is not entitled to access the resource, returning to the client program by the server program, a response corresponding to a refused access, - is entitled to access the resource: • determining using at least the cluster identifier and the processing and memorizing unit identifier, the encryption key corresponding to the decryption key contained in the processing and memorizing unit linked up to the client machine of the user who has sent the request, • encrypting by the server program, at least in part, the response to the request of access to the restricted access resource using the encryption key, so as to obtain an encrypted response, • and returning to the client program by the server program, said encrypted response. Another subject of the invention aims at proposing a processing and memorizing unit including at least: - a cluster identifier enabling to determine the cluster to which belongs the processing and memorizing unit, - a processing and memorizing unit identifier enabling to characterize the processing and memorizing unit put at the user's disposal, - and a decryption key enabling the decrypting of information coming from a service of the cluster. Another subject of the invention aims at proposing a client machine of the computer type including means to execute a client program implementing the steps of the process in accordance with the invention. Another subject of the invention aims at proposing a server machine of the data processing type including means to execute a server program implementing the steps of the process in accordance with the invention. Another subject of the invention aims at proposing a client program to access at least one restricted access resource belonging to at least one interactive service, including means programmed to carry out the steps of the process in accordance with the invention, when said client program is executed on a client machine. Another subject of the invention aims at proposing a server program for interactive service including means programmed to carry out the steps of the process in accordance with the invention, when said server program is executed on a server machine. Various other characteristics emerge from the description made below in reference to the appended diagrams which show, as non-limiting examples, embodiments and implementations of the subject of the invention. Fig. 2 shows a client machine enabling to implement the process according to the invention. Fig. 3 shows the sequence of data exchange between the client program of the user and the server program of the service in the case where the process according to the invention enables access to a service belonging to a cluster. Fig. 4 shows the sequence of data exchange between the client program of the user and the server program of the service in the case where the process according to the invention enables access to a service belonging simultaneously to several clusters of services. The subject of the invention concerns a process enabling authorized users, to access at least one restricted access resource belonging to at least one interactive service. For the implementation of the process according to the invention, each user has, as illustrated in fig. 2, a client machine 20 enabling to execute a client program to access interactive services as explained in fig. 1. In accordance with the invention, said client program must include additional functionalities compared to a classical client access program. As additional functionality, the client program must be able to exchange data with a processing and memorizing unit 30. The processing and memorizing unit 30 includes transfer means and processing and memorizing means. It must be considered that the transfer means are of software and/or hardware nature and are capable of providing and optimizing the data communication between the client machine 20 and the processing and memorizing unit 30. Said processing and memorizing unit 30 is able to: - using the transfer means: • accept data provided by the client machine 20, • and return data to the client machine 20, — using the processing and memorizing means: • to store data possibly in secret and to retain at least a part of said data even when the processing and memorizing unit 30 is switched off, • and to carry out algorithmic processing on data, part or all of said processing being possibly secret. As non-limiting example, said processing and memorizing unit 30 can be constituted by a material key on the USB bus of the client machine 20 or, preferably, by a chip card 31 and its interface 32 commonly called card reader linked up to the client machine 20. hi the case where the processing and memorizing unit 30 is constituted by a chip card 31 and its interface 32, the transfer means are split into two parts, one being on the interface 32 and the other one being on the chip card 31. In this embodiment, the absence of the chip card 31 is considered as equivalent to the absence of the processing and memorizing unit 30, inasmuch as the processing and memorizing means contained in the chip card 31 are missing. The process according to the invention comprises putting at the disposal of each user, for each cluster having as cluster identifier Bj, a processing and memorizing unit 30 enabling to access the restricted access resources of the interactive service(s) having as service identifier Sj being part of the cluster. In the case where a user wishes to access two clusters of services, as illustrated in fig. 1, said user must have a first processing and memorizing unit to access the interactive services of the cluster having as cluster identifier BI and a second processing and memorizing unit to access the interactive services of the cluster having as cluster identifier 62. Each processing and memorizing unit 30 includes: - a cluster identifier BU enabling to determine the cluster to which the processing and memorizing unit 30 belongs, - a processing and memorizing unit identifier UTM enabling to characterize the processing and memorizing unit 30 put at the user's disposal. Classically, said processing and memorizing unit identifier UTM corresponds, for instance to an identification number of the processing and memorizing unit 30, — and a decryption key KD enabling the decrypting of information coming from an interactive service of the cluster. As additional functionality, the client program must be able to exchange additional identification data with server machines. As additional functionality, the client program which receives a list of cluster identifiers in the response to one of its requests, must be able to memorize relations between the identifier of the service to which the request was submitted and each of the clusters identifiers of the list. As additional functionality, the client program must be able to decrypt, with the help of the processing and memorizing unit 30, encrypted data coming from the server machines. For the implementation of the process according to the invention, each server program serving an interactive service executed by a server machine includes additional functionalities compared to a classical server program which does not implement the process according to the invention. As additional functionality, each server program for a service has a list of clusters identifiers BSj enabling to determine to which cluster(s) the interactive service belongs. When a request is submitted to the service, the server program for said service sends within the response, said list of clusters identifiers, hi the case of fig. 1, for instance the interactive service having as identifier Si returns the list iBi f" and the interactive service having as identifier 84 returns the list { BI, 82 K As additional functionality, each server program of an interactive service executed on a server machine determines if a user who has a processing and memorizing unit having as processing and memorizing unit identifier UTM, is entitled to access a restricted access resource. Thus, the server program authorizes or refuses access to said restricted access resource and if access is authorized, encrypts at least in part the response to the request. The following description in relation to fig. 3 makes explicit the process according to the invention enabling a user to access an interactive service belonging to only one cluster at a time, hi the illustrated example, it is considered that the user wishes to access the interactive service having as service identifier Si belonging to the cluster having as cluster identifier BI. A user wishing to access a resource belonging to an interactive service having as service identifier Si, must have a processing and memorizing unit 30 corresponding to the access to said service, i.e. a processing and memorizing unit associated to the cluster having as cluster identifier BI. When the processing and memorizing unit 30 is linked up to the client machine 20, the corresponding client program reads in the processing and memorizing unit which is linked up to it: - the cluster identifier BU. In the considered example, BU is equal to BI, - and the processing and memorizing identifier UTM. hi the considered example, UTM is equal to 123. The client program submits to the server program for the service having as service identifier Si, a first request RQi. Inasmuch as the client program does not know yet whether the server program belongs to a cluster or not, the request sent is a standard request identical to the one sent by a standard client program. The server program for the service, having received the access request RQi, sends at least once within the response RPi to the client program which has submitted the request RQi to it, the list of clusters identifiers BSj. In the considered example, the list is constituted by only one element and is therefore represented by ^BiK The client program which receives the response RPi containing at least one list of clusters identifiers BSj, memorizes a relation between the service identifier Sj corresponding to the service to which the request RQi has been submitted and each cluster identifier BSj. In the illustrated example, the list has only one element and the client program memorizes one relation between the service identifier Si and the cluster identifier BI. When the user wishes to access again the interactive service having as service identifier Si, the client program prepares a second access request RQi. At the tune of the establishing of said second access request RQ:, the client program determines if it has memorized at least one relation between the concerned service identifier Si and a cluster identifier BSj. In the case where no relation is found, the client program sends a request similar to the request RQi. hi the case where a cluster identifier BSj is found, the client program compares said cluster identifier BSj with the cluster identifier BU coming from the processing and memorizing unit. If there is no equality between the cluster identifier BSj and the cluster identifier BU, the client program sends a request similar to the request RQi. If the cluster identifier BSj and the cluster identifier BU are equal, the client program adds to its request RQa, the processing and memorizing unit identifier UTM. In the illustrated example, at the time of the sending of the request RCh to the interactive service having as service identifier Si, the client program detects that it has memorized a relation between Si and BI, so much so that it compares BI with the cluster identifier BU coming from its processing and memorizing unit. Since the processing and memorizing unit also contains the cluster identifier BI, the client program adds to its request RQz, the processing and memorizing unit identifier UTM which, in the example, is equal to 123. When the server program receives a request RQz containing a processing and memorizing unit identifier UTM and corresponding to a request of access to a restricted access resource, the server program determines whether or not the user owning the processing and memorizing unit is entitled to access the restricted access resource. The server program determines that authorization by using at least the service identifier S; corresponding to the requested service and the processing and memorizing unit identifier UTM. So as to do so, the server program consults, for instance, a database including for the considered service the list of the processing and memorizing unit identifiers UTM authorized to access the requested restricted access resource. hi the case where the server program concludes that the user is not entitled to access the restricted access resource, the server program sends to the client program a response R?2 corresponding to a refused access. In the case where the server program concludes that the user is entitled to access the restricted access resource, is carried out the determination of an encryption key KE corresponding to the decryption key KD contained in the processing and memorizing unit having as processing and memorizing unit identifier UTM. Said encryption key KE is determined using at least the processing and memorizing unit identifier UTM. The server program then encrypts at least in part, the response to the request of access to the restricted access resource by using the encryption key KE, so as to obtain an encrypted response RPz. The server program then returns to the client program, said encrypted response RPi. It must be understood that when the server program encrypts, at least in part, a response, said server program generally encrypts preferentially, at least in part, the content of said response. hi the illustrated example, the server program detects in the request RQ:, the presence of a processing and memorizing unit identifier namely UTM = 123. As it happens that the request RQ: corresponds to a request of access to a restricted access resource, the server program determines using at least the service identifier Si and the processing and memorizing unit identifier 123, that access is authorized. The server program then determines the encryption key KE using at least the processing and memorizing unit identifier 123. For instance, the encryption key KE is equal to 45678. The server program encrypts using said key KE, at least in part the response to the request of access RQ2. When the client program receives the encrypted response RP2, the client program decrypts said encrypted response with the help of the decryption key KD contained in the processing and memorizing unit which is linked up to it. The client program then presents the user with the response to his request as if it had reached him non encrypted. In the example described in fig. 3, the process according to the invention enables a user to access an interactive service belonging to only one cluster at a time. Fig. 4 makes explicit the process according to the invention enabling a user to access an interactive service belonging simultaneously to several clusters of services. In the illustrated example, it is considered that the user wishes to access the interactive service having as service identifier 84, being part of two clusters having as clusters identifiers Bi and B2. A user wishing to access a resource belonging to the interactive service having as service identifier 84, must have for at least one of the clusters BI or 62, a processing and memorizing unit 30 enabling to access that cluster. In the example of fig. 4, it is supposed that the user has at least one processing and memorizing unit associated to the cluster having as cluster identifier 82. (The description would be similar if the user had a processing and memorizing unit associated to the cluster having as cluster identifier BO When the processing and memorizing unit 30 is linked up to the client machine 20, the corresponding client program reads in the processing and memorizing unit which is linked up to it: - the cluster identifier BU. In the considered example, BU is equal to 62, - and the processing and memorizing unit identifier UTM. hi the considered example, UTM is equal to 234. After the sending by the client program of a first request RQi for the interactive service having as service identifier 84 to the server program for said service, said server program for the service having received the request of access RQi, sends at least once within the response RPi, to the client program which has submitted the request RQi to it, the list of clusters identifiers BSj. In the considered example, the list is constituted by two elements and is therefore represented by •{ BI, B2K The client program which receives the response RPi containing at least one list of clusters identifiers BSj, memorizes a relation between the service identifier Si corresponding to the service to which the request RQi has been submitted and each cluster identifier BSj. In the considered example, the list has two elements and the client program memorizes, on the one hand, a relation between the service identifier 84 and the cluster identifier BI and, on the other hand, a relation between the service identifier 84 and the cluster identifier BI. When the user wishes to access again the interactive service having as service identifier Si, the client program prepares a second access request RQi. At the time of the establishing of said second access request RQi, the client program determines if it has memorized at least one relation between the concerned service identifier Si and a cluster identifier BSj. hi the case where no relation is found, the client program sends a request similar to the request RQj. hi the case where one or several clusters identifiers BSj are found, the client program compares said cluster(s) identifiers) BSj with the cluster identifier BU coming from the processing and memorizing unit. If there is no equality between the cluster(s) identifier(s) BSj and the cluster identifier BU, the client program sends a request similar to the request RQi. If equality is found between a cluster identifier BSj and the cluster identifier BU, the client program adds to its request RQi, the processing and memorizing unit identifier UTM and the cluster identifier BU. hi the illustrated example, at the time of the sending of the request RCh to the interactive service having as service identifier 84, the client program detects that it has memorized a relation between 84 and BI and a relation between 84 and 82. The client program then compares the cluster identifier BU coming from its processing and memorizing unit, respectively with the clusters identifiers BI and 82. Since the processing and memorizing unit linked up to the client machine contains the cluster identifier B2, the client program adds to its request RQ2, the processing and memorizing unit identifier UTM and the cluster identifier BU, which, in the example, are respectively equal to 234 and B2. When the server program receives a request RQ2 containing a processing and memorizing unit identifier UTM and a cluster identifier BU, and corresponding to a request of access to a restricted access resource, the server program determines whether or not the user owning the processing and memorizing unit is entitled to access the restricted access resource. The server program determines that authorization by using at least the cluster identifier BU, the service identifier Sj corresponding to the requested service and the processing and memorizing unit identifier UTM. hi the case where the server program concludes that the user is not entitled to access the restricted access resource, the server program sends to the client program a response RP2 corresponding to the refused access. hi the case where the server program concludes that the user is entitled to access the restricted access resource, is carried out the determination of an encryption key KE corresponding to the decryption key KD contained in the processing and memorizing unit having as processing and memorizing unit identifier UTM and as cluster identifier BU. Said encryption key KE is determined using at least the cluster identifier BU and the processing and memorizing unit identifier UTM. The server program then encrypts, at least in part, the response to the request of access to the restricted access resource by using the encryption key KE, so as to obtain an encrypted response RP2. The server program then returns to the client program said encrypted response RP2. In the illustrated example, the server program detects in the request RQ2, on the one hand, the presence of a processing and memorizing unit identifier UTM, namely UTM = 234 and, on the other hand, a cluster identifier BU, namely B2. As it happens that the request RQ2 corresponds to a request of access to a restricted access resource, the server program determines that access is authorized using at least the service identifier S4, the cluster identifier B2 and the processing and memorizing unit identifier 234. The server program then determines the encryption key KE using at least the cluster identifier B2 and the processing and memorizing unit identifier 234. For instance, the encryption key KE is equal to 56789. The server program encrypts using said key KE, at least in part the response to the request of access RQi. As explained in relation to fig. 3, when the client program receives the encrypted response R?2, the client program decrypts said encrypted response with the help of the decryption key KD contained in the processing and memorizing unit which is linked up to it. The client program then presents the user with the response to his request as if it had reached him non encrypted. As it emerges from the previous description, the process according to the invention enables to authenticate in a simple and reliable manner, thanks to the implementation of processing and memorizing units, a user wishing to access restricted access resources of interactive services belonging to one or several clusters of services. According to a characteristic of implementation of the invention, the process can enable to link up simultaneously several processing and memorizing units 30|, with 1 varying from 1 to L, to the client machine 20 of a user. According to that variant embodiment, the process according to the invention is modified in the following manner. The client program is adapted to read, in each of the processing and memorizing units which are linked up to it: - the cluster identifier BUi, - and the processing and memorizing unit identifier UTMi. When the client program sends a request to a service having as service identifier Si, the client program determines if it has memorized at least one relation between the concerned service identifier Si and a cluster identifier BSj. In the case where a cluster identifier BSj is found, the client program compares said cluster identifier BSj with the clusters identifiers BUi coming from the processing and memorizing units. If equality is found, the client program adds to the sent request, the processing and memorizing unit identifier UTMi having checked the equality. When the client program sends a request to a service having as service identifier Si and for which it has memorized at least two clusters identifiers BSj, the client program compares the clusters identifiers BSj with the clusters identifiers coming from the processing and memorizing units. If a least one equality is found, the client program: - chooses one of the processing and memorizing units having checked an equality, - and adds to the request sent by the client program, the chosen processing and memorizing unit identifier UTMi and the corresponding cluster identifier BUi. When the client program receives an encrypted response, the client program must find the processing and memorizing unit whose identifier UTMj has been transmitted during the request corresponding to said response. The three following preferred implementations are possible: - the client program memorizes the processing and memorizing unit identifier which is transmitted during a request and is able to find said identifier during the response, - the server program returns to the client program within the response, the processing and memorizing unit identifier UTMi received in the request, thus enabling the client program to find said identifier, - the client program questions each of the processing and memorizing units, so as to find the processing and memorizing unit to use. When the processing and memorizing unit is found, the client program decrypts the encrypted response using the decryption key KDi contained in the processing and memorizing unit thus found. In the previous description, the process aims at determining whether or not the user is entitled to access a restricted access resource. It must be considered that said determination can be carried out: — either only through the server program, - or through the server program helped by a remote auxiliary program. Said remote auxiliary program can run on a machine distinct from the server machine for a service. According to a preferred embodiment, it can be planned to gather together on a same machine the remote auxiliary programs of all the services of a cluster, so as to centralize the access rights management. In the previous description, the process consists in determining the encryption key KE. Note that the determination of said encryption key KE can be carried out: - either only through the server program, - or through a server program helped by a remote auxiliary program. According to a variant embodiment of the invention, the encryption key KE can be determined: — either through the server program associated to a processing and memorizing unit, - or through the server program using a remote auxiliary program and a processing and memorizing unit. According to another variant embodiment of the invention, it can be planned to associate to each processing and memorizing unit: - at least one meter enabling to count accesses to restricted access resources, made by the user owning a processing and memorizing unit, - and a threshold for said meter. Each server program for a service which receives a request of access to a restricted access resource, consults the values of the meter and threshold associated to the processing and memorizing unit used to send the request, so as to determine whether said request should be served or not. If the request is served, the server program possibly updates the meter's value. According to a preferred variant embodiment of the invention, the meter is situated in a machine which centralizes the management of the metering of accesses to restricted access resources. According to another variant embodiment of the invention, each process and memorizing unit comprises or includes: - a meter enabling to count the use of the decryption key KD, - and a threshold for said meter. Such a meter is updated every time the decryption key KD is used and the decrypting of the encrypted responses received by the client program is forbidden when the meter reaches or exceeds the threshold. WE CLAIM: 1. Processing and memorizing unit (30) enabling a user to access, by means of a client machine (20) of the computer type, at least one server machine(Mk) enabling access to atleast one interactive service (Si) belonging to at least one cluster of services, said unit being characterized in that it has at least: means for memorizing a cluster identifier (BU) enabling to determine the cluster to which the processing and memorizing unit belongs, means for memorizing a processing and memorizing unit Identifier (UTM) enabling to characterize the processing and memorizing unit (30) put at the user's disposal, and means for memorizing a decryption key (KD) enabling the decrypting of information coming from a service of the cluster. 2. Processirig and memorizing unit as claimed in claim 1, wherein it has means for memorizing a meter enabling to count the use of the decryption key (KD), means for memorizing a threshold for said meter. 3. Processing and memorizing unit (30) as claimed in claim 1, wherein the client machine (20) of the computer type exchanges data with the processing and memorizing unit (30) via a transmission network(s) (3) , with at least one server machine (Mk) enabling access to at least one interactive service (Si) being part of at least one cluster of services, the machine (20) comprises: means for reading in the processing and memorizing unit (30), a service cluster identifier (RU), a processing and memorizing unit identifier (UTM) and a decryption key (KD), means for sending to the server machine (Mk) , requests to access a service of a cluster one request of which at least contains the processing and memorizing unit identifier (UTM), and optionally a service cluster identifier (RU), means for receiving from the server machine (Mk), a list of clusters identifiers (BS1) for the services and an encrypted response (RP2), means for memorizing a relation between the service identifier (BSj) to which the request is submitted and each cluster Identifier (BSj). means for comparing the cluster identifier (BS1) as received from the server machine (Mk) with the cluster identifier (BU) coming from the processing and memorizing unit (30), and means for decrypting the encrypted response (RP2) using the decryption key (KD) 4. Processing and memorizing unit (30) as claimed in claim 1, wherein the server machine (Mk) enable access to at least one interactive service (Si) being part of at least one cluster of services and exchanging data via a transmission network (3), with at least one client machine (20) linked up to a processing and memorizing unit (30), the machine (Mk) comprises: means for memorizing a list of clusters identifiers (BSj) enabling to determine the cluster to which each interactive service(Si) belongs, means for memorizing a list of processing and memorizing unit identifiers (UTM) as authorized to access the services, means for receiving from the client machine (20), requests to access a service of a cluster one request of which at least contains the processing and memorizing unit identifier (UTM) linked up to the client machine (20), and optionally the service cluster identifier (RU), means for determining whether or not the requested service is authorized or refused access using at least the service identifier, the processing and memorizing unit identifiers (UTM) as received and memorized and optionally the service cluster identifier (BU), means for encrypting at least in part, the response to the access request, using a determined encryption key (KE) by using the processing and memorizing unit identifier (UTM) and optionally the cluster identifier (RU), and means for sending to the server machine, the list of clusters identifiers (BS1) and the encrypted response when the requested service is authorized access.

Documents:

00905-delnp-2003-abstract.pdf

00905-delnp-2003-claims.pdf

00905-delnp-2003-correspondence-others.pdf

00905-delnp-2003-description (complete)-(27-02-2009).pdf

00905-delnp-2003-description (complete).pdf

00905-delnp-2003-drawings.pdf

00905-delnp-2003-form-1.pdf

00905-delnp-2003-form-18.pdf

00905-delnp-2003-form-2.pdf

00905-delnp-2003-form-3.pdf

00905-delnp-2003-form-5.pdf

00905-delnp-2003-gpa.pdf

00905-delnp-2003-pct-306.pdf

905-DELNP-2003-Abstract-(14-01-2009).pdf

905-DELNP-2003-Abstract-(27-02-2009).pdf

905-DELNP-2003-Claims-(14-01-2009).pdf

905-DELNP-2003-Claims-(27-02-2009).pdf

905-DELNP-2003-Correspondence-Others-(14-01-2009).pdf

905-DELNP-2003-Description (Complete)-(14-01-2009).pdf

905-DELNP-2003-Form-1-(14-01-2009).pdf

905-DELNP-2003-Form-2-(14-01-2009).pdf

905-DELNP-2003-Form-2-(27-02-2009).pdf

905-DELNP-2003-GPA-(14-01-2009).pdf

905-DELNP-2003-Others-Document-(14-01-2009).pdf