More Web Proxy on the site http://driver.im/

research-article

A strong provably secure IBE scheme without bilinear map

Authors:

Huihua ZhouAuthors Info & Claims

Journal of Computer and System Sciences, Volume 81, Issue 1

Pages 125 - 131

https://doi.org/10.1016/j.jcss.2014.06.020

Published: 01 October 2014 Publication History

Abstract

Identity-based encryption (IBE) allows one party to send ciphered messages to another using an arbitrary identity string as an encryption key. Since IBE does not require prior generation and distribution of keys, it greatly simplifies key management in public-key cryptography. According to the Menezes-Okamoto-Vanstone (MOV) reduction theory, the IBE scheme based on bilinear map loses the high efficiency of elliptic curve because of the requirement of large security parameters. Therefore, it is important to build a provably secure IBE scheme without bilinear map. To this end, this paper proposes an improved IBE scheme that is different from the previous schemes because this new scheme does not use symmetric encryption algorithm. Furthermore, it can be proven to be secure against adaptively chosen identity and chosen plaintext attacks in the standard model. Elaborated security and performance analysis demonstrate that this new scheme outperforms the previous ones in terms of the time complexity for encryption and decryption. A one-way hash function is used to replace the symmetric-encryption in our protocol.Our protocol is proven to be secure against adaptively chosen identity attack.Our protocol is proven to be secure against chosen plaintext attacks.New scheme is efficient in terms of the time complexity for encryption/ecryption.

References

[1]

A. Shamir, Identity-Based Cryptosystems and Signature Schemes, Springer-Verlag, 1985.

[2]

D. Boneh, M. Franklin, Identity-Based Encryption From the Weil Pairing, Springer-Verlag, 2001.

[3]

J. Katz, C. Koo, On expected constant-round protocols for Byzantine agreement, J. Comput. Syst. Sci., 75 (2009) 91-112.

Digital Library

[4]

D. Boneh, X. Boyen, Efficient Selective-ID Identity Based Encryption Without Random Oracles, Springer-Verlag, 2004.

[5]

D. Boneh, X. Boyen, Secure Identity Based Encryption Without Random Oracles, Springer-Verlag, 2004.

[6]

B. Waters, Efficient Identity-Based Encryption Without Random Oracles, Springer-Verlag, 2005.

[7]

K. Mathew, S. Vasant, S. Venkatesan, C. Rangan, An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model, Springer-Verlag, 2012.

[8]

J. Seo, J. Cheon, Fully secure anonymous hierarchical identity-based encryption with constant size ciphertexts. http://eprint.iacr.org/

[9]

J. Seo, T. Kobayashi, M. Ohkubo, K. Suzuki, Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts, Springer-Verlag, 2009.

[10]

L. Zhang, Y. Hu, Q. Wu, Unbounded hierarchical identity-based encryption in the standard model, Inf. J., 15 (2012) 105-112.

[11]

L. Zhang, Y. Hu, Q. Wu, New constructions of identity-based broadcast encryption without random oracles, KSII Trans. Internet Inform. Syst., 5 (2011) 247-476.

[12]

C. Cocks, An identity-based encryption scheme based on quadratic residues, in: Proceedings of the 8th IMA International Conference on Cryptography and Coding, 2001, pp. 360-363.

Digital Library

[13]

D. Boneh, C. Gentry, M. Hamburg, Space-efficient identity based encryption without pairings, in: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 647-657.

[14]

P. Xu, G. Cui, F. Lei, An efficient and provably secure IBE scheme without bilinear map, J. Comput. Res. Dev., 45 (2008) 1687-1695.

[15]

P. Xu, G. Cui, C. Fu, X. Tang, A more efficient accountable authority IBE scheme under the DL assumption, Sci. China, 53 (2010) 581-592.

[16]

A. Benasser, A. Samsudin, A new identity based encryption (IBE) scheme using extended Chebyshev polynomial over finite fields Z, Phys. Lett. A, 374 (2010) 4670-4674.

[17]

X. Yang, L. Wu, M. Zhang, P. Wei, L. Wei, An ideal lattice based IBE scheme in the standard model, Wuhan Univ. J. Nat. Sci., 16 (2011) 439-446.

[18]

S. Luo, Q. Shen, Y. Jin, Y. Chen, A Variant of Boyen-Waters Anonymous IBE Scheme, Springer-Verlag, 2011.

[19]

