You have just completed your registration at OpenAire.
Before you can login to the site, you will need to activate your account.
An e-mail will be sent to you with the proper instructions.
Important!
Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version
of the site upon release.
For a long time, pairings on elliptic curves have been considered to be destructive in elliptic curve cryptography. Only recently after some pioneering works, particularly the well-known Boneh-Franklin identity-based encryption (IBE), pairings have quickly become an important\ud tool to construct novel cryptographic schemes.\ud In this thesis, several new cryptographic schemes with pairings are proposed, which are both efficient and secure with respect to a properly defined security model, and some\ud relevant previous schemes are revisited.\ud IBE provides a public key encryption mechanism where a public key can be an arbitrary string such as an entity identifier and unwieldy certificates are unnecessary. Based on the Sakai-Kasahara key construction, an IBE scheme which is secure in the Boneh-Franklin IBE model is constructed, and two identity-based key encapsulation mechanisms are proposed. These schemes achieve the best efficiency among the existing schemes to date. Recently Al-Riyami and Paterson introduced the certificateless public key encryption (CL-PKE) paradigm, which eliminates the need of certificates and at the same time retains the desirable properties of IBE without the key escrow problem. The security formulation of CL-PKE is revisited and a strong security model for this type of mechanism is defined.\ud Following a heuristic approach, three efficient CL-PKE schemes which are secure in the defined strong security model are proposed. Identity-based two-party key agreement protocols from pairings are also investigated.\ud The Bellare-Rogaway key agreement model is enhanced and within the model several previously unproven protocols in the literature are formally analysed. In considering that the user identity may be sensitive information in many environments, an identity-based key agreement protocol with unilateral identity privacy is proposed.
5 Identity-Based Key Agreement Protocols 5.1 Introduction . 5.2 Two-Party Key Agreement Security Model 5.3 Review on Existing Schemes from Pairing . 5.4 Security Analysis of the SCK and SYL Protocol. 5.4.1 Security Analysis of the SCK Protocol 5.4.2 Security Analysis of the SYL Protocol 5.4.3 The Built-in Decisional Function . 5.4.4 Group Membership Testing . 5.5 Security Analysis of the McCallugh-Barreto Protocol . 5.5.1 The MB Protocol and its Variants . 5.5.2 On the Existing Security Proofs . 5.5.3 A Modified Scheme and its Security Analysis . 5.6 An Identity-Based KAP with Unilateral Identity Privacy. 5.6.1 Description of the Scheme . 5.6.2 Security Model of KAP with Identity Privacy 5.6.3 Security Analysis of the Scheme . . . 5.6.4 Efficiency Discussion and Comparison . . . .
[1] M. Abadi. Private authentication. In Proc. of Privacy Enhancing Technologies 2002, LNCS 2482, pp. 27-40, 2002.
[3] M. H. Au, J. Chen, J. K. Liu, Y. Mu, D. S. Wong and G. Yang. Malicious KGC attack in certificateless cryptography. Cryptology ePrint Archive, Report 2006/255, 2006.
[4] N. Attrapadung, B. Chevallier-Mames, J. Furukawa, T. Gomi, G. Hanaoka, H. Imai and R. Zhang. Efficient identity-based encryption with tight security reduction. In Proc. of CANS06, LNCS 4301, pp. 19-36, 2005. Also available on Cryptology ePrint Archive, Report 2005/320, 2005.
[5] S. S. Al-Riyami and K. G. Paterson. Certificateless public key cryptography. In Pmc. of Advances in Cryptology - Asiacrypt 2003, LNCS 2894, pp. 452-473, 2003.
[6] S. S. Al-Riyami and K. G. Paterson. CBE from CL-PKE: a generic construction and efficient schemes. In Proc. of Public Key Cryptography - PKC 2005, LNCS 3386, pp. 398-415, 2005.
[7] M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology 15(2):103-127, 2002.
[8] M. Burrows, M. Abadi and R. Needham. A logic for authentication. DEC Systems Research Center Technical Report 39, 1990.
[11] D. Boneh and X. Boyen. Short signatures without random oracles. In Proc. of Advances in Cryptology - Eurocrypt 2004, LNCS 3027, pp. 56-73, 2004.
[12] D. Boneh and X. Boyen. Secure identity-based encryption without random oracles. In Proc. of Advances in Cryptology - Crypto 2004, LNCS 3152, pp. 443-459, 2004.
[13] M. Bellare, A. Boldyreva and A. Palacio. An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In Proc. of Advances in Cryptology - Eurocrypt 2004, LNCS 3027, 2004.
[14] M. Barbosa, L. Chen, Z. Cheng, M. Chimley, A. Dent, P. Farshim, K. Harrison, J. Malone-Lee, N.P. Smart and F. Vercauteren. SK-KEM : an identity-based KEM. Sumission to IEEE P1363.3, 2006.
[15] M. Bellare, R. Canetti and H. Krawczyk. Keying hash functions for message authentication. In Proc. of Advances in Cryptology - Crypto '96, LNCS 1109, pp. 1-15, 1996.
[16] M. Bellare, R. Canetti and H. Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols. In Proc. of the 30th STOC, pp. 419-428, ACM Press, 1998.
[19] D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. In Pme. of Advances in Cryptology - Crypto 2001, LNCS 2139, pp. 213-229, 2001.
[20] K. Bentahar, P. Farshim, J. Malone-Lee and N. P. Smart. Generic constructions of i2d0e0n5t.ity-based and certificateless KEMs. Cryptology ePrint Archive, Report 2005/058 1
[21] P. Barreto. The pairing based crypto lounge. com.br/informatica/paulobarreto/pblounge.html.
[29] J. Baek, R. Safavi-Naini and W. Susilo. Certificateless public key encryption without pairing. In Proc. of the 8th International Conference on Information Security (ISe 2005), LNCS 3650, pp.134-148, 2005.
[30] M. Bellare, D. Pointcheval and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Proc. of Advances in Cryptology - Eumcrypt 2000, LNCS 1807, pp. 139-155, 2000.
[31] M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. of the 1st CCS, pp. 62-73, 1993.
[32] M. Bellare and P. Rogaway. Entity authentication and key distribution. In Proc. of Advances in Cryptology - Crypto '93, LNCS 773, pp. 232-249, 1993.
[40] Z. Cheng. Simple SK-ID-KEM. notes, June, 2005.
[41] J. H. Cheon. Security analysis of the strong Diffie-Hellman problem. In Proc. of Advances in Cryptology - Eurocrypt 2006, LNCS 4004, pp. 1-11, 2006.
[42] C. Cocks. An identity-based encryption scheme based on quadratic residues. In Proc. of Cryptography and Coding, LNCS 2260, pp. 360-363, 2001.
[43] K. Choo, C. Boyd and Y. Hitchcock. On session key construction in provably-secure key establishment protocols: revisiting Chen & Kudla (2003) and 1'.IcCullagh & Barreto (2005) ID-Based Protocols. Cryptology ePrint Archive, Report 2005/206, 2005.
[44] S. Chow, C. Boyd and J. Nieto. Security-mediated certificateless cryptography. In proc. of Public Key Cryptography 2006, LNCS 3958, pp. 508-524.
[45] J. C. Cha and J. H. Cheon. An identity-based signature from gap Diffie-Hellman groups. In Proc. of Public Key Cryptography PKC 2003, LNCS 2567, pp. 18-30, 2003.
[46] Z. Cheng and R. Comley. Efficient certificateless public key encryption. Cryptology ePrint Archive, Report 2005/012, 2005.
[47] Z. Cheng and L. Chen. On security proof of McCullagh-Barreto's key agreement protocol and its variants. To appear in International Journal of Security and Networks _ Special Issue on Cryptography in Networks. Also available on Cryptology ePrint Archive, Report 2005/201, 2005.
[48] L. Chen and Z. Cheng. Security proof of the Sakai-Kasahara's identity-based encryption scheme. In Proc. of Cryptography and Coding 2005, LNCS 3706, pp. 442-459, [51] L. Chen, Z. Cheng, J. Malone-Lee and N. Smart. An efficient ID-KEl\1 based on the Sakai-Kasahara key construction. In lEE Proc. Information Security, Vol 153(1), pp. 19-26, 2006.
[52) L. Chen, Z. Cheng and N. Smart. Identity-based key agreement protocols from pairings. To appear in International Journal of Information Security. Also available on Cryptology ePrint Archive, Report 2006/199, 2006.
[54] R. Canetti, O. Goldreich and S. Halevi. The random oracle methodology, revisited. In J. ACM, 51(4):557-594, 2004.
[56) R. Canetti, S. Halevi and J. Katz. A forward-secure public-key encryption scheme. In Proc. of Advances in Cryptology - Eumcrypt 2003, LNCS 2656, pp. 255-271 2003.
[97] D. Hofheinz, J. Muller-Quade and R. Steinwandt. Initiator-resilient universally composable key exchange. In Proc. of ESORICS 2003, LNCS 2808, pp. 61-84, 2003.
[98] F. Hess, N.P. Smart and F. Vercauteren. The Eta pairing revisited. Cryptology ePrint Archive, Report 2006/110, 2006.
[99] Q. Huang and D. S. Wong. Generic certificateless encryption in the standard model. Cryptology ePrint Archive, Report 2007/095, 2007.
[119] S. Li, Q. Yuan and J. Li. Towards secure two-part authenticated key agreement protocols. Cryptology ePrint Archive, Report 2005/300, 2005.
[120] V. Miller. Use of elliptic curves in cryptography. In Proc. Advances in cryptology _ Crypto '85, LNCS 218, pp. 417-426, 1986.
[157] O. Schirokauer, D. Weber and T. Denny. Discrete logarithms: the effectiveness of the index calculus method. In Pmc. of ANTS II, LNCS 1122, pp. 337-351, 1996.
[168] Z. Zhang and D. Feng. On the security of a certificateless public-key encryption. Cryptology ePrint Archive, Report 2005/426, 2005.