{"title":"无自举的全同态对称方案","authors":"Nitesh Aggarwal, Cp Gupta, Iti Sharma","doi":"10.1109/CCIOT.2014.7062497","DOIUrl":null,"url":null,"abstract":"Capability of operating over encrypted data makes Fully Homomorphic Encryption(FHE)the Holy Grail for secure data processing applications. Though many applications need only secret keys, FHE has not been achieved properly through symmetric cryptography. Major hurdle is the need to refresh noisy ciphertexts which essentially requires public key and bootstrapping. We introduce a refreshing procedure to make a somewhat homomorphic scheme, fully homomorphic without requiring bootstrapping. Our scheme uses symmetric keys and has performance superior to existing public-key schemes.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Fully Homomorphic symmetric scheme without bootstrapping\",\"authors\":\"Nitesh Aggarwal, Cp Gupta, Iti Sharma\",\"doi\":\"10.1109/CCIOT.2014.7062497\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Capability of operating over encrypted data makes Fully Homomorphic Encryption(FHE)the Holy Grail for secure data processing applications. Though many applications need only secret keys, FHE has not been achieved properly through symmetric cryptography. Major hurdle is the need to refresh noisy ciphertexts which essentially requires public key and bootstrapping. We introduce a refreshing procedure to make a somewhat homomorphic scheme, fully homomorphic without requiring bootstrapping. Our scheme uses symmetric keys and has performance superior to existing public-key schemes.\",\"PeriodicalId\":255477,\"journal\":{\"name\":\"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCIOT.2014.7062497\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCIOT.2014.7062497","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fully Homomorphic symmetric scheme without bootstrapping
Capability of operating over encrypted data makes Fully Homomorphic Encryption(FHE)the Holy Grail for secure data processing applications. Though many applications need only secret keys, FHE has not been achieved properly through symmetric cryptography. Major hurdle is the need to refresh noisy ciphertexts which essentially requires public key and bootstrapping. We introduce a refreshing procedure to make a somewhat homomorphic scheme, fully homomorphic without requiring bootstrapping. Our scheme uses symmetric keys and has performance superior to existing public-key schemes.