模逆和椭圆曲线标量乘的安全外包计算协议

发布时间：2018-07-10 11:25

本文选题：云计算 + 安全外包　；参考：《西安电子科技大学》2014年硕士论文

【摘要】：云计算是一种新兴的并且可以给云用户提供强大的计算和存储资源的计算模式。云外包作为云计算的一个重要应用,它能够帮助用户解决具有较大计算量的计算任务,从而减轻云用户的计算负担。椭圆曲线密码体制在密码学中的应用很广泛,而模逆运算和标量乘法都是其中的核心计算。因此,模逆运算和标量乘法的效率直接决定了椭圆曲线密码体制运行的效率。针对云计算环境下的模逆运算和椭圆曲线标量乘运算的安全外包计算问题,本文所做的工作如下。1.安全的外包模逆运算的协议:在该外包协议中,用户只需做三次模乘运算即可。证明了,用户可以以100%的概率发现云服务器的欺骗行为。该协议基于一次一密原理设计,因此,用户的数据隐私安全可以达到最高安全目标,即完善保密性。最后,对协议算法采用C++编程进行了实验仿真,实验表明该协议算法的效率大约是二进制欧几里得算法效率的3倍。2.安全的外包椭圆曲线上的标量乘法的协议:在非共谋的双服务器模型下提出了椭圆曲线上的标量乘法的外包计算协议。在该协议中,计算一次标量乘运算用户只需要做两次椭圆曲线上的点加运算。证明了,用户能够以3/4的概率发现服务器的欺骗行为。由于本协议基于一次一密而设计的,因此,用户的数据输入输出隐私性可以到达完善保密安全性。较之已有算法,本协议的优点在于,第一,用户的数据隐私安全可以达到密码学上最高级别—完善保密;第二,该协议算法的执行效率远远高于二进制标量乘法。对该协议算法和二进制标量乘法采用C++进行了实验仿真,在几种实际参数选取下,该协议能够提高用户的效率约207倍至475倍。
[Abstract]:Cloud computing is a new computing model that can provide cloud users with powerful computing and storage resources. As an important application of cloud computing, cloud outsourcing can help users solve computing tasks with large computational complexity, thus reducing the computing burden of cloud users. Elliptic curve cryptosystem is widely used in cryptography, in which modular inversion and scalar multiplication are the core computations. Therefore, the efficiency of modular inversion and scalar multiplication directly determines the efficiency of elliptic curve cryptosystem. In order to solve the security outsourcing problem of modular inversion and elliptic curve scalar multiplication in cloud computing environment, the work done in this paper is as follows. Secure outsourcing module inversion protocol: in this outsourcing protocol, users only need to do three modular multiplication operations. It is proved that users can detect cloud server spoofing behavior with 100% probability. The protocol is designed based on the principle of one time and one encryption. Therefore, the data privacy security of users can achieve the highest security goal, that is, perfect confidentiality. Finally, the experimental results show that the efficiency of the protocol algorithm is about 3 times that of the binary Euclidean algorithm. Secure protocol for scalar multiplication on elliptic curves: an outsourced computing protocol for scalar multiplication on elliptic curves is proposed under a non-collusive dual-server model. In this protocol, the user only needs to do two point addition operations on the elliptic curve to calculate the scalar multiplication. It is proved that the user can detect the cheating behavior of the server with a 3 / 4 probability. Because this protocol is designed one time and one time, the user's data input and output privacy can achieve perfect security. Compared with the existing algorithms, the advantages of this protocol are as follows: first, the data privacy security of users can reach the highest level of cryptography-perfect security; second, the efficiency of the algorithm is much higher than that of binary scalar multiplication. The algorithm and binary scalar multiplication are simulated with C, and the efficiency of the protocol can be improved by 207 to 475 times.
【学位授予单位】：西安电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN915.04;TN918.4

【相似文献】