Abstract:
Method to secure the communication of components within self-service automats that are linked to each other by a bus system, having a transmitter and a receiver, characterized in that data are exchanged as tuples (C,A,R,N,Z) on the transport layer of the bus system where
       C are the message data M encrypted with an encryption key,   A are the message data M authenticated with an authentication key,   R represents the role of a component on the bus system of active or passive participants,   N represents a message counter,   Z represents a session counter.

Description:
BACKGROUND OF THE INVENTION 
       [0001]    1. Technical Field 
         [0002]    The invention relates to a system and a method for securing the communication of components within self-service automats, in particular automated teller machines. 
         [0003]    2. Discussion 
         [0004]    Self-service automats often have a series of components that have to be linked to each other. Usually, these automats have a standardized PC platform that meets special security requirements. Keypads, cash dispensing automats, card readers, monitors and other devices are connected to this PC platform (motherboard), by USB interfaces for example. 
         [0005]    These automats further include the possibility of connecting to another computer so that a maintenance engineer, for example, can connect to the self-service automat using his laptop. 
         [0006]    A situation of this type exists, for example, when the engineer would like to test the money dispensing unit. Using a test program that is installed on the laptop, he can connect to the dispensing unit in order to dispense bills for test purposes. In addition, instances are known in which persons use this technology in order to procure cash in an unauthorized fashion. This latter is achieved by circumventing or manipulating physical security mechanisms. 
         [0007]    Furthermore, security-sensitive cases are known in which a person using a USB tracer (a device that listens in on the traffic on the USB interface) switches to the line of the dispensing unit and the PC for the purpose of analyzing control commands, manipulating them and re-entering commands overheard in order to obtain cash in an unauthorized manner in this way. Furthermore, cases are known in which a person using a USB tracer interposes himself between the line for the card reader and the PC in order to obtain card data in an unauthorized manner. 
         [0008]    The present invention is not categorically restricted to USB; however, USB is a dominant standard for peripheral devices on computers so that in what follows the discussion will center essentially on USB. However, it should be noted that all other connecting standards that may similarly be wireless and follow a similar concept to USB, are to be covered by the invention. 
         [0009]    USB is a serial-bit bus, the individual bits of the data package are transmitted sequentially. Data transmission takes place symmetrically over two twisted wires, one of which transmits the data signal unchanged, the other the inverted signal. The signal receiver creates the voltage differential between the two signals; the voltage swing between levels 1 and 0 is consequently twice as great, irradiated interference is largely eliminated. This increases transmission security, suppresses interference and improves electromagnetic compatibility. Two additional wires are used for the power feed to the attached devices. By using only four strands in one cable, said strands can be made thinner and more economically than with parallel interfaces. A high data transmission rate can be achieved at relatively low cost since it is not necessary to transmit several signals with identical electrical and chronological profiles. 
         [0010]    The bus specification provides for a central host controller (master) that assumes coordination of the connected peripheral devices (the slave clients). Theoretically, up to 127 different devices can be connected to the host controller. Only one USB device can be connected to a USB port at a time. If several devices are to be connected to a host, a distributor (hub) must handle the connection. The result of using hubs is the creation of tree structures that all end in the host controller. 
         [0011]    In spite of its name—Universal Serial Bus—the USB is not a physical data bus. In a bus of this kind, several devices are connected in parallel to one line. The designation “bus” refers to the logical networking, the actual electrical implementation is carried out using only point-to-point connections. 
         [0012]    A USB stack on which the appropriate USB drivers for the devices sit is used to manage information and data transmitted over the USB bus. The USB stack is responsible for the assignment of information to the individual device drivers. 
         [0013]      FIG. 1  shows a stack structure of this kind for two devices. The left column represents the stack structure for a system PC that basically controls the automated teller machine. The RM3 device is a peripheral device that is connected to the system PC over a USB bus for example. This peripheral device may be, for example, an automated teller machine or a card reader in which in turn an operating system is similarly located that manages the USB interface. It can be seen that the system PC has a JDD (Java device driver) layer that is responsible for loading the drivers. Below said JDD is located an object request broker (ORB). The USB transport layer, which in turn sits on the USB driver, is located below said ORB. 
         [0014]    It must be noted that the USB technology has no form of security functions so that the manipulations described above can occur. 
       SUMMARY OF THE INVENTION 
       [0015]    An object of the present invention is to ensure the security of a connecting channel that connects a main control unit (PC module) to peripheral devices. In real terms, the authenticity and the confidentiality of messages on this channel are realized using a combination method. A further object is to provide error tolerance and to prevent old messages from being re-entered. 
         [0016]    The preferred embodiment of the invention concerns methods for securing the communication of components within self-service automats that are connected to each other via a bus system. Such components may be the main board (usually a PC-based motherboard), the card reader, the keypad, the cash dispensing system, screen, etc. A basic distinction is made between an active component (transmitter) and a passive component (receiver). These components are preferably connected by a serial bus system, such as the USB bus. Naturally, no restriction regarding the bus system should exist. Both wireless and wired bus systems can be used. With the USB bus system, for example, encryption is not specified by the standard so that said encryption has to take place at the transport level of the bus system. In so doing, the data are exchanged as tuples (C, A, R, N, Z). The tuple may be configured as a binary record in different forms. The data can also be transmitted in a different sequence or in separate packages. The tuple is intended solely to express the logical relationship. In this tuple, C are the message data M encoded with an encryption key, A are the message data M authenticated with an authentication key, R represents the role of a component on the bus system as active or passive participant (transmitter or receiver), N represents a message counter, Z represents a session counter. The function of the session counter is to see that the key is changed regularly for a new session. Known algorithms can be used on both sides for implementation. Examples from the prior art are: 
         [0017]    AES, DES and any other block ciphers in corresponding operating modes. Details are known to one skilled in the art. In a further embodiment, the above named tuple is expanded so that it now reads (C,A,R,N,Z, {circumflex over (N)}, {circumflex over (Z)}), where {circumflex over (N)} is a message counter of the Δ-last messages N, {circumflex over (Z)} is a last session counter of the Δ-last messages. Through Δ, it can always be specified that the last messages in the transmission are allowed be lost without the need to inform the application layer above it. The transmitter of a channel notes the session number {circumflex over (Z)} and message number {circumflex over (N)} of the last Δ-last messages and, in addition to the pair (N, Z), also sends the pair ({circumflex over (Z)} {circumflex over (N)}) as the current session counter in each message so that a check is possible at the receiver. If fewer than Δ messages have now been lost, no error message is generated. This is always possible when redundancies in data transmission exist. The Δ can be set as a parameter, e.g. by the layer above. A loss of information can occur, for example, when cables are pulled out or other manipulations are carried out to the connection. 
         [0018]    The security measures are based on a key for authentication and a key for encryption. Keys are used that are created when the self-service automats are produced and assembled, and filed securely in the components. 
         [0019]    The keys can be filed in a Trusted Platform Module (TPM), for example, such as is known commercially. The Trusted Platform Module (TPM) is a chip that, as part of the TCG specification (formerly TCPA), restricts computers or other devices that can execute the commands of the TPM. This serves the purposes of license protection and data protection (privacy) for example. The chip is the equivalent of a permanently installed smartcard with the important difference that it is not tied to a specific user (user instance) but to a single computer (hardware instance). Besides its use in PCs, the TPM can be integrated into PDAs, mobile telephones, and entertainment electronics. A device with TPA can no longer be used counter to the interests of the hardware maker, the operator of the licenses or the owner of data by means of software that carries out the commands of the TPM. A benefit for the individual user of a computer is not defined, except in protection against misuse by unauthorized third parties. 
         [0020]    The chip is passive and cannot affect either the booting process or operation directly. 
         [0021]    It contains an unambiguous code and serves to identify the computer. 
         [0022]    Authentication is made on the basis of a known authentication algorithm by A:=Auth[K auth   R , N, M, |M|], where K auth   R  is the result of a secure key generation procedure using a common key K and C:=ENC[K enc   R , Z, N, M], where K enc   R  is the result of a secure key generation procedure using a common key K. In the preferred embodiment, said keys are determined by a hash function. Details can be found farther below. 
         [0023]    To ensure that no data of any kind is lost, a message counter is used that is incremented up to a predetermined natural number at each transmission. 
         [0024]    In detail, the following steps should be carried out when transmitting, check whether the message counter N&lt;N max , if this is given, set N:=N+1. 
         [0025]    When receiving, the following steps are performed, assuming that the last session counter is  Z  and the last message counter is  N .
       Check whether session number Z≦Z max ,   Check whether message number N≦N max      Compare the tuples (Z,N) and (  Z ,  N ), if more than Δ messages have been lost, an error is generated, otherwise,   Carry out decryption   Carry out authentication       
 
         [0031]    At the receiver, the decryption is carried out as follows M′:=DEC[K dec   R , C]; authentication is given if A=A′ where A′:=Auth[K ver   R , N, M′, |C|], 
         [0032]    The method can be used with self-service automats that were mentioned previously, where the component may be both the receiver and the transmitter. Usually, the communication is bi-directional so that receiver and transmitter assume both functions. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0033]    The figures show possible embodiments that are not to be construed in a restrictive sense but are intended only to improve understanding of the invention. 
           [0034]      FIG. 1  shows the stack structure of two self-service components, in this case, a system PC is involved on the one side and an RM3 card reader on the other side; 
           [0035]      FIG. 2  shows the communication of the devices from  FIG. 1  across the layers of the software; 
           [0036]      FIG. 3  shows communication over the USB bus system; 
           [0037]      FIG. 4  shows the encrypted communication over the bus system; 
           [0038]      FIG. 5  shows the steps when generating the common key when the PC motherboard is started up, and when filing in the TPM; 
           [0039]      FIG. 6  shows the steps from  FIG. 5  for the card reader; 
           [0040]      FIG. 7  shows the initialization of the keys between the card reader and the PC. 
       
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0041]    The encrypting model is explained in detail below for a better understanding. 
         [0042]    In the first step a description is given of the designator or variables for the secure channel protocol: 
         [0000]    
       
         
               
               
             
           
               
                   
               
             
             
               
                 A, B 
                 Participants in the protocol 
               
               
                 R ∈ {A, B} 
                 Designator of the active protocol participant 
               
               
                 R′ ∈ {A, B}\{R} 
                 Designator of the passive protocol participant 
               
               
                 N max   
                 Maximum number of messages per session 
               
               
                 Z max   
                 Maximum number of sessions 
               
               
                 HASH [.] 
                 Cryptographically secure hash function, for example 
               
               
                   
                 SHA 1, SHA 256, MD5, etc. 
               
               
                 AUTH [.] 
                 Cryptographically secure message authentication, for 
               
               
                   
                 example by means of HMAC, CBC, MAC ISO9797-1 
               
               
                 ENC [.] 
                 Cryptographically secure encryption procedure, for 
               
               
                   
                 example by means of AES, DES, 
               
               
                 K 
                 Common, long-life key of A and B 
               
               
                 A → B 
                 Session in which A sends messages to B 
               
               
                 B → A 
                 Session in which B sends messages to A 
               
               
                 Z A→B   A   
                 Session counter of A for the session A → B 
               
               
                   
                 (persistent) 
               
               
                 Z B→A   A   
                 Session counter of A for the session B → A 
               
               
                   
                 (persistent) 
               
               
                 Z A→B   B   
                 Session counter of B for the session A → B 
               
               
                   
                 (persistent) 
               
               
                 Z B→A   B   
                 Session counter of B for the session B → A 
               
               
                   
                 (persistent) 
               
               
                 N A→B   A   
                 Message counter of A for the session A → B 
               
               
                 N A→B   B   
                 Message counter of B for the session A → B 
               
               
                 N B→A   A   
                 Message counter of A for the session B → A 
               
               
                 N B→A   B   
                 Message counter of B for the session B → A 
               
               
                 Δ ∈ N 
                 Tolerated length of a sequence of messages that do not 
               
               
                   
                 reach their recipient 
               
               
                   
               
             
          
         
       
     
         [0043]    Functions can be derived from the RC4 algorithm, Temporal Key Integral protocol, MD2, MD4, MD5, SHA, RIPEMD-160, Tiger HAVAL Whirlpool, LM hash NTLM (hash). RSA, AES, etc. can be used as encrypting procedures. 
         [0044]    Basically there is a data dependency. After all the messages sent from transmitter A have arrived at the respective receiver B, the following conditions apply: 
         [0000]    
       
         
               
               
               
             
           
               
                   
                   
               
               
                   
                 A 
                 B 
               
               
                   
                   
               
             
             
               
                   
                 K = 
                 K 
               
               
                   
                 Z A→B   A  =(≧) 
                 Z A→B   B   
               
               
                   
                 Z B→A   A  =(≦) 
                 Z B→A   B   
               
               
                   
                 N A→B   A  =(≧) 
                 N A→B   B   
               
               
                   
                 N B→A   A  =(≦) 
                 N B→A   B   
               
               
                   
                   
               
             
          
         
       
     
         [0045]    This table means that the common key is identical, the session counter is the same or greater. If packages are lost, or if the key was just incremented, the session counter may be higher, the same applies to the message counter. 
         [0046]    Basically, two cases have to be differentiated. In the first case, a package loss is not allowed (thus Δ=0) in the second case a package loss is allowed because of redundancy (Δ≧0) 
       Case Δ=0 
     First a Common Session Counter is Calculated 
       [0047]    Entry: Common key K, role Rε{A,B}
       Session Sε{‘A→B’,‘B→A’}, session counter Z S   R          
 
       KS S   R :=HASH [K, ‘ENC’, S, Z S   R ] 
     KA S   R :=HASH [K, ‘AUTH’, S, Z S   R ] 
     If R=A and S=‘A→B’ 
       [0000]    
       
         
           
             1. K enc   A :=KS S   R    
             2. K ath   A :=KA S   R    
           
         
       
     
       If R=A and S=‘B→A’ 
       [0000]    
       
         
           
             1. K dec   A :=K S   R    
             2. K ver   A :=KA S   R    
           
         
       
     
       If R=B and S=‘A→B’ 
       [0000]    
       
         
           
             1. K dec   B :=K S   R    
             2. K ver   B :=KA S   R    
           
         
       
     
       If R=B and S=‘B→A’ 
       [0000]    
       
         
           
             1. K enc   B :=KS S   R    
             2. K ath   B :=KA S   R    
           
         
       
     
         [0057]    When starting a new session, the following must be taken into account: 
         [0000]    Entry: Common key K, role Rε{A,B},
       Session Sε{‘A→B’,‘B→A’} (i.e. data from A towards B and vice versa) new session counter Z   1. Z S   R :=Z//default Z=Z R   S +1   2. Calculate common session key   3. N R→R′   R :=0       
 
       Send Message: 
       [0062]    Entry: Message M, role Rε{A, B}, message counter N R→R′   R , session counter Z R→R′   R  
       1. Check message counter N R→R′   R &lt;N max      2. Increment message counter N R→R′   R :=N R→R′   R +1   3. Z:=Z R→R′   R ,   4. N:=N R→R′   R      5. A:=AUTH [K auth   R , N, M, |M|]   6. C:=ENC [K enc   R , N, M]   7. Send (C, A, R, N, Z)       
 
       Receive Message: 
       [0070]    Entry: Cipher text C. authentication A, role Rε{A, B}, message number N,
       Session number Z, message counter N R→R′   R  
 
