{"title":"实数域上初等运算的同态加密算法","authors":"Zhang Tong, Wu Qi, Liu Wen, Chen Liang","doi":"10.1109/CYBERC.2012.35","DOIUrl":null,"url":null,"abstract":"Based on the homomorphism of Lee et al, Xiang Guangli et al proposed similar module and implemented encrypting operations of addition, subtraction, multiplication and division over real number domain. There was additive and multiplicative homomorphism heretofore. But their cipher text leaks the information of decimal fraction, sign and relationship of big and small. We propose additive, subtractive, multiplicative and divisive homomorphism over real number domain based on representation of real number by positive integer and Fermat's Little Theorem. We prove the security and correctness of the proposed homomorphism encryption system. The results of instances show that there are no the problems mentioned above in our algorithm.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Homomorphism Encryption Algorithm for Elementary Operations over Real Number Domain\",\"authors\":\"Zhang Tong, Wu Qi, Liu Wen, Chen Liang\",\"doi\":\"10.1109/CYBERC.2012.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the homomorphism of Lee et al, Xiang Guangli et al proposed similar module and implemented encrypting operations of addition, subtraction, multiplication and division over real number domain. There was additive and multiplicative homomorphism heretofore. But their cipher text leaks the information of decimal fraction, sign and relationship of big and small. We propose additive, subtractive, multiplicative and divisive homomorphism over real number domain based on representation of real number by positive integer and Fermat's Little Theorem. We prove the security and correctness of the proposed homomorphism encryption system. The results of instances show that there are no the problems mentioned above in our algorithm.\",\"PeriodicalId\":416468,\"journal\":{\"name\":\"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBERC.2012.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2012.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Homomorphism Encryption Algorithm for Elementary Operations over Real Number Domain
Based on the homomorphism of Lee et al, Xiang Guangli et al proposed similar module and implemented encrypting operations of addition, subtraction, multiplication and division over real number domain. There was additive and multiplicative homomorphism heretofore. But their cipher text leaks the information of decimal fraction, sign and relationship of big and small. We propose additive, subtractive, multiplicative and divisive homomorphism over real number domain based on representation of real number by positive integer and Fermat's Little Theorem. We prove the security and correctness of the proposed homomorphism encryption system. The results of instances show that there are no the problems mentioned above in our algorithm.