Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment

With the arrival of the era of big data, more and more users begin to adopt public cloud storage to store data and compute data. Sharing large amounts of sensitive data in the public cloud will arouse privacy concerns. Data encryption is a widely accepted method to prevent information leakage. How to achieve the cloud sharing and cloud computing of big data is a challenging problem. Conditional proxy re-encryption can solve cloud sharing, and homomorphic encryption can achieve cloud computing. In this paper, we combine conditional proxy re-encryption with homomorphic encryption to construct a lattice-based identity-based homomorphic conditional proxy re-encryption for secure big data computing in cloud environment. The scheme can not only realize the encrypted data sharing in the cloud, but also can realize the encrypted data computing in the cloud. That is, the homomorphic conditional proxy re-encryption scheme can homomorphically evaluate ciphertexts no matter ciphertexts are “fresh” or re-encrypted (re...

[1]  Zvika Brakerski,et al.  Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP , 2012, CRYPTO.

[2]  Robert H. Deng,et al.  Conditional proxy re-encryption secure against chosen-ciphertext attack , 2009, ASIACCS '09.

[3]  Matthew Green,et al.  Improved proxy re-encryption schemes with applications to secure distributed storage , 2006, TSEC.

[4]  Matt Blaze,et al.  Divertible Protocols and Atomic Proxy Cryptography , 1998, EUROCRYPT.

[5]  Chunguang Ma,et al.  A Homomorphic Proxy Re-encryption from Lattices , 2016, ProvSec.

[6]  C. Pandu Rangan,et al.  Lattice Based Identity Based Proxy Re-Encryption Scheme , 2013, J. Internet Serv. Inf. Secur..

[7]  Matthew Green,et al.  Identity-Based Proxy Re-encryption , 2007, ACNS.

[8]  Brent Waters,et al.  Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.

[9]  Jiguo Li,et al.  Provably Secure Certificate-based Conditional Proxy Re-encryption , 2016, J. Inf. Sci. Eng..

[10]  Vinod Vaikuntanathan,et al.  Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Y. P. Hu,et al.  Lattice-based multi-use unidirectional proxy re-encryption , 2015, Secur. Commun. Networks.

[12]  Peng Xu,et al.  Conditional Identity-Based Broadcast Proxy Re-Encryption and Its Application to Cloud Email , 2016, IEEE Transactions on Computers.

[13]  Ryo Nishimaki,et al.  Key-Private Proxy Re-Encryption from Lattices, Revisited , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[14]  Vinod Vaikuntanathan,et al.  Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.

[15]  Wanlei Zhou,et al.  Efficient Fine-Grained Access Control for Secure Personal Health Records in Cloud Computing , 2016, NSS.

[16]  Tatsuaki Okamoto,et al.  Packing Messages and Optimizing Bootstrapping in GSW-FHE , 2015, Public Key Cryptography.

[17]  Xu An Wang,et al.  Unidirectional IBPRE scheme from lattice for cloud computation , 2016, J. Ambient Intell. Humaniz. Comput..

[18]  Keita Xagawa,et al.  Cryptography with Lattices , 2010 .

[19]  Dan Boneh,et al.  Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.

[20]  C. Pandu Rangan,et al.  Cryptanalysis of Unidirectional Proxy Re-Encryption Scheme , 2014, ICT-EurAsia.

[21]  Yun Ling,et al.  Identity-Based Conditional Proxy Re-Encryption , 2011, 2011 IEEE International Conference on Communications (ICC).

[22]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

[23]  David Cash,et al.  Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems , 2009, CRYPTO.

[24]  Jiguo Li,et al.  Certificate-Based Conditional Proxy Re-Encryption , 2015, NSS.

[25]  Xiaojun Zhang,et al.  Efficient fully homomorphic encryption from RLWE with an extension to a threshold encryption scheme , 2014, Future Gener. Comput. Syst..

[26]  Chris Peikert,et al.  Generating Shorter Bases for Hard Random Lattices , 2009, Theory of Computing Systems.

[27]  Jie Cui,et al.  Many-to-one homomorphic encryption scheme , 2016, Secur. Commun. Networks.

[28]  Yang Lu,et al.  A pairing-free certificate-based proxy re-encryption scheme for secure data sharing in public clouds , 2016, Future Gener. Comput. Syst..

[29]  Kim-Kwang Raymond Choo,et al.  Cloud based data sharing with fine-grained proxy re-encryption , 2016, Pervasive Mob. Comput..

[30]  Chris Peikert,et al.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..

[31]  Xavier Boyen,et al.  Key-Private Proxy Re-encryption under LWE , 2013, INDOCRYPT.