检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海大学通信与信息工程学院,上海200444
出 处:《计算机应用研究》2017年第6期1790-1793,共4页Application Research of Computers
基 金:国家自然科学基金资助项目(61572309);上海市教委创新基金资助项目(14YZ020)
摘 要:模指数运算是公钥密码体制中的基本运算,但造价昂贵。可验证外包计算将用户的计算代价转移给服务器,能大大提高用户的计算效率,且能有效验证服务器的计算结果。针对多个模指数运算的外包方案进行了研究,利用指数之间的相互隐藏,提出了新的两个模指数运算外包方案,并推广到多个模指数运算。方案基于两个服务器,实现了模指数运算底数和指数的隐私性,并且用户的可验证概率接近于1。与已有方案相比,所提方案同时提高了用户的计算效率和外包结果的可验证概率。理论分析和仿真实验均表明,所提方案极大地降低了用户的计算代价。Modular exponentiation is the basic operation of public key cryptosystem, but the cost is expensive. Verifiable outsourcing delegates the computing cost to servers, which can greatly improve the computing efficiency of user, and verify the result returned from servers. In study of outsourcing multiple modular exponentiations, this paper proposed a new algorithm of double modular exponentiations by hiding the exponent, and then proposed an algorithm of multiple modular exponentiations similarly. These schemes used two un-trusted servers to achieve the privacy of base and index, and the user could detect the error with probability close to 1. Compared with the previous algorithms, proposed algorithms increase the computational efficiency and verifiable probability. Finally, theoretical analysis and simulation experiments show that they greatly reduce the computational cost of user.
分 类 号:TP309.2[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15