IACR Cryptology ePrint Archive · 2004 · 18 citations · 6 references
ComputingComputer ScienceAuthenticationCryptographySecurity ProtocolsAuthentication ProtocolsCryptographic AlgorithmsCryptographic ComplexityCryptographic ProtocolsPublic Key AuthenticationPublic-key CryptographyAuthenticated Diffie-hellmanAuthenticated Diffie-hellman ProtocolsCertificateless CryptographyDiffie-hellman ProtocolsFormal Methods For SecurityFormal Security AnalysisFormal Security VerificationPublic-key Encryption
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.
6
Identity-Based Encryption from the Weil Pairing
Dan Boneh, Matthew Franklin · SIAM Journal on Computing · 2003 · 3.6K citations
ID-based signatures from pairingson elliptic curves
Kenneth G. Paterson · Electronics Letters · 2002 · 366 citations
Identity based authenticated key agreement protocols from pairings
Liqun Chen, Caroline Kudla · 2004 · 291 citations
Authenticated Identity-Based Encryption.
Ben Lynn · IACR Cryptology ePrint Archive · 2002 · 74 citations