Method for a secure data transmission

• US 20070113071A1
• Filed: 06/02/2005
• Published: 05/17/2007
• Est. Priority Date: 08/03/2004
• Status: Abandoned Application

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Salm, Michael, Lindinger, Andreas
• Application Number:
  US10/554,275
• Publication Number:
  US 20070113071A1
• Time in Patent Office: Days
• US Class Current: 713/156
• CPC Class Codes: G06Q 20/341 Active cards, i.e. cards including their own processing means, e.g. including an IC or chip
• CPC Class Codes: G06Q 20/38215 Use of certificates or encrypted proofs of transaction rights
• CPC Class Codes: G06Q 20/388 using mutual authentication without cards, e.g. challenge-response
• CPC Class Codes: G06Q 20/40975 using encryption therefor
• CPC Class Codes: G07C 5/0858 wherein the data carrier is removable
• CPC Class Codes: G07F 7/1008 Active credit-cards provided with means to personalise their use, e.g. with PIN-introduction/comparison system
• CPC Class Codes: H04L 2209/60 Digital content management, e.g. content distribution
• CPC Class Codes: H04L 2209/84 Vehicles
• CPC Class Codes: H04L 9/3263 involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements network architectures or network communication protocols for supporting authentication of entities using certificates in a packet data network H04L63/0823

Abstract

The invention relates to a method for secure data transmission, particularly between a tachograph (51) in a commercial vehicle and memory cards (50), where a first subscriber (T1) has a memory (6, 22) with entries (31-35) comprising identifiers (4) and security certificates (Cert) from second subscribers (T2). Methods for secure data transmission are becoming increasingly important and are frequently associated with a high level of computation complexity. For this reason, the object of the invention is to reduce the computation time for this without security losses. It is proposed that the first subscriber (T1) fetch an identifier (4) from the second subscriber (T2) and compare it with stored identifiers (4). If the identifier (4) matches, a security certificate (Cert) associated with this identifier (4) is the basis for a subsequent data transmission, and if the identifier (4) does not match then security certificate verification is performed.

Claims

1. A method for secure data transmission between a first subscriber and second subscribers, the first subscriber being a tachograph in a commercial vehicle and the second subscriber being memory cards having at least one respective data store, wherein the first subscriber has a memory which stores a particular number of entries each comprising identifiers and associated security certificates from second subscribers with a detection time for the security certificate, the method comprising the steps of:

fetching an identifier by the first subscriber from the second subscribers,

comparing by first subscriber the identifier with the identifiers stored in the memory,

if a matching identifier is present, prompting the security certificate associated with the identifier to be a basis for a subsequent data transmission and updating the detection time for the security certificate to a current system time, and

if no matching identifier is stored in the memory, prompting the first subscriber to perform security certificate verification with the second subscriber and, in the event of verification, storing an entry corresponding to the verified security certificate with a current detection time in the memory, with the entry with the oldest detection date being replaced by the new entry if a particular number of entries has already been reached.

2. The method according to claim 1, wherein the identifier is a public key from an RSA method from the second subscriber.

3. The method according to claim 1, wherein a subsequent data transmission is effected in TDES-encypted form, with verification of the security certificates being followed by both subscribers sending a random number in encrypted form to the other subscriber and both subscribers independently of one another each using the two random numbers to determine a common key for date transmission using the same algorithm.

4. The method according to claim 1, wherein the verification of the security certificate from the first subscriber by the second subscriber and vice versa comprises the following n number of steps:

in a first step, the second subscriber sends the first subscriber a first security certificate which the second subscriber subjects to verification using a first public key and in so doing ascertains a second public key, and

if the verification results in authenticity then the first step is repeated (n-1) times using a further transmitted security certificate and the second public key ascertained in the previous step instead of the first public key, with a new second public key and a verification result always being obtained.

5. The method according to claim 1, wherein n=3.