云環(huán)境下安全外包橢圓曲線點的乘法
發(fā)布時間：2018-12-11 05:11
【摘要】：云計算是一種新興的計算模式,它為云用戶提供了強大的計算環(huán)境,但同時也引起了用戶安全性和隱私性問題的關注.模冪運算是大多數(shù)現(xiàn)行的密碼系統(tǒng)的基本運算之一,也是公鑰密碼系統(tǒng)在計算資源限制型設備上的計算瓶頸所在.使用傳統(tǒng)的平方-乘算法計算一個n比特的指數(shù)的模冪運算,平均需要1.5n個模乘,對于資源有限型用戶(或設備,例如智能卡)來說,這個計算量是個很沉重的負載.外包計算是云計算模式的優(yōu)點之一,它使得云用戶的計算能力不再受限于各自的資源約束型設備,通過外包工作負載給云,云用戶可以使用云提供的無限資源來完成高代價的計算.本文圍繞"外包模冪運算"這個問題展開研究,為橢圓曲線的點的乘法的計算問題,提出了一個安全的外包計算方案,并且將本文的方案應用于加速橢圓曲線數(shù)字簽名的驗證.
[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.
【作者單位】： 廣州大學數(shù)學與信息科學學院 數(shù)學與交叉科學廣東普通高校重點實驗室;湖南科技大學數(shù)學與計算科學學院;
【基金】：國家自然科學基金資助項目(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.
【作者單位】： 廣州大學數(shù)學與信息科學學院 數(shù)學與交叉科學廣東普通高校重點實驗室;湖南科技大學數(shù)學與計算科學學院;
【基金】：國家自然科學基金資助項目(11271003) 教育部博士點基金博導類項目(2013441011003) 廣東省自然科學基金資助項目(S2012010009950) 廣東省高層次人才項目 廣州市教育局項目(2012A004)
【分類號】：TN918.4
【共引文獻】
相關期刊論文 前6條
1 許芬;龐雷;羅守山;王樅;;擴展代理多方計算及其協(xié)議[J];北京郵電大學學報;2011年04期
2 楊威;黃劉生;王啟研;;基于橢圓曲線的三方比特承諾[J];電子與信息學報;2009年05期
3 蔣林智;丁勇;;一種新的基于Client-puzzle的WAPI認證協(xié)議抗拒絕服務攻擊方案[J];桂林電子科技大學學報;2012年01期
4 范武英,張有誼,鄭東;關于子集和問題的故障停止式簽名[J];通信保密;2000年03期
5 鄭東,陳克非,谷大武,尤晉元;一種有效的比特承諾方案[J];通信學報;2000年02期
6 劉鏹;唐春明;胡杏;張永強;;多租賃用戶模型下有效安全外包計算[J];信息網(wǎng)絡安全;2013年09期
相關博士學位論文 前2條
1 楊威;安全多方量子計算基礎協(xié)議的研究[D];中國科學技術(shù)大學;2007年
2 石z閹，
本文編號：2371937
本文鏈接：http://sikaile.net/kejilunwen/wltx/2371937.html
最近更新
教材專著
