Identity-Based Encryption on RSA Without Pairings and Key Escrow

ZHU Yan; WANG Shanbiao; MA Di; FENG Rongquan

Article Contents

Article Navigation > Chinese Journal of Electronics > 2014 > 23(4): 842-850

ZHU Yan, WANG Shanbiao, MA Di, et al., “Identity-Based Encryption on RSA Without Pairings and Key Escrow,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 842-850, 2014,

Citation:

ZHU Yan, WANG Shanbiao, MA Di, et al., “Identity-Based Encryption on RSA Without Pairings and Key Escrow,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 842-850, 2014,

ZHU Yan, WANG Shanbiao, MA Di, et al., “Identity-Based Encryption on RSA Without Pairings and Key Escrow,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 842-850, 2014,

Citation:

ZHU Yan, WANG Shanbiao, MA Di, et al., “Identity-Based Encryption on RSA Without Pairings and Key Escrow,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 842-850, 2014,

PDF( 383 KB)

Identity-Based Encryption on RSA Without Pairings and Key Escrow

1.
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China;
2.
School of Mathematical Sciences, Peking University, Beijing 100871, China;
3.
Department of Computer and Information Science, University of Michigan-Dearborn, Michigan 48128, USA

Funds: This work is supported by the National Natural Science Foundation of China (No.61170264, No.61370187) and the National Basic Research Program of China (973 Program) (No.2013CB329606).

Received Date: 2013-09-01
Rev Recd Date: 2013-11-01
Publish Date: 2014-10-05

Abstract

Abstract

We propose a new construction of identity-based encryption without key escrow over the tradition RSA cryptosystems. The security of our scheme follows from the decisional Diffie-Hellman assumption and the difficulty of Modular inversion hidden number problem with error (MIHNPwE), which can be seen as a generalization of the modular inversion hidden number problem. We give an analysis on the hardness of MIHNPwE by lattice techniques. In our construction, we generate each user's partial private key in the form of an MIHNPwE instance. The hardness of MIHNPwE provides our scheme with resistance against key-collusion attacks from any number of traitors. Our prototype implementation of the proposed scheme shows that it can be more computation efficient and easy-to-implementation than the influential pairing-friendly elliptic-curve based IBE scheme.
- Identity-based encryption,
- Key escrow,
- Hidden number problem with error

FullText(HTML)

References(19)

References

A. Shamir, Identity-based cryptosystems and signature schemes, Advances in Cryptology, Springer Berlin Heidelberg, pp.47-53, 1985.

Y. Zhu, G.-J. Ahn, H. Hu, et al., Dynamic audit services for outsourced storages in clouds, IEEE Transactions on Services Computing. Vol.6, No.2, pp.227-238, 2013.

D. Su, K. Lv, A new hard-core predicate of paillier's trapdoor function, Advances in Cryptology-INDOCRYPT2009, pp.263-271, 2009.

N. Li, W. Du, and D. Boneh. Oblivious signature-based envelope, Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC, pp.182-189, 2003.

Y. Zhu, M. Yu, H. Hu, et al., Efficient construction of provably secure steganography under ordinary covert channels. Science China Information Science, Vol.55, No.7, pp.1639-1649, 2012.

H. Hong, L. Hu, D. Feng, On a class of pseudorandom sequences from elliptic curves over finite fields, IEEE Transactions on Information Theory. Vol.53, No.7, pp.2598-2605, 2007.

H. Hong, D. Feng, On quadratic bent functions in polynomial forms, IEEE Transactions on Information Theory, Vol.53, No.7, pp.2610-2615, 2007.

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

G.D. Crescenzo, V. Saraswat. Public key encryption with searchable keywords based on jacobi symbols, Progress in Cryptology, INDOCRYPT, pp.282-296, 2007.

D. Boneh and M.K. Franklin. Identity-based encryption from the weil pairing, SIAM Journal on Computing, Vol.32, No.3, pp.586-615, 2003.

D. Su, K. Lv, Paillier's trapdoor function hides Θ(n) bits. Science China: Information Sciences. Vol.54, No.9, pp.1827-1836, 2011.

Y. Zhu, G.-J. Ahn, H. Hu, et al., Role-based cryptosystem: A new cryptographic RBAC system based on role-key hierarchy, IEEE Transactions on Information Forensics and Security. Vol.8, No.12, pp.2138-2153, 2013.

H. Hu, G. Gong, New sets of zero or low correlation zone sequences via interleaving techniques, IEEE Transactions on Information Theory. Vol.56, No.4, pp.1702-1713, 2010.

G. Gong, T. Helleseth, H. Hu, A three-valued walsh transform from decimations of helleseth-gong sequences, IEEE Transactions on Information Theory. Vol.58, No.2, 1158-1162, 2012.

D. Boneh, S. Halevi, N. Howgrave-Graham. The modular inversion hidden number problem, Advances in Cryptology, ASIACRYPT, pp.36-51, 2001.

R. Canetti, S. Halevi, J. Katz. A forward-secure public-key encryption scheme, Advances in Cryptology, EUROCRYPT, pp.255-271, 2003.

G. Gong, T. Helleseth, H. Hu, et al., On the dual of certain ternary weakly regular bent functions, IEEE Transactions on Information Theory. Vol.58, No.4, 2237-2243, 2012.

A.K. Lenstra, H.W. jun. Lenstra, Lászlo Lovász. Factoring polynomials with rational coefficients, Math. Ann., Vol.261, pp.515-534, 1982.

D. Coppersmith. Small solutions to polynomial equations, and low exponent rsa vulnerabilities, J. Cryptology, Vol.10, No.4, pp.233-260, 1997.

Relative Articles

Supplements(0)

Cited By

Proportional views