session counter Z R→R′   R  
   1. Check session number [Z≦N max ], [Z≧Z R→R′   R ]→start new session   2. Check message number [N≦N max ;], [N=N R→R′   R +1]   3. Calculate M′:=DEC [K dec   R , C, N]   4. Calculate A′:=AUTH [K ver   R , N, M′, |C|]   5. Check A=A′       
 
         [0077]    In the following, the protocol for Δ&gt;0, in which packages are allowed to be lost because of the redundancy in the higher layer will be described. 
         [0078]    In the following it is to be permissible that sequences from Δ&gt;0 of successive messages may be lost during transmission without an error being displayed. The transmitter for a channel notes the session number {circumflex over (Z)} and message number {circumflex over (N)} of the last Δ messages and also includes in each message, in addition to the pair (current session counter, current message counter), the pair ({circumflex over (Z)}, {circumflex over (N)}). The receiver on the other side notes the session counter  Z  and message counter  N  of the respective last message that it received. In order to check whether a sequence of more than Δ successive messages has been lost, the receiver compares the pairs ({circumflex over (Z)}, {circumflex over (N)}) and (  Z ,  N ) component by component. It can then decide whether, after the last message received, the transmitter sent still more than A many messages or not. 
       Start New Session 
       [0079]    Entry: Common key K, role Rε{A,B},
       Session Sε{‘A→B’,‘B→A’}   1. Z S   R ←Z S   R +1//larger jumps should not be permitted   2. Calculate common session key   3. N S   R :=1//Initialization of message counter       
 
         [0084]    The following steps are performed at the transmitter. 
       Send Message 
       [0085]    Entry: Message M, role Rε{A, B}, message counter N R→R′   R , session counter Z R→R′   R  
       Old message counter for the Δ-last message {circumflex over (N)} R→R′   R      Last session counter for Δ-last message {circumflex over (Z)} R→R′   R  
 
