[{“box”:0,”content”:”[if 992 equals=”Open Access”]
Open Access
n
[/if 992]n
n
n
n
n
- n t
n
Lekha Achuth, Nesha Kavya
[/foreach]
n
n
n[if 2099 not_equal=”Yes”]n
- [foreach 286] [if 1175 not_equal=””]n t
- Associate Professor, Student, PES University, Department of Computer Applications, PES University, Department of Computer Applications, Bengaluru, Bengaluru, India, India
n[/if 1175][/foreach]
[/if 2099][if 2099 equals=”Yes”][/if 2099]nn
Abstract
nThe ability to selectively distribute data with individuals in public cloud services may alleviate safety concerns about inadvertent privacy violations in cloud storage. The need for flexibility in sharing specific sets of documents with various user groups requires the use of distinct encryption keys for each document. This project addresses the practical challenges by introducing the concept of Key-Aggregate Searchable Encryption (KASE).Natural language processing was used to extract essential phrases from a file that would be uploaded by the data owner. It removes the punctuation, special character, and numeric values from the file and finds the term frequency of there maining keywords. With help of the term frequency, the keyword rank of all the words is derived. This helps in retrieving the file at a faster rate. Hash codeis also derived from all these keywords obtained to maintain the security of the file.
n
Keywords: Key searchable encryption, data sharing, cloud computing, data privacy
n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Data Structure Studies(ijdss)]
n
n
n
n
n
nn
nn[if 992 equals=”Open Access”] Full Text PDF Download[else] nvar fieldValue = “[user_role]”;nif (fieldValue == ‘indexingbodies’) {n document.write(‘Full Text PDF‘);n }nelse if (fieldValue == ‘administrator’) { document.write(‘Full Text PDF‘); }nelse if (fieldValue == ‘ijdss’) { document.write(‘Full Text PDF‘); }n else { document.write(‘ ‘); }n [/if 992] [if 379 not_equal=””]n
Browse Figures
n
n[/if 379]n
References
n[if 1104 equals=””]n
[1]S.yu,C.Wang,K.ren,andW.lou “AchievingSecureScalable,andFine-GrainedDataAccessControl in Cloud Computing, vol. 44, no. 5, pp.643-666,2010.
[2]R.lu,X.Lin,X.Liang,andX.Shen,”SecureProvenance: The Essential of Bread and Butter ofData Forensics in Cloud Coputing”., vol. 10, no. 1,pp. 282- 292,Jan. 2010.
[3]C.Chu,S.Chow,W.Tzeng,etal.,“Key-Aggregate Cryptosystem for Scalable Data Sharingin Cloud Storage”, IEEE Transactions on ParallelandDistributedSystems,vol.7,no.4,pp.346-358,2014.
[4] Li,X.F.Chen,M.Q.Li,J.W.Li,P.Lee,Wenjing Lou. “Secure Deduplication with Efficientand Reliable Convergent Key Management”, IEEETransactions on Parallel and Distributed Systems,vol.64, no. 9, pp. 2519-2533, Sep. 2015.
[5] B.Oliveira,D.F.Aranha,E.Morais,etal.“Tinytate:Computingthetatepairinginresource-constrained sensor nodes”, IEEE Sixth IEEEInternationalSymposiumonNetworkComputingandApplications, pp. 318-323, 2007.
[6] H.Phan,D.Pointcheval,S.F.Shahandashti,etal.“AdaptiveCCAbroadcastencryptionwithconstant-sizesecretkeysandciphertexts”,inProc. DSN,2015, pp.379–390
[7] Song,D.Wagner,A.Perrig.“Practicaltechniquesforsearchesonencrypteddata”,IEEESymposium on Security and Privacy, IEEE Press, pp.44C55, 2000
[8] J. Li, and K and . Kim, “Hidden attribute-based signatures without anonymity revocation”, Inf. Sci., vol. 180, no. 9, pp. 1681-1689, 2010.
[9] J. Li, X. F. Chen, M. Q. Li, J. W. Li, P. Lee, and W. Lou, “Secure deduplication with efficient and reliable convergent key management”, IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 6, pp. 1615-1625, Jun. 2014.
[10] M. Li, W. Lou, and K. Ren, “Data security and privacy in wireless body area networks”, IEEE Wireless Commun., vol. 17, no. 1, pp. 51-58, Feb. 2010.
[11] D. Boneh, C. Gentry and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys”, Proc. 25th Annu. Int. Conf. Adv. Cryptol., pp. 258-275, 2005.
nn[/if 1104][if 1104 not_equal=””]n
- [foreach 1102]n t
- [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
n[/foreach]
n[/if 1104]
nn
nn[if 1114 equals=”Yes”]n
n[/if 1114]
n
n
n
n
n
| Volume | |
| [if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424] | |
| Received | February 2, 2024 |
| Accepted | |
| Published |
n
n
n
n
n
nn function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n”}]