Method for allocating useful data to a specific originator

• US 5,208,858 A
• Filed: 01/24/1991
• Issued: 05/04/1993
• Est. Priority Date: 02/05/1990
• Status: Expired due to Fees

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Vollert, Emmeran, Wildgrube, Eberhard
• Primary Examiner(s): Buczinski, Stephen C.
• Application Number:
  US07/645,496
• Time in Patent Office: 831 Days
• Field of Search: 380/21, 380/23, 380/28, 380/30, 380/42, 380/43
• US Class Current: 380/43
• CPC Class Codes: H04L 63/0823 using certificates cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263
• CPC Class Codes: H04L 63/12 Applying verification of the received information cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32
• CPC Class Codes: H04L 9/3231 Biological data, e.g. fingerprint, voice or retina network architectures or network communication protocols for supporting authentication of entities using biometrical features in a packet data network H04L63/0861
• CPC Class Codes: H04L 9/3247 involving digital signatures

Abstract

The hash result of useful data is transmitted to a multiply-protected central server in which it is transformed into a signature on the basis of a crypto operations system combination with a private key code of the originator. The signature is deposited in the central server and is available as what is referred to as a "digital signature" for the transmission of the useful data.

Claims

1. A method for the unambiguous allocation of useful data transmitted between first and second local communication terminals to a specific originator, comprising the steps of:

(a) compressing useful data with a hash method to form a hash result at a first local communication terminal;

(b) transmitting a message including the hash result and a header identifying the originator, the receiver and the nature and extent of further processing to a central server;

(c) processing the data for forwarding in the central processor by

(c1) biometrically authenticating the user on the basis of the header, and

(c2) forming a signature by processing the hash result and a private key code of the user with a first crypto-algorithm;

(d) storing the signature in the central server;

(e) transmitting the signature and the public key code of the user to the user for checking;

(f) checking the signature and the public key code of the user at the first local communication terminal;

(g) in response to a positive result of the check, transmitting the useful data, in clear text, and the signature to the second local communication terminal;

(h) receiving the clear text useful data and the signature at the second local communication terminal;

(i) applying the same hash method to the received clear text data to obtain the same hash result;

(j) applying a second crypto-algorithm which is the inverse of the first crypto-algorithm to the signature;

(k) comparing the results of the steps (i) and (j); and

(l) in response to coincidence in the step (k), indicating a valid allocation of the useful data to the specific user.

2. The method of claim 1, wherein:

the step (d) of storing the signature is performed immediately and in chronological sequence after the step (c2) of forming the signature.

3. The method of claim 1, wherein the step (d) of storing the signature is further defined as:

(d1) storing the signature twice, each in a separate physical location.

4. The method of claim 3, wherein the step (d1) of storing the signature twice is further defined as:

(d1a) storing the signature in a first memory located in a first building; and

(d1b) storing the signature in a second memory located in a second building.

5. The method of claim 4, and further comprising the step of:

(d1b1) monitoring and administering the signature stored in a second memory at the second building from a plurality of entities.

6. The method of claim 1, wherein the step (c) of preparing the data and the step (e) of transmitting the public key code are further defined as:

(m) storing the private and public key codes in the central server, including storing the private key codes in a non-readable fashion; and

(n) administering the private and public key codes via an exclusive interface to a crypto-algorithm computer.

7. A method for the unambiguous allocation of mutual data transmitted between first and second local communication terminals to a specific originator, comprising the steps of:

(a) compressing useful data with a hash method to form a hash result at a first local communication terminal;

(b) transmitting a message including the hash result and a header identifying the originator, the receiver and the nature and extent of further processing to a central server;

(c) processing the data for forwarding in the central processor by

(c1) authenticating the user with a satellite computer connected in front of a crypto algorithm computer;

(c2) electronically filtering the message such that only the data of the hash result is permitted to pass to the crypto algorithm computer, and

(c3) forming a signature by processing the hash result and a private key code of the user with a first crypto algorithm and the crypto algorithm computer while controlling the crypto algorithm computer over a separate control line with the electronic filter;

(d) storing the signature in the central server;

(e) transmitting the signature and a public key code of the user for checking;

(f) checking the signature and the public key code of the user at the first local communication terminal;

(g) in response to a positive result of the check, transmitting the useful data, in clear text, and the signature to the second local communication terminal;

(h) receiving the clear text useful data and the signature at the second local communication terminal;

(i) applying the same hash method to the received clear text data to obtain the same hash result;

(j) applying a second crypto algorithm which is the inverse of the first crypto algorithm to the signature;

(k) comparing the results of the steps (i) and (j); and

(l) in response to coincidence in the step (k), communicating a valid allocation of the useful data to the specific user.