MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Security proof of Sakai-Kasahara’s identity-based encryption scheme (2005) [14 citations — 3 self]

Download:
Download as a PDF | Download as a PS
by Liqun Chen, Zhaohui Cheng
In Proceedings of Cryptography and Coding 2005, LNCS 3706
http://eprint.iacr.org/2005/226.ps.gz
Add To MetaCart

Abstract:

Abstract. Identity-based encryption (IBE) is a special asymmetric encryption method where a public encryption key can be an arbitrary identifier and the corresponding private decryption key is created by binding the identifier with a system’s master secret. In 2003 Sakai and Kasahara proposed a new IBE scheme, which has the potential to improve performance. However, to our best knowledge, the security of their scheme has not been properly investigated. This work is intended to build confidence in the security of the Sakai-Kasahara IBE scheme. In this paper, we first present an efficient IBE scheme that employs a simple version of the Sakai-Kasahara scheme and the Fujisaki-Okamoto transformation, which we refer to as SK-IBE. We then prove that SK-IBE has chosen ciphertext security in the random oracle model based on a reasonably well-explored hardness assumption. 1

Citations

974 Random oracles are practical: a paradigm for designing efficient protocols – Bellare, Rogaway - 1993
660 A digital signature scheme secure against adaptive chosen-message attacks – Goldwasser, Micali, et al. - 1988
375 Identity-based cryptosystems and signature schemes – Shamir - 1984
365 The Arithmetic of Elliptic Curves – Silverman - 1986
327 Short signatures from the Weil pairing – Boneh, Lynn, et al. - 2001
263 The exact security of digital signatures: How to sign with RSA and Rabin – Bellare, Rogaway - 1996
136 Identity based encryption from the Weil pairing – Boneh, Franklin - 2001
136 Secure integration of asymmetric and symmetric encryption schemes – Fujisaki, Okamoto - 1999
118 Short Signatures without Random Oracles – Boneh, Boyen - 2004
109 Cryptosystems based on pairing – Sakai, Ohgishi, et al. - 2000
91 An Identity-Based Signature from Gap Diffie-Hellman Groups – Cha, Cheon - 2003
91 Efficient identity based signature schemes based on pairings – Hess - 2002
88 A forward-secure public-key encryption scheme – Canetti, Halevi, et al. - 2003
86 Efficient identity-based encryption without random oracles – Waters - 2005
81 Chosen-ciphertext security from identity-based encryption – Canetti, Halevi, et al. - 2004
62 An identity based authenticated key agreement protocol based on the Weil pairing – Smart - 2002
49 How to Enhance the Security of Public-Key Encryption at Minimum Cost – Fujisaki, Okamoto - 1999
40 A new traitor tracing – Mitsunari, Sakai, et al. - 2002
39 Information technology - Security techniques - Digital signature scheme giving message recovery, Part 2 : Mechanisms using a hash-function – ISOIEC - 1991
39 Efficient selective-id secure identity-based encryption without random oracles – Boneh, Boyen - 2004
38 A new two-party identity-based authenticated key agreement – McCullagh, Barreto - 2005
34 An efficient signature scheme from bilinear pairings and its applications – Zhang, Safavi-Naini, et al. - 2004
28 Multipurpose identity-based signcryption: A swiss army knife for identity-based cryptography – Boyen - 2003
27 Efficient selective-ID secure identity-based encryption without random oracles – Boneh, Boyen - 2004
26 ID based cryptosystems with pairing on elliptic curve. Cryptology ePrint Archive, Report 2003/054 – Sakai, Kasahara - 2003
25 Compressed pairings – Scott, Barreto - 2004
18 Information technology - Security techniques - Key management - Part 3: Mechanisms using asymmetric techniques – ISOIEC - 1999
17 An efficient signature scheme from bilinear pairings and its applications – Zhang, Safavi-Naini, et al. - 2004
15 Cryptosystems Based on Pairing over Elliptic Curve – Sakai, Kasahara - 2001
14 Computing the Tate pairing – Scott - 2005
11 On the indistinguishability-based security model of key agreement protocols-simple cases – Cheng, Nistazakis, et al. - 2004
10 An Identity-Based Encryption Scheme Based on Quadratic Residues – Cocks - 2001
10 On computable isomorphisms in efficient pairing based systems. Cryptology ePrint Archive, Report 2005/116 – Smart, Vercauteren - 2005
8 On security proof of McCullagh-Barreto’s key agreement protocol and its variants. Cryptology ePrint Archive, Report 2005/201 – Cheng, Chen - 2005
8 Boneh-Franklin identity based encryption revisited – Galindo - 2005
7 New traitor tracing schemes using bilinear map – T, Safavi-Naini, et al. - 2003
5 Secure identity-based encryption without random oracles – Boneh, Boyen - 2004
5 Improved identity-based signcryption – Chen, Malone-Lee - 2005
5 Efficient and forward-secure identity-based signcryption. Available on Cryptology ePrint Archive, Report 2004/117 – McCullagh, Barreto - 2004
4 Tight reductions among strong diffie-hellman assumptions. Cryptology ePrint Archive, Report 2005/057 – Wei - 2005
3 Identity-based authenticated key agreement from pairings – Chen, Kudla - 2003
2 Security Notions for Identity Based Encryption – Galindo, Hasuo - 2005
1 See also Cryptology ePrint Archive, Report 2002/184 – Chen, Malone-Lee - 2003
1 Cryptosystems based on pairing. The 2000 Symposium on Cryptography and Information Security – Sakai, Ohgishi, et al.