Abstract: In a method for the secure, distributed generation of an encryption key for a cryptographic method, where the encryption key, as well as a public key are generated using deterministic methods from a large random number (seed), the seed (S) is generated on the user side by consulting variables known only to the user, and a public key (V) that is transmitted in advance from the trust center. Generation information suitable for generating the seed and, on the basis of which, the seed is able to be derived deterministically from the trust center, by consulting information known only to the center, is produced on the user side, and transmitted to the trust center to create the seed in parallel.

Abstract: A terminal device for using different services offered via a telecommunications network includes at lest one receiving device for image and sound information, at least one transmitting device for data which is used to select the received image and sound information, an input unit, a decoder for the image and sound information, and outputs for audio and video signals. A server for such terminal devices includes devices for connection to a telecommunications network, devices for carrying out authorization checks using the respective data received from a terminal device, and devices for receiving and processing service requests of the terminal devices. The services used may include television programs, such as pay TV and interactive television, and Internet applications.

Abstract: A method for establishing a common key for a group of at least three subscribers includes using a publicly known mathematical number group and a higher order element of the group g?G. In the first step, a message corresponding to Ni: =gzi mod p is sent by each subscriber to all other subscribers (Tj), (zi) being a random number chosen from the set (1, . . . , p-2) by a random number generator. In the second step, each subscriber (Ti) selects a transmission key kij:=(gzj)zi for each other subscriber (Tj) from the received message (gzj), with i?j, for transmitting their random number (zi) to the subscribers (Tj). In the third step, the common key k is calculated as k:=f(z1, z2, . . . , zn) for each subscriber Ti.

Abstract: A process is described which can be used to generate a cryptographic key for a group of subscribers whose number is subject to change. The process can further provide that even after the group key has been established, subscribers can be removed from or added to the key directory without great effort.

Abstract: A process is described which can be used to generate a cryptographic key for a group of subscribers whose number is subject to change. The process can further provide that even after the group key has been established, subscribers can be removed from or added to the key directory without great effort.

Abstract: Verification of true authorship on the basis of digital watermarks is described. The digital watermark can be provided with the proof of identity id and/or with the hash value h(m) of the document and/or with a time value t.

Abstract: A method and a device for the routing of specific data, particularly of receiving rights, in a pay-TV terminal, the data being transmitted from a transmitter via a transmission medium to the pay-TV terminal, using mobile data carriers, particularly chipcards. The method and device are characterized in that the pay-TV terminal buffers the specific data and, once a specific mobile data carrier is in communication with the pay-TV terminal, the receiving rights belonging to this mobile data carrier are then routed to said mobile data carrier and stored.

Abstract: A method for financing multimedia content through advertising includes playing back advertising blocks between uses of the content so to finance use of the content by the advertising. Code elements of a key are embedded in predefined locations in the advertising blocks, the key being configured for decryption of the content that follows. The embedded code elements are scanned and collected during the playback of the advertising blocks. The code elements are linked schematically to form the key. The content is encrypted using the key so that a use of the content depends on at least one of a subset of the code elements determined by the advertiser and the key.

Abstract: A method for establishing a common key for a group of at least three subscribers includes using a publicly known mathematical number group and a higher order element of the group g?G. In the first step, a message corresponding to Ni: =gzi mod p is sent by each subscriber to all other subscribers (Tj), (zi) being a random number chosen from the set (1, . . . , p-2) by a random number generator. In the second step, each subscriber (Ti) selects a transmission key kij:=(gzj)zi for each other subscriber (Tj) from the received message (gzj), with i?j, for transmitting their random number (zi) to the subscribers (Tj). In the third step, the common key k is calculated as k:=f(z1, z2, . . . , zn) for each subscriber Ti.

Abstract: A method and device for relaying specific data, especially receiving rights, to a pay television terminal. The data originating from a transmitter is transmitted to the pay television terminal via a transmission medium with the application of mobile data carriers, especially chipcards. The pay television terminal temporarily stores specific data, and afterwards, a specific mobile data carrier is connected to the pay television terminal in a communicative manner. The receiving rights linked to said mobile data carriers are relayed and stored on the data carriers.