Steps that Run
   1. Check message counter N R→R′   R &lt;N max , otherwise start new session   2. Advance message counter N R→R′   R :=N R→R′   R +1   3. A:=AUTH [K auth   R , N R→R′   R , Z R→R′   R , {circumflex over (N)} R→R′   R , {circumflex over (Z)} R→R′   R , |M|, M]   4. C:=ENC [K enc   R , Z, N, M]   5. Send (C, A, R, N R→R′   R  Z R→R′   R , {circumflex over (N)} R→R′   R , {circumflex over (Z)} R→R′   R )       
 
         [0093]    The following steps are performed at the receiver. 
       Receive Message: 
     Entry: 
       [0000]    
       
         
           
             Cipher text C, authentication A, role R, 
             Current message counter N R→R′   R , current session counter Z R→R′   R    
             Δ-last message counter {circumflex over (N)} R→R′   R , Δ-last session counter {circumflex over (Z)} R→R′   R    
             Last session counter  Z , last message counter  N 
 
Steps that Run
 
             1. Check session number [Z≦Z max ] 
             2. Check message number [N≦N max ] 
             3. Compare tuples ({circumflex over (Z)} R→R′   R , {circumflex over (N)} R→R′   R ) with (  Z ,  N ) error, more than Δ messages lost 
             4. Calculate M′:=DEC [K dec   R , C, N] 
             5. Calculate A′:=AUTH [K auth   R , N R→R′   R , Z R→R′   R , {circumflex over (N)} R→R′   R , {circumflex over (Z)} R→R′   R , |M|, M] 
             6. Check A=A′ 
           
         
       
     
         [0104]    In the following, the Figures that were mentioned above will be described in more detail. 
         [0105]      FIG. 1  shows a system PC that is connected over a USB interface to a peripheral device, in this case a card reading device, or alternatively to a cash dispensing device (RM3). The system PC has different layers. First, the USB driver that sits directly on the hardware must be named. Then, above that is the USB transport layer that serves to transmit data and at which level encryption takes place. Above that, is an object request broker (ORB). A Java driver manager (JDD/Java device driver) is disposed thereon in turn. Furthermore, there is an encryption module that has access to a session key and thus prepares a secure channel. The session key is derived from a base key. The card reading device in turn similarly derives its session key from a base key and has a similar structure. 
         [0106]      FIG. 2  shows the data flow between the two devices with reference to  FIG. 1 . Up to the USB transport layer, the data are unencrypted in order to have them encrypted by the encryption module. Then these data are transmitted encrypted in order for them to be decrypted again at the receiving device. 
         [0107]      FIG. 3  shows the USB data connection with the different active and passive alignment of the components. This session EP 0  is, for example, unencrypted. Sessions EP 1  and EP 2  are encrypted, where the PC is the client (passive) and the RM3 is the server (active). Sessions EP 3  and EP 4  in turn are similarly encrypted, where here the PC is the active participant and the card reading device is the passive participant. 
         [0108]    On the basis of  FIG. 3 ,  FIG. 4  shows the encrypted information that is exchanged between the devices, where an appropriate encryption key and an authentication key are used. Details are described above. 
         [0109]      FIGS. 5-7  shows the generation of the common key K that is generated at the time the apparatus is originally assembled. 
         [0110]      FIG. 5  shows the initialization of the PC with a TPM module. On the basis of a PKI (public key infrastructure), an authentication key is generated, and said key is then signed publicly. Then the public key and a suitable certificate are imported. Then the root certificate is imported from the PKI. All this information is deposited in the TPM. 
         [0111]    In the RM3 module, or in the chip card reader, a key pair is generated, and a request is made to the PKI to certify a public key. Then this public key is certified, and in the next step said key is imported again into the component of the self-service automat. Further, the CA root certificate of the PKI is imported. After both components have been prepared, said components are connected to each other, and the steps described in  FIG. 7  are performed. A technician authenticates himself to the system and requests the system to carry out a key initialization. Then the components communicate with each other. The two components exchange their certificates and inspect said certificates. If it turns out that the certificates are correct, a secret base key is transmitted in code. The above named algorithms build on this common base key.