06.11.2014 Views

A User Centric Security Model for Tamper-Resistant Devices

A User Centric Security Model for Tamper-Resistant Devices

A User Centric Security Model for Tamper-Resistant Devices

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

7.5 Plat<strong>for</strong>m Binding Protocol<br />

The rst message (PBP-1) contains the pseudo identities of individual smart cards (e.g.<br />

SCA and SCB), along with a random number generated by the SCA (N SCA ). In addition,<br />

the SCA will generate a Die-Hellman exponential g r SCA but to prevent a possible partial<br />

key chosen attack (see section 6.2.3) it does not send the g r SCA . Instead, it sends a<br />

commitment that is basically a hash generated on the g r SCA , random number and the<br />

recipient's pseudo identity.<br />

PBP-2. SCB : SCB cm = h(N SCB ||g r SCB||SCA ′ i )<br />

SCB → SCA : SCB ′ i ||SCA′ i ||N SCB||SCB cm ||SCB Sup<br />

In response, the SCB will select a Die-Hellman group that it can support and include<br />

the selection as SCB Sup . The SCB will also generate its commitment (SCB cm ) similar<br />

to the SCA in the rst message, and sends it to the SCA including the SCB Sup . The<br />

commitments are made by both communicating entities and now in subsequent messages<br />

they can send the generated Die-Hellman exponential.<br />

PBP-3. SCA → SCB : g r SCA||SCA ′ i ||SCB′ i ||N SCA||N SCB<br />

SCB : K DH = (g r SCA) r SCB<br />

mod n<br />

SCB : K SCA−SCB = f KDH (N SCA ||N SCB ||0)<br />

SCB : mK SCA−SCB = f KDH (N SCB ||N SCA ||0)<br />

The SCA will send the Die-Hellman exponential to the SCB along with pseudo-identities<br />

and random numbers generated in previous messages.<br />

On receipt, the SCB will generate the Die-Hellman secret (K DH ). The SCB generates<br />

the PBP master keys (eK SCA−SCB and mK SCA−SCB ) that are used to generate session<br />

keys <strong>for</strong> the current (e.g. k SCA−SCB and mk SCA−SCB ) and all future sessions.<br />

PBP-4. SCB : cfb = h(N SCA ||g r SCB||g r SCA)<br />

SCB : mE = e kSCA−SCB (V R||SCA ′ i ||SCB i||cfb||CertS SCB )<br />

SCB → SCA : g r SCB||N SCB ||mE||f mkSCA−SCB (mE)<br />

In response, the SCB will ask the plat<strong>for</strong>m <strong>for</strong> assurance and validation proof (i.e. V R)<br />

from the SCB. Furthermore, the pseudo identity of the SCA is appended with the true<br />

identity of the SCB along with the commitment hash generated (cfb) by the SCA, Die-<br />

Hellman exponential and cryptographic certicate of the SCB. The entire message, except<br />

<strong>for</strong> the Die-Hellman Exponential and the generated random number, is encrypted and<br />

MACed using the generated session keys.<br />

On receipt of the message four (PBP-4), the SCA will also generate the Die-Hellman<br />

secret along with session keys similar to the SCB. It will then verify the SCB's cryptographic<br />

certicate. If both smart cards are being evaluated by the same laboratory then<br />

177

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!