Abstract: A method for establishing a common key for a group of at least three subscribers includes using a publicly known mathematical number group and a higher order element of the group g?G. In the first step, a message corresponding to Ni:=gzi mod p is sent by each subscriber to all other subscribers (Tj), (zi) being a random number chosen from the set (1, . . . , p?2) by a random number generator. In the second step, each subscriber (Ti) selects a transmission key kij:=(gzj)zi for each other subscriber (Tj) from the received message (gzj), with i?j, for transmitting their random number (zi) to the subscribers (Tj). In the third step, the common key k is calculated as k:=f(z1, z2, . . . , zn) for each subscriber Ti.

Abstract: A method for key agreement for a cryptographically secured point-to-multipoint connection between a server and a plurality of clients includes altering, as a function of an identifier included in a first server message, a sequence of messages in a handshake initiating a secure socket layer protocol session. The identifier identifies the connection as an IP multicast connection. A MasterKey is generated using the server, the MasterKey being used to generate a session key for encrypting application data. The MasterKey is transmitted to the client.

Abstract: A billing method for requesting contents or data in a network in which the client or the person representing the client has a certificate for the billing method. Said certificate contains data that prove the client's identity and that facilitate establishment of a bill or statement. The Secure Socket Layer (SSL) protocol or a variant of the SSL protocol which allows display of a dialog box may be used for the client-server connection, using an SSL client certificate that contains an extension indicating that the certificate is suitable for the purpose of billing, the server transmitting the price for the required content or the data during the handshake protocol. A confirmation message that is also contained in the SSL protocol and that contains a digital signature is sent from the client to the server, said confirmation message confirming the previously transmitted price.

Abstract: A method for addressing terminals for receiving television programs subject to charge includes dividing the terminals into respective groups, each group having a respective group address. A respective identifier is assigned to each of the terminals of a group, each identifier being a respective binary vector. A data word and the respective group address of a first group is sent so as to address predetermined terminals of the first group. The data word is generated by logically combining the respective binary vectors of the terminals of the first group with a further binary vector, the further binary vector indicating the predetermined terminals.

Abstract: A method for generating/regenerating an encryption key for a cryptographic method including the encryption key as well as a public key being generated using a predefined deterministic method from a large random number (seed), where the seed is only generated on the user side, and for which quantities available only to the user are consulted. Regeneration information (R), which is suitable for regenerating the seed and from which the seed is able to be derived deterministically by the trust center by linking only to information known to it, may be generated on the user side and stored so as to be secured against lost. In the event of loss of the encryption key, the seed may be reconstructed by the trust center by linking the regeneration information to the secret information.

Abstract: The present invention provides a method for generating a common key between a central station and a group of subscribers, e.g., at least three subscribers, exhibit the same standard of security as the DH method.

Abstract: A method for generating a personal identification number (PIN), made up of a number of N decimal digits, to be used for money cards and other devices requiring security, from a binary number having L digits, in particular from a binary code specific to an individual, the PINs are generated such that they are randomly uniformly distributed over the available number domain.

Abstract: In a method for customized data output on a web site, whereby specific data can be added to the content of a web site in targeted manner for an Internet user or a specific group of persons, a list of preferences is filed for the user in a databank of his Internet service provider (ISP), for example under his client number. When the user calls a web site, the web server contacted by the user requests the preferences from the ISP. The server transmits to the databank server, on querying the databank, the temporary IP address from which the web site has been called.

Abstract: A method for identifying betrayers of proprietary data which enables a betrayer, i.e., an authorized subscriber who has disclosed one of his partial keys to a third person without authorization, to be unequivocally identified. A respective subset of encryption keys is assigned to each authorized subscriber according to finite geometric structures and methods such that the necessary characteristic of the k-resilience used for identifying a betrayer is guaranteed. A betrayer search algorithm is used for the unequivocal identification of a betrayer. Coalitions of betrayers may also be unequivocally identified.

Abstract: The invention relates to a method for transmitting data to a subset of users via a radio medium. The users are managed as leaves of a tree structure consisting of a root, knots and leaves. Keys are allocated to the knots and leaves of the tree structure. The users have the keys allocated to their leaf and the knots on the path between their leaf and the root. The data to be transmitted is encoded in such a way that it can be decoded respectively by the key to the knots which are closest to the root, the direct and indirect successors of said knots being only users belonging to the subset. The data can also be decoded by the keys which are allocated to the users belonging to the subset, the path between said users and the root containing no such knots.