Non-repudiation in computer networks

• US 5,226,079 A
• Filed: 10/16/1991
• Issued: 07/06/1993
• Est. Priority Date: 11/09/1990
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Holloway, Christopher J. G.
• Primary Examiner(s): CANGIALOSI, SALVATORE A
• Application Number:
  US07/777,848
• Time in Patent Office: 629 Days
• Field of Search: 380/25, 380/49, 380/9
• US Class Current: 713/177
• CPC Class Codes: G07F 7/1016 Devices or methods for securing the PIN and other transaction-data, e.g. by encryption arrangements for secret communication, see H04L9/00
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 9/3234 involving additional secure or trusted devices, e.g. TPM, smartcard, USB or software token network architectures or network communication protocols for supporting authentication of entities using an additional device in a packet data network H04L63/0853
• CPC Class Codes: H04L 9/3242 involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC

Abstract

The invention supplements the use of a conventional authentication token such as a MAC or DSG, to provide very strong evidence of the origin of an electronic message. A new type of authentication token, known as the "Non-Repudiation Vector" (NRV) is attached to each message sent across a data network. The NRV cryptographically links each message sent or received by a particular data processor on the network to previous and subsequent messages handled by that data processor, to create a chain of cryptographically linked messages. The burden of proof for the repudiation of a message is transferred to the sender of a message, who must demonstrate how the sending data processor could have moved through the time period during which the disputed message was sent, without generating the NRV corresponding to the disputed message.

Claims

1. A first data processor (10), connected to a network of other data processors (20, 30), comprising:

means (300) for sending a message to a second data processor forming part of the network; and

means (310) for cryptographically combining information derived from said message (600), information (612, 613, 614,

     615) derived from one or more previous messages transferred between said first data processor and one of said other data processors forming part of the network, and secret information (611) held by the said first data processor, to produce a non-repudiation vector including an authentication token (540), said token cryptographically combined with said message.

2. A data processor as claimed in claim 1, further comprising means (300) for sending said token with said message to said second data processor.

3. A data processor as claimed in claim 2, in which some or all of the information derived from the one or more previous messages is derived from the token associated with that message or messages.

4. A data processor as claimed in claim 3, further comprising:

means (140) for generating an authentication token (580) from said message and its associated token, thereby cryptographically associating said message and said associated token; and

means for sending said authentically token to a receiver of the message.

5. A data processor as claimed in claim 4, in which said authentication token comprises control information (510), information derived from the current message, information derived from the previous message in the current transaction, and information derived from the last message sent by said first data processor.

6. A data processor as claimed in claim 5, further comprising a store (340) for storing secret information derived from the token or the associated message or both.

7. A data processor as claimed in claim 6, in which, non-secret information derived from the message or its associated token or both is stored in the store, and in which the data processor further comprises means for enciphering some or all of the information to be stored.

8. A data processor as claimed in claim 7, in which each entry in the store is linked to an adjacent entry in the store;

and information is stored in the store in chronological order.

9. A data processor as claimed in claim 8, in which each entry in the store corresponding to a message forming part of a transaction comprising a plurality of messages is linked to the previous message in that transaction.

10. A data processor as claimed in claim 9, in which each entry in the store is linked to the entry corresponding to the last message sent by the data processor.

11. A data processor as claimed in claim 7, further comprising means (400), when connected to the network, for receiving a message sent by a data processor forming part of the network.

12. A data network (10, 20, 30, 40, 50, 60) comprising a plurality of data processors (10, 20, 30) as claimed in claim 7, and means (40, 50, 60) connecting the data processors for the transfer of messages therebetween.

13. A method for effecting non-repudiation of a data message in a computer network, including a plurality of data processors comprising the steps of:

(a) initiating (110) a data message (550) in a first data processor (300) for transmission to second data processor (400) in the computer network;

(b) generating (310) a non-repudiation vector (540), including an authentication token (530) derived from one or more previous messages transferred between said first data processor and one of said other data processors forming part of the network, and secret information (611) held by said first data processor;

(c) cryptographically combining said vector (540) to the data message (550) to form a compound message; and

(c) enciphering (140) said compound message for transmission to said second data processor (400).

14. The method of claim 13 further including the steps of:

(a) maintaining a non-repudiation log (340);

previous message information under the control of a key (320); and

a message authentication code under the control of a key (330) for generation of the non-repudiation vector (540).

15. The method of claim 13 including the following steps in the data processor (400):

(a) deciphering (210) the compound message using a key (330);

(b) verifying the authentication token (530) in a non-repudiation vector verifier (430);

(c) stripping the non-repudiation vector (540) from the compound message;

(d) generating and storing an entry in a non-repudiation log (440) from the message (550), the non-repudiation vector (540) and one or more previous entries from said log (440) using a key (410); and

(e) storing (250) said second data message (550) in the data processor 400.

16. The method of claim 13 further including the step of:

(a) generating a generated non-repudiation token (680) and a linked non-repudiation token (670) as a part of the non-repudiation token (520).

17. The method of claim 16 further including the steps of:

(a) generating a message authentication code (MAC

     620) and (MAC 1

     650) to form a cryptographic link between a data message (550) and the non-repudiation vector (540); and

(b) generating a message authentication code (660) to form a cryptographic link between the message (550);

a previous transaction message (614,

     615);

a previous generated message (612,

     613);

a previous message (611) stored in the log (340).

18. The method of claim 16 further including the steps of:

(a) concatenating message authorization codes (652 and

     662) to form said generated non-repudiation token (680), and

(b) concatenating message authorization codes (661 and

     651) to form said linked non-repudiation token (670).