云环境下安全外包椭圆曲线点的乘法
发布时间：2018-12-11 05:11
【摘要】：云计算是一种新兴的计算模式,它为云用户提供了强大的计算环境,但同时也引起了用户安全性和隐私性问题的关注.模幂运算是大多数现行的密码系统的基本运算之一,也是公钥密码系统在计算资源限制型设备上的计算瓶颈所在.使用传统的平方-乘算法计算一个n比特的指数的模幂运算,平均需要1.5n个模乘,对于资源有限型用户(或设备,例如智能卡)来说,这个计算量是个很沉重的负载.外包计算是云计算模式的优点之一,它使得云用户的计算能力不再受限于各自的资源约束型设备,通过外包工作负载给云,云用户可以使用云提供的无限资源来完成高代价的计算.本文围绕"外包模幂运算"这个问题展开研究,为椭圆曲线的点的乘法的计算问题,提出了一个安全的外包计算方案,并且将本文的方案应用于加速椭圆曲线数字签名的验证.
[Abstract]:Cloud computing is a new computing model, which provides a powerful computing environment for cloud users, but it also attracts the attention of user security and privacy. Modular power operation is one of the basic operations of most existing cryptographic systems, and is also the bottleneck of public key cryptosystems in computing resource-constrained devices. Using the traditional square-multiplication algorithm to calculate the modular power of an n-bit exponent requires an average of 1.5n modular multiplication, which is a heavy load for resource-limited users (or devices, such as smart cards). Outsourcing computing is one of the advantages of the cloud computing model, which makes the computing power of cloud users no longer limited by their respective resource constrained devices, and can be supplied to the cloud by outsourcing the workload. Cloud users can use the infinite resources provided by the cloud to perform high-cost calculations. In this paper, the problem of "outsourced modular power operation" is studied. For the point multiplication of elliptic curve, a secure outsourced computing scheme is proposed, and the scheme is applied to accelerate the verification of elliptic curve digital signature.
【作者单位】： 广州大学数学与信息科学学院 数学与交叉科学广东普通高校重点实验室;湖南科技大学数学与计算科学学院;
【基金】：国家自然科学基金资助项目(11271003) 教育部博士点基金博导类项目(2013441011003) 广东省自然科学基金资助项目(S2012010009950) 广东省高层次人才项目 广州市教育局项目(2012A004)
【分类号】：TN918.4
[Abstract]:Cloud computing is a new computing model, which provides a powerful computing environment for cloud users, but it also attracts the attention of user security and privacy. Modular power operation is one of the basic operations of most existing cryptographic systems, and is also the bottleneck of public key cryptosystems in computing resource-constrained devices. Using the traditional square-multiplication algorithm to calculate the modular power of an n-bit exponent requires an average of 1.5n modular multiplication, which is a heavy load for resource-limited users (or devices, such as smart cards). Outsourcing computing is one of the advantages of the cloud computing model, which makes the computing power of cloud users no longer limited by their respective resource constrained devices, and can be supplied to the cloud by outsourcing the workload. Cloud users can use the infinite resources provided by the cloud to perform high-cost calculations. In this paper, the problem of "outsourced modular power operation" is studied. For the point multiplication of elliptic curve, a secure outsourced computing scheme is proposed, and the scheme is applied to accelerate the verification of elliptic curve digital signature.
【作者单位】： 广州大学数学与信息科学学院 数学与交叉科学广东普通高校重点实验室;湖南科技大学数学与计算科学学院;
【基金】：国家自然科学基金资助项目(11271003) 教育部博士点基金博导类项目(2013441011003) 广东省自然科学基金资助项目(S2012010009950) 广东省高层次人才项目 广州市教育局项目(2012A004)
【分类号】：TN918.4
【共引文献】
相关期刊论文 前6条
1 许芬;庞雷;罗守山;王枞;;扩展代理多方计算及其协议[J];北京邮电大学学报;2011年04期
2 杨威;黄刘生;王启研;;基于椭圆曲线的三方比特承诺[J];电子与信息学报;2009年05期
3 蒋林智;丁勇;;一种新的基于Client-puzzle的WAPI认证协议抗拒绝服务攻击方案[J];桂林电子科技大学学报;2012年01期
4 范武英,张有谊,郑东;关于子集和问题的故障停止式签名[J];通信保密;2000年03期
5 郑东,陈克非,谷大武,尤晋元;一种有效的比特承诺方案[J];通信学报;2000年02期
6 刘镪;唐春明;胡杏;张永强;;多租赁用户模型下有效安全外包计算[J];信息网络安全;2013年09期
相关博士学位论文 前2条
1 杨威;安全多方量子计算基础协议的研究[D];中国科学技术大学;2007年
2 石z阉，
本文编号：2371937
本文链接：https://www.wllwen.com/kejilunwen/wltx/2371937.html
