No Access

Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting

Juyan Li

http://orcid.org/0000-0003-2721-2655

College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, P. R. China

College of Data Science and Technology, Heilongjiang University, Harbin 150080, P. R. China

E-mail Address: lijuyan587@163.com

Corresponding author.

Search for more papers by this author

Chunguang Ma

College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, P. R. China

State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, P. R. China

E-mail Address: machunguang@hrbeu.edu.cn

Search for more papers by this author

, and

Zhen Gu

College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, P. R. China

E-mail Address: guzhen@hrbeu.edu.cn

Search for more papers by this author

https://doi.org/10.1142/S0129054120500252Cited by:5 (Source: Crossref)

Abstract

Proxy Re-Encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice’s ciphertext into a Bob’s ciphertext on the same plaintext. All of the PRE schemes are public key encryption and semantic security. Deterministic Public Key Encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios where the latter exhibits inherent drawbacks. In this paper, we construct the first multi-use unidirectional D-PRE scheme from Lattices in the auxiliary-input setting. We also prove that it is PRIV1-INDr secure in the standard model based on the LWR. Finally, an identity-based D-PRE is obtained from the basic construction.

Communicated by Huaxiong Wang

Keywords:

References

1. M. Blaze, G. Bleumer and M. Strauss , Divertible protocols and atomic proxy cryptography, in Proc. Int. Conf. Theory and Applications of Cryptographic Techniques (Espoo, Finland, 1998), pp. 127–144. Crossref, Google Scholar
2. G. Ateniese et al., Improved proxy re-encryption schemes with applications to secure distributed storage, ACM Trans. Inform. Syst. Sec. (TISSEC) 9(1) (2006) 1–30. Crossref, Google Scholar
3. E. Kirshanova , Proxy re-encryption from lattices, in Proc. Int. Workshop on Public Key Cryptography (Buenos Aires, Argentina, 2014), pp. 77–94. Crossref, Google Scholar
4. K. Singh, C. P. Rangan and A. K. Banerjee , Cryptanalysis of unidirectional proxy re-encryption scheme, in Proc. Information and Communication Technology-EurAsia Conference (Bali, Indonesia, 2014), pp. 564–575. Crossref, Google Scholar
5. R. Nishimaki and K. Xagawa , Key-private proxy re-encryption from lattices, revisited, IEICE Trans. Fund. Electron. Commun. Comput. Sci. 98(1) (2015) 100–116. Crossref, Web of Science, Google Scholar
6. G. Ateniese, K. Benson and S. Hohenberger , Key-private proxy re-encryption, in Proc. Cryptographers’ Track at the RSA Conference (San Francisco, CA, USA, 2009), pp. 279–294. Crossref, Google Scholar
7. M. M. Jiang et al., Lattice-based multi-use unidirectional proxy re-encryption, Security and Communication Networks 8(18) (2015) 3796–3803. Crossref, Web of Science, Google Scholar
8. X. A. Wang, X. Huang, X. Yang et al., Further observation on proxy re-encryption with keyword search, J. Syst. Softw. 85(3) (2012) 643–654. Crossref, Web of Science, Google Scholar
9. Y. Zhou et al., Identity-based proxy re-encryption version 2: Making mobile access easy in cloud, Future Generation Computer Systems 62 (2016) 128–139. Crossref, Web of Science, Google Scholar
10. K. Liang et al., A secure and efficient ciphertext-policy attribute-based proxy re-encryption for cloud data sharing, Future Generation Computer Systems 52 (2015) 95–108. Crossref, Web of Science, Google Scholar
11. Y. Lu and J. Li , A pairing-free certificate-based proxy re-encryption scheme for secure data sharing in public clouds, Future Generation Computer Systems 62 (2016) 140–147. Crossref, Web of Science, Google Scholar
12. J. Shao and Z. Cao , Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption, Inform. Sci. 206 (2012) 83–95. Crossref, Web of Science, Google Scholar
13. M. Green and G. Ateniese , Identity-based proxy re-encryption, in Proc. Applied Cryptography and Network Security (Zhuhai, China, 2007), pp. 288–306. Crossref, Google Scholar
14. O. Regev , On lattices, learning with errors, random linear codes, and cryptography. in Proc. 37th Annual ACM Symposium on Theory of Computing (ACM, 2005), pp. 84–93. Crossref, Google Scholar
15. K. Xagawa , Cryptography with Lattices (Tokyo Institute of Technology, Tokyo, 2010). Google Scholar
16. Y. Aono, X. Boyen and L. Wang , Key-private proxy re-encryption under LWE, in Proc. Int. Conf. Cryptology in India (Mumbai, India, 2013), pp. 1–18. Crossref, Google Scholar
17. J. Li, C. Ma and K. Zhang , A novel lattice-based CP-ABPRE scheme for cloud sharing, Symmetry 11(10)(2019) 1262. Crossref, Web of Science, Google Scholar
18. J. Li, C. Ma, L. Zhang and Q. Yuan , Unidirectional FHPRE scheme from lattice for cloud computing, Int. J. Netw. Sec. 21(4) (2019) 592–600. Google Scholar
19. C. Ma, J. Li and W. Ouyang , Lattice-based identity-based homomorphic conditional proxy re-encryption for secure big data computing in cloud environment, Int. J. Found. Comput. Sci. 28(6) (2017) 645–660. Link, Web of Science, Google Scholar
20. C. Ma, J. Li and W. Ouyang , A homomorphic proxy re-encryption from lattices, in Proc. Int. Conf. Provable Security (Springer, Cham, Nanjing, China, 2016), pp. 353–372. Crossref, Google Scholar
21. K. Singh, C. Pandu Rangan and A. K. Banerjee , Lattice based identity based proxy re-encryption scheme, J. Internet Services and Information Security (JISIS) 3(3/4) (2013) 38–51. Google Scholar
22. K. S. Kim and I. R. Jeong , Collusion-resistant unidirectional proxy re-encryption scheme from lattices, J. Commun. Netw. 18(1) (2016) 1–7. Crossref, Web of Science, Google Scholar
23. S. Goldwasser and S. Micali , Probabilistic encryption, J. Comput. Syst. Sci. 28(2) (1984) 270–299. Crossref, Web of Science, Google Scholar
24. M. Abdalla et al., Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions, in Proc. Ann. Int. Cryptology Conference (Santa Barbara, California, USA, 2005), pp. 205–222. Crossref, Google Scholar
25. D. Boneh et al., Public key encryption with keyword search, in Proc. Int. Conf. Theory and Applications of Cryptographic Techniques (Interlaken, Switzerland, 2004), pp. 506–522. Crossref, Google Scholar
26. X. Xie, R. Xue and R. Zhang , Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting, in Proc. Int. Conf. Security and Cryptography for Networks (Amalfi, Italy, 2012), pp. 1–18. Crossref, Google Scholar
27. M. Bellare, A. Boldyreva and A. O’Neill , Deterministic and efficiently searchable encryption, in Proc. Ann. Int. Cryptology Conference (Santa Barbara, CA, USA, 2007), pp. 535–552. Crossref, Google Scholar
28. Z. Brakerski and G. Segev , Better security for deterministic public-key encryption: The auxiliary-input setting, in Proc. Ann. Cryptology Conference (Santa Barbara, CA, USA, 2011), pp. 543–560. Crossref, Google Scholar
29. C. Gentry, S. Halevi and V. Vaikuntanathan , A simple BGN-type cryptosystem from LWE, in Proc. Ann. Int. Conf. Theory and Applications of Cryptographic Techniques (Springer, Berlin, Heidelberg, Riviera, French, 2010), pp. 506–522. Crossref, Google Scholar
30. J. Alwen and C. Peikert , Generating shorter bases for hard random lattices, Theory of Computing Systems 48(3) (2011) 535–553. Crossref, Web of Science, Google Scholar
31. D. Micciancio and C. Peikert , Trapdoors for lattices: Simpler, tighter, faster, smaller, in Proc. Ann. Int. Conf. Theory and Applications of Cryptographic Techniques (Cambridge, UK, 2012), pp. 700–718. Crossref, Google Scholar
32. S. Agrawal, D. Boneh and X. Boyen , Efficient lattice (H) IBE in the standard model, in Proc. Ann. Int. Conf. Theory and Applications of Cryptographic Techniques (French Riviera, 2010), pp. 553–572. Crossref, Google Scholar
33. A. Banerjee, C. Peikert and A. Rosen , Pseudorandom functions and lattices, in Proc. Ann. Int. Conf. Theory and Applications of Cryptographic Techniques (Cambridge, UK, 2012), pp. 719–737. Crossref, Google Scholar
34. C. Gentry, C. Peikert and V. Vaikuntanathan , Trapdoors for hard lattices and new cryptographic constructions, in Proc. 40th Ann. ACM Symposium on Theory of Computing (British Columbia, Canada, 2008), pp. 197–206. Crossref, Google Scholar