KSII Transactions on Internet and Information Systems

An Efficient and Provable Secure Certificateless Identification Scheme in the Standard Model

Ji‐Jian Chin, Swee‐Huay Heng, Raphaël C.‐W. Phan

Published Jul 29, 2014• 9 citations

Abstract

In Asiacrypt 2003, Al-Riyami and Paterson proposed the notion of certificateless cryptography, a technique to remove key escrow from traditional identity-based cryptography as well as circumvent the certificate management problem of traditional public key cryptography.Subsequently much research has been done in the realm of certificateless encryption and signature schemes, but little to no work has been done for the identification primitive until 2013 when Chin et al. rigorously defined certificateless identification and proposed a concrete scheme.However Chin et al.'s scheme was proven in the random oracle model and Canetti et al. has shown that certain schemes provable secure in the random oracle model can be insecure when random oracles are replaced with actual hash functions.Therefore while having a proof in the random oracle model is better than having no proof at all, a scheme to be proven in the standard model would provide stronger security guarantees.In this paper, we propose the first certificateless identification scheme that is both efficient and show our proof of security in the standard model, that is without having to assume random oracles exist.

DOI: 10.3837/tiis.2014.07.019

Related papers

Encryption schemes and key exchange protocols in the certificateless setting

Georg Lippold

The contributions of this thesis fall into three areas of certificateless cryptography. The first area is encryption, where we propose new constructions for both identity-based and certificateless cryptography. We construct an n-out-of- n group encryption scheme for identity-based cryptography that does not require any special means to generate the keys of the trusted authorities that are participating. We also introduce a new security definition for chosen ciphertext secure multi-key encryption. We prove that our construction is secure as long as at least one authority is uncompromised, and show that the existing constructions for chosen ciphertext security from identity-based encryption also hold in the group encryption case. We then consider certificateless encryption as the special case of 2-out-of-2 group encryption and give constructions for highly efficient certificateless schemes in the standard model. Among these is the first construction of a lattice-based certificateless encryption scheme. Our next contribution is a highly efficient certificateless key encapsulation mechanism (KEM), that we prove secure in the standard model. We introduce a new way of proving the security of certificateless schemes based that are based on identity-based schemes. We leave the identity-based part of the proof intact, and just extend it to cover the part that is introduced by the certificateless scheme. We show that our construction is more efficient than any instanciation of generic constructions for certificateless key encapsulation in the standard model. The third area where the thesis contributes to the advancement of certificateless cryptography is key agreement. Swanson showed that many certificateless key agreement schemes are insecure if considered in a reasonable security model. We propose the first provably secure certificateless key agreement schemes in the strongest model for certificateless key agreement. We extend Swanson's definition for certificateless key agreement and give more power to the adversary. Our new schemes are secure as long as each party has at least one uncompromised secret. Our first construction is in the random oracle model and gives the adversary slightly more capabilities than our second construction in the standard model. Interestingly, our standard model construction is as efficient as the random oracle model construction.

Jan 1, 20100 citations

A novel certificateless deniable authentication protocol

Chunhua Jin, Chunxiang Xu, Fagen Li +1 more

Deniable authenticate is a different and attractive authenticate mechanism compared with the traditional authentication. It allows the appointed receiver to identify the identity of the sender, but not to prove the source of a given message to a third party even if the appointed receiver is willing to reveal its private key. Certificateless public key cryptography can solve both the public key certificate management problem of public key infrastructure-based cryptography and the key escrow problem of identity-based cryptography. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol. In addition, we prove its security in the random oracle model. Our protocol can be applied in many actual application scenarios, such as electronic voting, electronic tendering, and online shopping.

International Journal of Computers and ApplicationsOct 2, 20158 citations

An Authenticated Certificateless Public Key Encryption Scheme.

Young-Ran Lee, Hyang-Sook Lee

In 2003, Al-Riyami and Paterson[1] proposed the certificateless public key cryptography(CL-PKC) which is intermediate between traditional certificated PKC and identity-based PKC. In this paper, we propose an authenticated certificateless public key encryption scheme. Our result improves their public key encryption scheme in the efficiency. The security of the protocol is based on the hardness of two problems; the computational Diffie-Hellman problem(CDHP) and the bilinear Diffie-Hellman problem(BDHP). We also give a formal security model for both confidentiality and authentication, and then show that our scheme is probably secure in the security model.

Jan 1, 200418 citations

Certificateless Concurrent Signature Scheme

Zhenjie Huang, Xuanzhi Lin, Rufen Huang

Certificateless public key cryptography was introduced to remove the use of certificate to ensure the authentication of the user's public key in the traditional certificate-based public key cryptography and overcome he key escrow problem in the identity-based public key cryptography. Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures. Combining the concept of certificateless cryptography with the concept of concurrent signature, in this paper, we present a notion of certificateless concurrent signature with a formal security model and propose a provably secure scheme assuming the hardness of computational Diffie-Hellman Problem.

International Conference for Young Computer ScientistsNov 1, 20082 citations

Provably Secure Identity-Based Authenticated Key Agreement Protocols in the Standard Model

Sheng Wang

This paper presents an identity-based key agreement protocols that are provably secure without random oracles(namely,in the standard model).It is inspired by a new identity-based encryption scheme first proposed by Gentry.This paper details how this key agreement can be used in either escrowed or escrowless mode.All the proposed protocols are compared performance(with respect to computational and communication efficiencies) to all known protocols that are only proven secure in the random oracle model.

Chinese Journal of ComputersJan 1, 200718 citations

Certificateless Key Agreement Protocol

Yixiang Chen

Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. A new two party certificateless key agreement protocol (CL-KA) is proposed and we proved it secure in the random oracle model (ROM). Our protocol only requires each entity to compute one pairing, up to now, it turns out to be the most efficient one of all the previously known CL-KA schemes.

International Conference on E-Business and Information System Security (EBISS)May 1, 20101 citation