Fuyang Fang
ABSTRACT
In this paper, we propose a hierarchical identity-based encryption (HIBE) scheme in the random oracle (RO) model based on the learning with rounding (LWR) problem over small modulus $q$. Compared with the previous HIBE schemes based on the learning with errors (LWE) problem, the ciphertext expansion ratio of our scheme can be decreased to 1/2. Then, we utilize the HIBE scheme to construct a deterministic hierarchical identity-based encryption (D-HIBE) scheme based on the LWR problem over small modulus. Finally, with the technique of binary tree encryption (BTE) we can construct HIBE and D-HIBE schemes in the standard model based on the LWR problem over small modulus.
- S. Agrawal, D. Boneh, and X. Boyen. Efficient lattice (H) IBE in the standard model. In Advances in Cryptology--EUROCRYPT 2010, pages 553--572. Springer, 2010. Google Scholar
Digital Library
- S. Agrawal, D. Boneh, and X. Boyen. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Advances in Cryptology--CRYPTO 2010, pages 98--115. Springer, 2010. Google ScholarDigital Library
- J. Alwen, S. Krenn, K. Pietrzak, and D. Wichs. Learning with rounding, revisited. In Advances in Cryptology--CRYPTO 2013, pages 57--74. Springer, 2013.Google ScholarCross Ref
- A. Banerjee, C. Peikert, and A. Rosen. Pseudorandom functions and lattices. In Advances in Cryptology - EUROCRYPT 2012, pages 719--737. Springer, 2012. Google ScholarDigital Library
- M. Bellare, E. Kiltz, C. Peikert, and B. Waters. Identity-based (lossy) trapdoor functions and applications. In Advances in Cryptology - EUROCRYPT 2012, pages 228--245. Springer, 2012. Google ScholarDigital Library
- A. Bogdanov, S. Guo, D. Masny, S. Richelson, and A. Rosen. On the hardness of learning with rounding over small modulus. In Theory of Cryptography, pages 209--224. Springer, 2016.Google ScholarDigital Library
- D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert. Bonsai trees, or how to delegate a lattice basis. Journal of cryptology, 25(4):601--639, 2012. Google ScholarDigital Library
- A. Escala, J. Herranz, B. Libert, and C. Ràfols. Identity-based lossy trapdoor functions: new definitions, hierarchical extensions, and implications. In Public-Key Cryptography--PKC 2014, pages 239--256. Springer, 2014.Google ScholarDigital Library
- C. Gentry and A. Silverberg. Hierarchical ID-based cryptography. In Advances in cryptology - ASIACRYPT 2002, pages 548--566. Springer, 2002. Google ScholarDigital Library
- J. Horwitz and B. Lynn. Toward hierarchical identity-based encryption. In Advances in Cryptology - EUROCRYPT 2002, pages 466--481. Springer, 2002. Google ScholarCross Ref
- D. Micciancio and C. Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In Advances in Cryptology--EUROCRYPT 2012, pages 700--718. Springer, 2012. Google ScholarDigital Library
- C. Peikert and B. Waters. Lossy Trapdoor Functions and their Applications. In STOC, pages 187--196, 2008. Google ScholarDigital Library
- O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 84--93. ACM, 2005. Google ScholarDigital Library
- X. Xie, R. Xue, and R. Zhang. Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting. In Security and Cryptography for Networks, pages 1--18. Springer, 2012. Google ScholarDigital Library
Index Terms
- (Deterministic) Hierarchical Identity-based Encryption from Learning with Rounding over Small Modulus
Recommendations
Revocable hierarchical identity-based encryption via history-free approach
In the context of Identity-Based Encryption (IBE), both revocation and delegation of key generation are important functionalities. Although a number of IBE schemes with either efficient revocation or efficient delegation of key generation functionality ...
Identity-based signcryption from lattices
Signcryption as a cryptographic primitive can carry out signature and encryption simultaneously at a remarkably reduced cost. Identity-based cryptography is more convenient than public key infrastructure-based cryptography in certificate management. As ...
Revocable hierarchical identity-based encryption
In practice, revocation functionality is indispensable to the public key cryptosystems since there are threats of leaking a secret key by hacking or legal situation of expiration of contract for using system. In the public key infrastructure setting, ...
Comments