An Approach for Privacy Preservation Assisted Secure Cloud Computation

Swathi Velugoti, M. P. Vani

Abstract


As organizations employ technology to change their business operations
into something simpler, quicker, more secure, adaptable, and lucrative, digital transformation is assisting them in doing so. Cloud computing technology is a cornerstone to this transformation. Cloud computing imparts a more affordable, scalable, and location-independent platform for handling client data. Customers may benefit from the advantages of this new paradigm by outsourcing compute and storage requirements to public providers and paying for the services consumed. Cloud computing bestows advantageous on-the-demand oriented network ingress to specific a pool of adjustable computing resources that may be shared and which can be promptly deployed with better minimum management and efficiency oriented overhead. Cloud paradigm provides the prime and fundamental benefit of computation oriented outsourcing, where
due to customers are no longer confined by their resource-constrained devices thanks to the cloud's computing capabilities. Outsourcing allows you to save time and money. With the outsourcing problem to cloud, clients can always get the benefits of limitless computational resources in pay and use manner, free from software and hardware maintenance and operational overhead related concerns. Traditional encryption as a solution protects privacy, but restricts future data usage, reducing the fundamental economic benefits of using public cloud services dramatically. Processing on encrypted data is widely acknowledged research problem in cryptography. We offer a secure system in this study and an oracle for query vectors outsourcing using privacy homomorphism. The empirical analysis for the proposed prototype in terms of computational and security aspects, experiment results discussion is also given in this paper.


Full Text:

PDF

References


R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, pp. 169-180, 1978.

https://doi.org/10.14264/219648

S. Goldwasser, S. Micali, Probabilistic encryption and how to play mental poker keeping secret all partial information. Proc. 14th Symposium on Theory of Computing, pp. 365-377, (1982).

https://doi.org/10.1145/800070.802212

ElGamal T, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory (31), pp. 469-472, 1985.

https://doi.org/10.1007/3-540-39568-7_2

Benaloh, J. Dense Probabilistic Encryption. In: Proceedings of the Workshop on Selected Areas of Cryptography, pp. 120-128 (1994).

https://doi.org/10.1007/978-3-642-21969-6_22

Naccache, David; Stern, Jacques, A New Public Key Cryptosystem Based on Higher Residues. Proceedings of the 5th ACM Conference on Computer and Communications Security. CCS’98 ACM, pp. 59-66,(1998).

https://doi.org/10.1145/288090.288106

Okamoto, Tatsuaki; Uchiyama, Shigenori, A new public-key cryptosystem as secure as factoring, Advances in Cryptology - EUROCRYPT’98. Lecture Notes in Computer Science, 1403. Springer, pp. 308-318, (1998).

https://doi.org/10.1007/bfb0054135

Paillier, Pascal, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT’99. Springer, pp. 223-238, (1999).

https://doi.org/10.1007/3-540-48910-x_16

Craig G. Fully homomorphic encryption using ideal lattices, STOC. Vol. 9. 2009.

https://doi.org/10.1145/1536414.1536440

Ivan Damgard, Mads Jurik, A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. Public Key Cryptography, pp. 119-136, (2001).

https://doi.org/10.7146/brics.v7i45.20212

Galbraith, Jay R., Organizing to Deliver Solutions, Organizational Dynamics, 31 (Autumn), pp. 194-207, (2002).

https://doi.org/10.1016/s0090-2616(02)00101-8

Akinori Kawachi, Keisuke Tanaka, and Keita Xagawa, Multi-bit cryptosystems based on lattice problems, In Public Key Cryptography-PKC 2007. Springer, pp. 315-329.

https://doi.org/10.1007/978-3-540-71677-8_21

Peeter Laud, Alisa Pankova, On the (Im)possibility of Privately Outsourcing Linear Programming, CCSW’13, November 8, 2013, Berlin, Germany.

https://doi.org/10.1145/2517488.2517490

Lifei Wei, Haojin Zhu, Zhenfu Cao, Xiaolei Dong, Weiwei Jia, Yunlu Chen, Athanasios V. Vasilakos, Security and privacy for storage and computation in cloud computing, Information Sciences 258 (2014), pp. 371-386.

https://doi.org/10.21275/v4i12.nov151792

Xiaofeng Chen, Jin Li, Jianfeng Ma, Qiang Tang, Wenjing Lou, New Algorithms for Secure Outsourcing of Modular Exponentiations, IEEE Transactions on Parallel and Distributed Systems, Vol. 25, No. 9, September 2014.

