Efficient identity-based encryption without pairings and key escrow for mobile devices

Authors:
Yan Zhu;Di Ma;Shanbiao Wang;Rongquan Feng
Affiliations:
School of Computer and Communication Engineering, University of Science and Technology Beijing, China;Department of Computer and Information Science, University of Michigan-Dearborn;School of Mathematical Sciences, Peking University, Beijing, China;School of Mathematical Sciences, Peking University, Beijing, China
Venue:
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Year:
2013

Citing 15
Cited 0

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Secure Integration of Asymmetric and Symmetric Encryption Schemes

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The Modular Inversion Hidden Number Problem

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Hierarchical ID-Based Cryptography

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Applications of Multiple Trust Authorities in Pairing Based Cryptosystems

InfraSec '02 Proceedings of the International Conference on Infrastructure Security
An Identity Based Encryption Scheme Based on Quadratic Residues

Proceedings of the 8th IMA International Conference on Cryptography and Coding
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Space-Efficient Identity Based EncryptionWithout Pairings

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Universally Anonymous IBE Based on the Quadratic Residuosity Assumption

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A forward-secure public-key encryption scheme

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Public key encryption with searchable keywords based on Jacobi symbols

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
The geometry of lattice cryptography

Foundations of security analysis and design VI
Bonsai trees, or how to delegate a lattice basis

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new construction of identity-based encryption without key escrow over the tradition cryptosystems. The security of our scheme follows from the decisional Diffie-Hellman assumption and the difficulty of a new problem --- modular inversion hidden number problem with error (MIHNPwE). The latter 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.