{"title":"基于同态加密的流数据私有搜索","authors":"V. Rajalakshmi, Sahaya Auro Stina, S. Santhiya","doi":"10.18000/IJISAC.50162","DOIUrl":null,"url":null,"abstract":"Theoretical In this paper the issue ought to be taking into account the completely homomorphic encryption to under lying nobility’s system. In the current system quantity of time essential words ought to be utilized. It does not consider magic word recurrence. The main disadvantage of existing system is memoryless. To conquer this arrangement in the proposed work consider magic word recurrence in light of straightforward completely homomorphic encryption. The information can get to just by the client secretly. In this paper information ought to be semantically secure.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"PRIVATE SEARCHING ON STREAMING DATA BASED ON HOMOMORPHIC ENCRYPTION\",\"authors\":\"V. Rajalakshmi, Sahaya Auro Stina, S. Santhiya\",\"doi\":\"10.18000/IJISAC.50162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Theoretical In this paper the issue ought to be taking into account the completely homomorphic encryption to under lying nobility’s system. In the current system quantity of time essential words ought to be utilized. It does not consider magic word recurrence. The main disadvantage of existing system is memoryless. To conquer this arrangement in the proposed work consider magic word recurrence in light of straightforward completely homomorphic encryption. The information can get to just by the client secretly. In this paper information ought to be semantically secure.\",\"PeriodicalId\":121456,\"journal\":{\"name\":\"International Journal on Information Sciences and Computing\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal on Information Sciences and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18000/IJISAC.50162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal on Information Sciences and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18000/IJISAC.50162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
PRIVATE SEARCHING ON STREAMING DATA BASED ON HOMOMORPHIC ENCRYPTION
Theoretical In this paper the issue ought to be taking into account the completely homomorphic encryption to under lying nobility’s system. In the current system quantity of time essential words ought to be utilized. It does not consider magic word recurrence. The main disadvantage of existing system is memoryless. To conquer this arrangement in the proposed work consider magic word recurrence in light of straightforward completely homomorphic encryption. The information can get to just by the client secretly. In this paper information ought to be semantically secure.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
