实数域上初等运算的同态加密算法

Zhang Tong, Wu Qi, Liu Wen, Chen Liang
{"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}
引用次数: 4

摘要

在Lee等人同态的基础上,向广利等人提出了相似的模块,并在实数域上实现了加、减、乘、除的加密运算。在此之前存在着加法同态和乘法同态。而他们的密文泄露了小数、符号和大小关系的信息。基于实数的正整数表示和费马小定理,提出了实数域上的加、减、乘、分同态。证明了所提出的同态加密系统的安全性和正确性。实例结果表明,该算法不存在上述问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Deadline Based Performance Evaluation of Job Scheduling Algorithms The Digital Aggregated Self: A Literature Review An Efficient TCB for a Generic Content Distribution System Testing Health-Care Integrated Systems with Anonymized Test-Data Extracted from Production Systems A Framework for P2P Botnet Detection Using SVM
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1