J. Katz, P. MacKenzie, G. Taban, V. Gligor, Two-server password-only authenticated key exchange, J. Comput. Syst. Sci., 78 (2012) 651-669.

Digital Library

[20]

N. Attrapadung, J. Furukawa, T. Gomi, Efficient Identity-Based Encryption with Tight Security Reduction, Springer-Verlag, 2006.

[21]

A. Menezes, T. Okamoto, S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Trans. Inf. Theory, 39 (1993) 1639-1646.

Digital Library

[22]

S. Islam, G. Biswas, An improved ID-based client authentication with key agreement scheme on ECC for mobile client-server environments, Theor. Appl. Inform., 24 (2012) 293-312.

[23]

P. Barreto, H. Kim, B. Lynn, M. Scott, Efficient Algorithms for Pairing-Based Cryptosystems, Springer-Verlag, 2002.

Cited By

Sammy FVigila S(2022)An Efficient Blockchain Based Data Access with Modified Hierarchical Attribute Access Structure with CP-ABE Using ECC Scheme for Patient Health RecordSecurity and Communication Networks10.1155/2022/86852732022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/8685273
Karati ABiswas G(2019)Provably secure and authenticated data sharing protocol for IoT‐based crowdsensing networkTransactions on Emerging Telecommunications Technologies10.1002/ett.331530:4Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.1002/ett.3315
Li LLee J(2016)On the security of a strong provably secure identity-based encryption scheme without bilinear pairingInternational Journal of Internet Technology and Secured Transactions10.1504/IJITST.2016.0803936:3(178-185)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1504/IJITST.2016.080393
Show More Cited By

A strong provably secure IBE scheme without bilinear map

Recommendations

On the security of a strong provably secure identity-based encryption scheme without bilinear pairing

The identity-based encryption scheme enables a sender to generate the ciphertext using a receiver's identity and system's parameters. Because of its convenience, the identity-based encryption scheme has been widely used in many practical applications. ...
A Provably Secure Proxy Signature Scheme in Certificateless Cryptography

A proxy signature scheme enables an original signer to delegate its signing capability to a proxy signer and then the proxy signer can sign a message on behalf of the original signer. Recently, in order to eliminate the use of certificates in certified ...
A Secure Anonymous Proxy Multi-signature Scheme
ICETE 2014: Proceedings of the 11th International Joint Conference on e-Business and Telecommunications - Volume 4

A proxy signature scheme enables a signer to delegate its signing rights to any other user, called the proxy signer, to produce a signature on its behalf. In a proxy multi-signature scheme, the proxy signer can produce one single signature on behalf of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences

Journal of Computer and System Sciences Volume 81, Issue 1

February, 2015

357 pages

ISSN:0022-0000

Issue’s Table of Contents

Copyright © Elsevier Inc.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 October 2014

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sammy FVigila S(2022)An Efficient Blockchain Based Data Access with Modified Hierarchical Attribute Access Structure with CP-ABE Using ECC Scheme for Patient Health RecordSecurity and Communication Networks10.1155/2022/86852732022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/8685273
Karati ABiswas G(2019)Provably secure and authenticated data sharing protocol for IoT‐based crowdsensing networkTransactions on Emerging Telecommunications Technologies10.1002/ett.331530:4Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.1002/ett.3315
Li LLee J(2016)On the security of a strong provably secure identity-based encryption scheme without bilinear pairingInternational Journal of Internet Technology and Secured Transactions10.1504/IJITST.2016.0803936:3(178-185)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1504/IJITST.2016.080393
Vergnaud D(2016)Comment on "A strong provably secure IBE scheme without bilinear map" by M. Zheng, Y. Xiang and H. Zhou J. Comput. Syst. Sci. 81 (2015) 125-131Journal of Computer and System Sciences10.1016/j.jcss.2015.12.00382:5(756-757)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1016/j.jcss.2015.12.003
Karati ABiswas G(2016)Efficient and provably secure random oracle-free adaptive identity-based encryption with short-signature schemeSecurity and Communication Networks10.1002/sec.15889:17(4060-4074)Online publication date: 25-Nov-2016
https://dl.acm.org/doi/10.1002/sec.1588
Odelu VDas A(2016)Design of a new CP-ABE with constant-size secret keys for lightweight devices using elliptic curve cryptographySecurity and Communication Networks10.1002/sec.15879:17(4048-4059)Online publication date: 25-Nov-2016
https://dl.acm.org/doi/10.1002/sec.1587

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents