Improved certificate-based encryption in the standard model

Galindo, David; Morillo, Paz; Rífols, Carla

doi:10.1016/j.jss.2007.09.009

Cited by 51 publications

(34 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In 2006, Morillo and others proposed the first CBE scheme without random oracles [30]. After that, Liu and Zhou proposed an efficient CBE scheme in the standard model [31], which Galindo and others improved in [32]. In parallel with CB-PKC, Al-riyami and Paterson introduced the concept of CL-PKC, and proposed the first concrete scheme in 2003 [2].…”

Section: Related Workmentioning

confidence: 99%

Certificate-Based Signcryption Scheme without Pairing: Directly Verifying Signcrypted Messages Using a Public Key

Le¹,

Hwang²

2016

ETRI J

View full text Add to dashboard Cite

To achieve confidentiality, integrity, authentication, and non-repudiation simultaneously, the concept of signcryption was introduced by combining encryption and a signature in a single scheme. Certificate-based encryption schemes are designed to resolve the key escrow problem of identity-based encryption, as well as to simplify the certificate management problem in traditional public key cryptosystems. In this paper, we propose a new certificate-based signcryption scheme that has been proved to be secure against adaptive chosen ciphertext attacks and existentially unforgeable against chosen-message attacks in the random oracle model. Our scheme is not based on pairing and thus is efficient and practical. Furthermore, it allows a signcrypted message to be immediately verified by the public key of the sender. This means that verification and decryption of the signcrypted message are decoupled. To the best of our knowledge, this is the first signcryption scheme without pairing to have this feature.Keywords: Signcryption, certificate-based signcryption, certificate-based public key cryptography. Manuscript received Nov. 15, 2015; revised Mar. 3, 2016, accepted Apr. 19, 2016 I. IntroductionAuthentication is a fundamental block of a secure system. Basically, it is a process for verifying that the identity of an entity belongs to a human or a device. For example, in the authentication process, a certificate in traditional public key cryptography (PKC) is usually used to prove that a public key belongs to a specific user. However, a public key infrastructure (PKI) that supports a traditional PKC has issues, such as complex installation and maintenance processes, issuance, distribution, and a revocation of the certificates.Although the authentication process seems to be irreplaceable, some public key cryptography models have been proposed in which the certificate is eliminated. In 1984, Shamir proposed the first concept of identity-based public key cryptography (ID-PKC) [1]. This scheme shows a great improvement, that is, it does not require PKI because the public key is an identity (for example, email, ID number, driver license number, and so on). In ID-PKC, a private key generator (PKG) uses a master secret key to generate all private keys for its users. The PKG requires secure channels to deliver the private keys to users securely. Although the improvement in ID-PKC is significant, some architectural issues still remain: (1) A secure channel to deliver the private keys is significantly costly to implement. (2) The PKG can impersonate any user at any time because it knows the private keys of all users, which is called the key escrow problem. This issue is unacceptable in certain cases such as legal applications because the PKG cannot guarantee non-repudiation. (3) Finally, the security of the whole system depends on the secrecy of the master secret key. If the PKG is compromised and the master key is revealed, the whole system is affected.To overcome the drawbacks of the traditional PKC and ID-PKC, the first concept ...

show abstract

Section: Related Workmentioning

confidence: 99%

Certificate-Based Signcryption Scheme without Pairing: Directly Verifying Signcrypted Messages Using a Public Key

Le¹,

Hwang²

2016

ETRI J

View full text Add to dashboard Cite

show abstract

“…When the certificate expires or is revoked, the user is compelled to seek a new one because he can no longer decrypt any ciphertext with it. From its introduction in 2003, CBE has been widely studied by many researchers (Boyen, 2008;Galindo et al, 2008;Shao, 2011;Lu, 2011); its security have been enhanced by solving key escrow issues and have reached a strong security status. However, CBE mainly still relies on centralized CAs that have a master secret key capable of signing the issued certificates and constitute a single point of failure.…”

Section: State Of the Artmentioning

confidence: 99%

A Distributed Approach of a Threshold Certificate-Based Encryption Scheme with No Trusted Entities

Fournaris

2013

Information Security Journal: A Global Perspective

View full text Add to dashboard Cite

The distributed paradigm as manifested in distributed networks, calls for a different way from the traditional client-server model for providing Trusted third party (TTP) services to strengthen security. Certificate Authorities (CAs) are among the most common such TTP. Generating certified keys and manage certification information (the basic functionality of a CA) in a fully distributed manner is a key challenge in the distributed IT environment. Current approaches are based on the use of trusted entities within the distributed system that constitute single points of failure and follow complex certificate management and revocation mechanisms capable of hindering their adoption in a large scale. The hardware resources cost of each distributed system member committed to realizing and maintaining such certificate authority system can be high. Furthermore, distributed CA approaches lack flexibility when it come to dynamic member behavior such as dynamic member joining or leaving the system, since they employ complex, computational intensive mechanisms for retaining the CA consistency during such activity. In this paper, we propose the combination of a distributed key generation threshold cryptography scheme along with an efficient secure certificate-based encryption scheme to provide a solution that matches the above problems. The outcome of this proposal is a distributed Threshold Certificate-Based Encryption Scheme that has no need for any centralized trusted entity to create, and split secrets or distribute keys-certificates at any point during its operating cycle. The proposed scheme has few requirements concerning certificate management due to its inherited Certificate-based Encryption features which enables the scheme's participants to use their certificates as keys and has an easy participant addition-removal mechanism to support dynamic network environments. Extending the work done in (Fournaris, 2012), in this paper the proposed distributed Certificate Authority and encryption/decryption scheme is described and analyzed, participant addition and removal mechanisms as detailed and the scheme's security and performance is discussed. Performance characterization reveals that our scheme is very efficient in terms of computational intensive and resource constraining operations like Elliptic Curve point multiplication and bi-linear pairing.

show abstract

“…In 2006, Morillo and Ràfols (2006) proposed the first CBE scheme in the standard model from the Waters-IBE scheme (Waters, 2005) and the BB-IBE scheme (Boneh and Boyen, 2004). In 2008, Galindo et al (2008) revised the CBE scheme in Morillo and Ràfols (2006) and proposed an improved scheme. Liu and Zhou (2008) also proposed another CBE scheme in the standard model from the Gentry-IBE scheme (Gentry, 2006).…”

Section: Related Workmentioning

confidence: 99%

Further observations on certificate-base encryption and its generic construction from certificateless public key encryption

Lu¹

2011

Sci. Res. Essays

View full text Add to dashboard Cite

Certificate-based encryption (CBE) is a new asymmetric encryption paradigm which was introduced to solve the certificate management problem in traditional public key encryption (PKE). It combines PKE and identity-based encryption (IBE) while preserving some of their most attractive features. CBE provides an efficient implicit certificate mechanism which eliminates the third-party queries and simplifies the certificate revocation problem in the traditional public key infrastructure (PKI). It also solves the key escrow problem and key distribution problem inherent in IBE. In this paper, we introduce the key replacement attack and the malicious-but-passive certifier attack into CBE, and define a class of new security models for CBE under different security levels according to the power of the adversaries against CBE. Our new security models are more elaborated and stronger compared with other existing ones. Then, we propose a generic construction of CBE from certificateless public key encryption and prove its security under the proposed security models in the standard model. We also show a concrete conversion using the proposed generic construction.

show abstract

Improved certificate-based encryption in the standard model

Cited by 51 publications

References 21 publications

Certificate-Based Signcryption Scheme without Pairing: Directly Verifying Signcrypted Messages Using a Public Key

Certificate-Based Signcryption Scheme without Pairing: Directly Verifying Signcrypted Messages Using a Public Key

A Distributed Approach of a Threshold Certificate-Based Encryption Scheme with No Trusted Entities

Further observations on certificate-base encryption and its generic construction from certificateless public key encryption

Contact Info

Product

Resources

About