Process for pledging data for a secure data exchange protocol

• US 5,870,476 A
• Filed: 08/23/1996
• Issued: 02/09/1999
• Est. Priority Date: 09/15/1995
• Status: Expired due to Fees

• Current Assignee: Thomson Multimedia SA (Vantiva SA)
• Original Assignee: Thomson Multimedia SA (Vantiva SA)
• Inventors: Fischer, Jean-Bernard
• Primary Examiner(s): Gregory, Bernarr E.
• Application Number:
  US08/702,353
• Time in Patent Office: 900 Days
• Field of Search: 380/6, 380/9, 380/23, 380/24, 380/25, 380/28, 380/30, 380/43, 380/46, 380/49, 380/50, 380/59, 395/235, 395/237, 395/238, 395/239, 395/242, 395/244, 705/26, 705/27, 705/35, 705/37, 705/38, 705/39, 705/44
• US Class Current: 705/75
• CPC Class Codes: G06Q 20/085 involving remote charge determination or related payment systems
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 20/401 Transaction verification
• CPC Class Codes: G06Q 40/00 Finance; Insurance; Tax strategies; Processing of corporate or income taxes
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
• CPC Class Codes: H04L 9/0662 with particular pseudorandom sequence generator
• CPC Class Codes: H04N 7/1675 Providing digital key or authorisation information for generation or regeneration of the scrambling sequence pseudo-random number generators in general G06F7/58

Abstract

The process comprises a "pledging" step in which a debtor party transmits to a creditor party a data item which is the image of a pledged data item, and a "commencement" step in which the debtor party transmits the plain pledged data item to the creditor party who can verify pledge consistency. In the pledging step, the debtor party produces a seed applied to a pseudo-random generator to produce a pseudo-random word, combines this pseudo-random word in a one-to-one and reversible manner with the pledged data item to produce a checkword, and transmits the checkword to the creditor party. In the commencement step, the debtor party transmits to the creditor party the seed together with the plain pledged data item. The creditor party then applies the seed to a pseudo-random generator similar to that of the debtor party to produce another pseudo-random word, combines in the same one-to-one and reversible manner as for the debtor party, this other pseudo-random word with the checkword, to produce a check data item, and checks the consistency of the check data item with the plain pledged data item received from the debtor party.

Claims

1. A process for pledging data for a secure data-exchange protocol, of the type comprising:

a pledging step, in which a debtor party, the holder of a pledged data item, exchanges information with a creditor party to transmit to the creditor party a data item which is the image of the pledged data item, representing the pledged data item in a one-to-one but non-reversible manner,

a commencement step where the debtor party exchanges information with the creditor party to transmit to the creditor party the plain pledged data item or in a manner enabling the plain pledged data item to be retrieved, and in which the creditor party can verify the consistency of the pledged data item with that of the pledging step,

in the pledging step, the debtor party;

produces a seed applied to a pseudo-random generator in such a way as to produce a pseudo-random word, combines this pseudo-random word in a one-to-one and reversible manner with the pledged data item, to produce a checkword, and transmits the checkword to the creditor party,

in the commencement step, the debtor party transmits to the creditor party a seed together with the plain pledged data item, and

the creditor party, upon receiving the seed and the pledged data item;

applies the seed to a pseudo-random generator similar to that of the debtor party, to produce another pseudo-random word,

combines, in the one-to-one and reversible manner as for the debtor party, another pseudo-random word with the checkword, to produce a check data item, and

checks the consistency of the check data item with the plain pledged data item received from the debtor party.

2. The process for pledging data of claim 1, wherein

the pseudo-random word and the other pseudo-random word which are produced by the respective pseudo-random generators of the debtor and creditor parties, are words of the same length as the pledged data item, and

the one-to-one and reversible combining operations are provided by exclusive OR circuits.