The present invention relates to protocols for restricting access to sensitive information embedded in documents such as passports and identity cards.
Existing passport security technology links identity of an individual by embedding a photograph within the passport.
The existing linkage is not cryptographically strong as substituting a different photograph is relatively easy. Also, the photograph is compared manually to the face of the traveler by the border control inspector, which has certain problems.
To enhance security, it has been proposed to provide machine-readable passport or identity card in which biometric data is stored in a chip within the document and can be retrieved for examination. Typically, the biometric data will be an iris scan, fingerprint or images of the face of the bearer.
The International Civil Aviation Organisation (ICAO) has proposed machine readable travel documents (MRTD), i.e. e-Passport system that authenticates the identity of individuals to border control stations by cryptographically linking the identity of the individual (such as name and nationality) to biometric data for the individual.
The cryptographic linkage is obtained by digitally signing the identity data and biometric data of the individual. The resulting signed identity and biometric information is conveyed from the passport to a passport reader. The signature binds the identity of the individual to the biometric identity, which makes faking a passport a cryptographically hard problem. A concern arises however that each individual's biometric information is highly sensitive and should not be inadvertently made available.
It is therefore an object of the present invention to obviate or mitigate the above disadvantages by making it more difficult for unauthorized parties to obtain the biometric information and other sensitive information from a document such as a passport.
An embodiment of the invention will now be described with reference to the appended drawings wherein:
Referring therefore to
As shown in
The cryptographic unit 34 includes an arithmetic processor 38 for performing cryptographic operations and a secure memory 40 for storing private keys and certificates. Preferably, the underlying cryptographic system is an elliptic curve cryptosystem. The cryptographic unit 34 includes the parameters of the underlying system, such as the curve, and the generator G of the points on the curve and has access to the public key Q of the passport.
In the preferred embodiment, the memory 40 includes a private signing key d, the corresponding public key Q=dG, and a certificate, Cert Q, which is issued by a certification authority, such as the passport issuer, which certifies the public key Q. The processor 38 can perform cryptographic operations such as point addition, key derivation and hash functions. The cryptographic unit 34 also includes a random number generator (RNG) 42 to provide integers for use as private session keys.
The data processing engine 26 of the reader 20 also includes a cryptographic unit 50 including a random number generator 52 and an arithmetic processor 54.
In operation, the scanner 20 initiates a message transfer by activating the chip 12 through the RFID tag 14. A message M is assembled consisting of the data required for processing the passport and confirming identity such as the biometric data, bearer's name, nationality and date of birth together with the certificate of the bearer's public key Cert Q. The data utilized will depend on the information required by the passport control.
The message M is divided into two parts, M1, M2, with the sensitive information to be maintained confidential such as the biometric data within the message part M1. Less sensitive or publicly available information such as the country of issue or visa is included in the message part M2.
A random number k is generated by the RNG 42 and a value R=kQ computed. The value R is used in a key derivation function (KDF) performed in the processor 38 to obtain a session encryption key e. Any suitable KDF may be utilized, typically one utilizing a secure hash function.
The message part M1, is checked for a predetermined level of redundancy and, if that is not met, additional data added. The session encryption key e, is used to encrypt the message part M1 to cyphertext C. The cyphertext C is then concatenated with the message part M2 and hashed using a secure hash function H to obtain a value, h, i.e. h=H(C, M2).
A signature component s is then computed using the relationship s=k+dh mod n where n is the order of the generator G.
Data is then transferred through the RF ID tag 14 including the signature component s, the public part of the message M2, (which includes the certificate of the public key Q) and the cyphertext C.
The reader 20 captures the data and initially verifies the public key Q from the certificate. It then computes a value V=sG−hQ and generates a private session key b from the RNG 52. A public session key U=bV is then computed and sent to the chip 12 through the RF ID connection. The chip 12 confirms that the point U is a point on the curve and generates a further public key W=dU that is sent back to the reader 20.
The reader then uses the private session key b to compute a value equal to R, namely (b−1 mod n) W and then uses the KDF to get the value corresponding to e. Using the computed value of e, the cyphertext C is decrypted and the biometric data in the message part M1 is recovered. The redundancy of the recovered data is checked and, if above the required level it is accepted.
The recovered data is then compared the reference data obtained from the scanner to authenticate the bearer of the passport.
By separating the message and encrypting the biometric data, its confidentiality may be maintained even to an eavesdropper.
The signing process above is quite efficient for the signer. The computation of R=kQ can be done in advance, or with assistance of fixed pre-computed multiples of Q. The most expensive step for the signer is computing W=dU.
The data exchange may also be enhanced by providing for authentication of the reader 20. In this way, the signer can choose whether or not to interact with the verifier. Ideally, the verifier should authenticate itself to the signer, such as by a digital signature or some symmetric key system. In this way, the signer can control to whom the message portion M1 is revealed. This can be done prior to the initial exchange of data or during the exchange before the value W is transferred.
If the signing is too expensive computationally, then the following modification is possible. The verifier sets b=1. Then W=R, which the signer has already computed during signature generation. To keep M1 confidential, this alternate approach requires that R can be sent to the verifier confidentially. In particular, passive eavesdroppers should not be able to intercept R. This might be accomplished by physical means, such as weak RF signals, or by some form of encryption, such as the e-passport basic access control encryption system.
By utilizing the bearer's public key Q in the computation of R, the signature cannot be verified without involvement of the bearer. In particular, the cyphertext C cannot be decrypted without the acquiescence of the bearer.
It will be noted that once the verifier recovers R, it can compute dQ, which can be seen to enable message recovery from the signature, that is, without the interactive verification process.
This application is a continuation of U.S. patent application Ser. No. 11/436,986 filed on May 19, 2006 and issued under U.S. Pat. No. 7,720,221, which claims priority from U.S. Provisional Patent Application No. 60/682,862 filed on May 20, 2005 hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
6041410 | Hsu et al. | Mar 2000 | A |
6230269 | Spies et al. | May 2001 | B1 |
6487661 | Vanstone et al. | Nov 2002 | B2 |
6598161 | Kluttz et al. | Jul 2003 | B1 |
6636968 | Rosner et al. | Oct 2003 | B1 |
6748533 | Wu et al. | Jun 2004 | B1 |
7123721 | Panjwani et al. | Oct 2006 | B2 |
7178027 | Faigle | Feb 2007 | B2 |
7249259 | Vanstone et al. | Jul 2007 | B1 |
7356140 | Imai et al. | Apr 2008 | B2 |
7571471 | Sandhu et al. | Aug 2009 | B2 |
7657748 | Gentry | Feb 2010 | B2 |
8209535 | Lee et al. | Jun 2012 | B2 |
8549283 | Lim | Oct 2013 | B2 |
20010008013 | Johnson et al. | Jul 2001 | A1 |
20020013898 | Sudia et al. | Jan 2002 | A1 |
20020021804 | Ledzius et al. | Feb 2002 | A1 |
20020062451 | Scheidt et al. | May 2002 | A1 |
20020165912 | Wenocur et al. | Nov 2002 | A1 |
20030023858 | Banerjee et al. | Jan 2003 | A1 |
20030044019 | Vanstone et al. | Mar 2003 | A1 |
20030081785 | Boneh et al. | May 2003 | A1 |
20030135740 | Talmor et al. | Jul 2003 | A1 |
20030147536 | Andivahis et al. | Aug 2003 | A1 |
20040030921 | Aldridge et al. | Feb 2004 | A1 |
20040131190 | Nobel et al. | Jul 2004 | A1 |
20050033974 | Ansell et al. | Feb 2005 | A1 |
20050091501 | Osthoff et al. | Apr 2005 | A1 |
20050135606 | Brown | Jun 2005 | A1 |
20050240778 | Saito | Oct 2005 | A1 |
20050246533 | Gentry | Nov 2005 | A1 |
20060129818 | Kim et al. | Jun 2006 | A1 |
20080000969 | Salomonsen et al. | Jan 2008 | A1 |
Entry |
---|
Zheng, Yuliang; Imai, Hideki; “How to construct efficient signcryption schemes on elliptic curves”; Dec. 15, 1998; pp. 227 to 233; Information Processing Letters; vol. 68, No. 5; Elsevier; ISSN: 0020-0190. |
Technical Report—“PKI for Machine Readable Travel Documents offering ICC Read-Only Access”; Version 1.1; Oct. 1, 2004; International Civil Aviation Organization. |
Hinde, S.; “2001: A Privacy Odyssey Revisited”; Jan. 1, 2001; pp. 16 to 34; Computers & Security; vol. 21, No. 1; Elsevier Science Publishers: ISSN: 0167-4048. |
Carnerero, Alvaro F.; Supplementary Search Report from corresponding European Application No. 06741548.9; search completed Sep. 24, 2010. |
Technical Report—PKI for Machine Readable Travel Documents; Version 1.1; Oct. 1 , 2004; International Civil Aviation Authority. |
Juels, Ari et al.; “Security and Privacy Issues in E-passports”; Mar. 28, 2005; IEEE SecureComm 2005. |
Number | Date | Country | |
---|---|---|---|
20100250945 A1 | Sep 2010 | US |
Number | Date | Country | |
---|---|---|---|
60682862 | May 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11436986 | May 2006 | US |
Child | 12776803 | US |