Dual Server Public Key Encryption With Keyword Search for Secure Cloud Storage
Main Article Content
Abstract
Accessible cryptography is of accelerating enthusiasm for fending the data protection in secure, accessible distributed storage. During this paper, we tend to examine the safety of Associate in Nursing all-round kenned cryptological primitive, above all, open key cryptography with shibboleth ask for (PEKS) that is extraordinarily auxiliary in varied uses of distributed storage. Haplessly, it's been incontestable that the customary PEKS system experiences Associate in Nursing essential instability referred to as within watchword approximation assault (KGA) propelled by the threatening server. To deal with this security weakness, we tend to propose an aborning PEKS system named double server PEKS (DS-PEKS). As another principle commitment, we tend to characterize a starting variation of the graceful projective hash capacities (SPHFs) alluded to as direct and Homomorphic SPHF (LH-SPHF). We tend to at that time demonstrate a bland development of secure DS-PEKS from LH-SPHF. To stipulate the chance of our early system, we tend to offer a good representation of the final structure from a selection Diffie–Hellman-predicated LH-SPHF and demonstrate that it will accomplish the energetic security against within the KGA.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
R. Chen, Y. Mu, G. Yang, F. Guo, and X. Wang, “A new general framework for secure public key encryption with keyword search,” in Proc. 20th Australasian Conf. Inf. Secure. Privacy (ACISP), 2015, pp. 59–76.
P. Xu, H. Jin, Q. Wu, and W. Wang, “Public-key encryption with a fuzzy keyword search: A provably secure scheme under keyword guessing attack,” IEEE Trans. Comput., vol. 62, no. 11, pp. 2266–2277, Nov. 2013.
D. Khader, “Public key encryption with keyword search based on K-resilient IBE,” in Proc. Int. Conf. Comput. Sci. Appl. (ICCSA), 2006, pp. 298–308.
R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” in Proc. 13th ACM Conf. Comput. Commun.Secur. (CCS), 2006, pp. 79–88.
M. Abdalla et al., “Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions,” in Proc. 25th Annu. Int. Conf. CRYPTO, 2005, pp. 205–222.
B. R. Waters, D. Balfanz, G. Durfee, and D. K. Smetters, “Building an encrypted and searchable audit log,” in Proc. NDSS, 2004, pp. 1–11.
D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proc. Int. Conf. EUROCRYPT, 2004, pp. 506–522.
R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 563–574.
R. Gennaro and Y. Lindell, “A framework for password-based authenticated key exchange,” in Proc. Int. Conf. EUROCRYPT, 2003, pp. 524–543.
D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proc. IEEE Symp. Secure. Privacy, May 2000, pp. 44–55.
A.Raghavendra Praveen Kumar, K.Tarakesh, and U.Veeresh ,” A Secure and Dynamic Multi Keyword Ranked Search Scheme over encrypted.” International Journal of Computer Engineering in Research Trends., vol.2, no.12, pp. 1137-1141, 2015.
Mr. Rahul Hon, and Mrs. N.Sujatha,” A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing.” International Journal of Computer Engineering in Research Trends., vol.3, no.6, pp. 314-320, 2016.
Kallem Rajender Reddy, and Y.Sunitha,” A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing.” International Journal of Computer Engineering in Research Trends., vol.2, no.9, pp. 640-645, 2015.
Vadla Jhansi Rani, and K.Samson Paul,” Secure Multi Keyword Dynamic Search Scheme Supporting Dynamic Update..” International Journal of Computer Engineering in Research Trends., vol.4, no.8, pp. 356-360, 2017.
Mr. M. Veerabrahma Chary and Mrs.N.Sujatha,” A Novel Additive Multi-Keyword Search for Multiple Data Owners in Cloud Computing.” International Journal of Computer Engineering in Research Trends., vol.3, no.6, pp. 308-313, 2016.
Mr. M. VEERABRAHMA CHARY, Mrs.N.SUJATHA,” A Novel Additive Multi-Keyword Search for Multiple Data Owners in Cloud Computing .” International Journal of Computer Engineering In Research Trends., vol.3, no.6, pp. 308-313, 2016.
G.Lucy, D.Jaya Narayana Reddy, R.Sandeep Kumar,” Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data.” International Journal of Computer Engineering In Research Trends., vol.2, no.12, pp. 919-923, 2015.
G.Dileep Kumar, A.Sreenivasa Rao,” Privacy-Preserving Public Auditing using TPA for Secure Searchable Cloud Storage data.” International Journal of Computer Engineering In Research Trends., vol.2, no.11, pp. 767-770, 2015.