云计算中高效安全的批量运算外包

Xu Ma, Jin Li, Fangguo Zhang
{"title":"云计算中高效安全的批量运算外包","authors":"Xu Ma, Jin Li, Fangguo Zhang","doi":"10.1109/iNCoS.2012.31","DOIUrl":null,"url":null,"abstract":"Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. Promising as it is, this paradigm also brings forth new challenges for security when users want to securely outsource the computation of cryptographic operations to the untrusted cloud servers. As we know, modular exponentiation is one of basic operations among most of current cryptosystems. In this paper, we present two generic secure outsourcing schemes enabling users to securely outsource the computations of exponentiations to cloud servers. The first one is a secure outsourcing scheme for fixed base-variable exponent exponentiation, while the second is for fixed exponent-variable base exponentiation. With our techniques, a batch of exponentiations (eg. t exponentiations) can be efficiently computed by the user with only (n+t) multiplications, where n is the number of bits of the exponent. Furthermore, there is not any pre-computation on the user side. The schemes are proved to be secure under the Hidden Subset Sum Problem.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficient and Secure Batch Exponentiations Outsourcing in Cloud Computing\",\"authors\":\"Xu Ma, Jin Li, Fangguo Zhang\",\"doi\":\"10.1109/iNCoS.2012.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. Promising as it is, this paradigm also brings forth new challenges for security when users want to securely outsource the computation of cryptographic operations to the untrusted cloud servers. As we know, modular exponentiation is one of basic operations among most of current cryptosystems. In this paper, we present two generic secure outsourcing schemes enabling users to securely outsource the computations of exponentiations to cloud servers. The first one is a secure outsourcing scheme for fixed base-variable exponent exponentiation, while the second is for fixed exponent-variable base exponentiation. With our techniques, a batch of exponentiations (eg. t exponentiations) can be efficiently computed by the user with only (n+t) multiplications, where n is the number of bits of the exponent. Furthermore, there is not any pre-computation on the user side. The schemes are proved to be secure under the Hidden Subset Sum Problem.\",\"PeriodicalId\":287478,\"journal\":{\"name\":\"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iNCoS.2012.31\",\"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 Fourth International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iNCoS.2012.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

云计算是一种新兴的计算范式,其中IT资源和能力作为服务在互联网上提供。尽管这种模式很有前景,但当用户希望将加密操作的计算安全地外包给不受信任的云服务器时,这种模式也给安全性带来了新的挑战。模幂运算是目前大多数密码系统的基本运算之一。在本文中,我们提出了两种通用的安全外包方案,使用户能够安全地将指数计算外包给云服务器。第一种是固定基数-可变基数求幂的安全外包方案,第二种是固定基数-可变基数求幂的安全外包方案。使用我们的技术,一批幂运算(例如:用户只需(n+ T)次乘法就可以有效地计算T次幂,其中n是指数的位数。此外,在用户端没有任何预计算。在隐子集和问题下证明了该方案的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient and Secure Batch Exponentiations Outsourcing in Cloud Computing
Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. Promising as it is, this paradigm also brings forth new challenges for security when users want to securely outsource the computation of cryptographic operations to the untrusted cloud servers. As we know, modular exponentiation is one of basic operations among most of current cryptosystems. In this paper, we present two generic secure outsourcing schemes enabling users to securely outsource the computations of exponentiations to cloud servers. The first one is a secure outsourcing scheme for fixed base-variable exponent exponentiation, while the second is for fixed exponent-variable base exponentiation. With our techniques, a batch of exponentiations (eg. t exponentiations) can be efficiently computed by the user with only (n+t) multiplications, where n is the number of bits of the exponent. Furthermore, there is not any pre-computation on the user side. The schemes are proved to be secure under the Hidden Subset Sum Problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信