https://doi.org/10.1109/tpds.2013.180

Frederik Armknecht, Colin Boyd, Christopher Carr, Kristian Gjosteen, Angela Jaschke, Christian A. Reuter, Martin Strand, A Guide to Fully Homomorphic Encryption, (2015). https://doi.org/10.1007/978-3-642-31410-0_15

Jannatul Ferdush, Tasnim Mehzabin, M. M. A. Hashem, Securely Outsourcing of Large Scale Linear Fractional Programming Problem to Public Cloud, in Procs. of the IEEE 2016 5th International Conference on Informatics, Electronics and Vision (ICIEV 2016), Bangladesh.

https://doi.org/10.1109/iciev.2016.7760028

Jianfeng Wang, Xiaofeng Chen, Efficient and Secure Storage for Outsourced Data: A Survey, Data Sci. Eng. (2016) 1(3): pp. 178-188.

https://doi.org/10.1007/s41019-016-0018-9

Kristian Gjosteen, Martin Strand, Can there be efficient and natural FHE schemes.

https://doi.org/10.1145/3538969.3544417

Dario Fiore, Maria Isabel, Gonzalez Vasco, Claudio Soriente, Partitioned Group PasswordBased Authenticated Key Exchange, (2017).

https://doi.org/10.1093/comjnl/bxx078

Aayush Jain, Peter M. R. Rasmussen, Amit Sahai, Threshold Fully Homomorphic Encryption, (2017).

https://ia.cr/2017/257

I-Chen Tsai, Chia-Mu Yu, Haruo Yokota, Sy-Yen Kuo, Key Management in Internet of Things via Kronecker Product, 2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing, IEEE, (2017).

https://doi.org/10.1109/prdc.2017.25

Swathi, V., and M. P. Vani. ”Security and privacy challenges in cloud: survey and research direction.” International Journal of Computation Enginering Research (IJCER) 7.08 (2017): 63-72.

https://doi.org/10.23883/ijrter.2018.4083.xwpna

Swathi, V., D. Saidulu, and B. Chandrakala. ”Enabling Secure and Effective Spatial Query Processing on the Cloud using Forward Spatial Transformation.” International Journal of Computer Engineering In Research Trends 4.7 (2017): 301-307.

https://tinyurl.com/yc4aywpz

Bo Zhang, Boxiang Dong, Wendy Hui Wang, Integrity Authentication for SQL Query Evaluation on Outsourced Databases: A Survey, August 2018.

https://doi.org/10.1109/tkde.2019.2947061

Yanguo Peng, Hui Li, Jiangtao Cui, Jianfeng MA, Yingfan Liu, Towards Secure Approximate k-Nearest Neighbor Query Over Encrypted High Dimensional Data, IEEE Access, Vol. 6, pp. 23137-23151, 2018.

https://doi.org/10.1109/access.2018.2830355

Ahmed El-Yahyaoui, Mohamed Dafir Ech-Cherif El Kettani, An Efficient Fully Homomorphic Encryption Scheme, International Journal of Network Security, Vol.21, No.1, pp. 91-99, Jan. 2019.

https://tinyurl.com/4vbbmkky

Liangmin Wang, Zhendong Yang, Xiangmei Song, SHAMC: A Secure and highly available database system in multi-cloud environment, Future Generation Computer Systems, Volume 105, April 2020, pp. 873-883.

https://doi.org/10.1016/j.future.2017.07.011

Vinod Ramesh Falmari, M. Brindha, Privacy preserving cloud based secure digital locker using Paillier based difference function and chaos based cryptosystem, Journal of Information Security and Applications, Volume 53, August 2020, p. 102513.

https://doi.org/10.1016/j.jisa.2020.102513

Swathi, V., and M. P. Vani. ”Privacy-Cheating Discouragement: A New Homomorphic Encryption Scheme for Cloud Data Security.” 2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT). IEEE, 2020.

https://doi.org/10.1109/icccnt49239.2020.9225481

Swathi, V., and M. P. Vani. ”A secure increased key policy attribute in cloud computing.” Journal of Innovation in Computer Science and Engineering 11.1 (2021): 26-29.

https://tinyurl.com/49tdww78




DOI: https://doi.org/10.31449/inf.v47i10.4586

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.