检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张江霄 冯春辉 马金鑫[2] 张斌 徐畅[3] 李舟军[4] 党莹[5] ZHANG Jiang-xiao;FENG Chun-hui;MA Jin-xin;ZHANG Bin;XU Chang;LI Zhou-jun;DANG Ying(Mathematics and Information Technology Institute,Xingtai University,Xingtai,Hebei 054001,China;China Information Technology Security Evaluation Center,Beijing 100191,China;School of ComputerScience & Technology,Beijing Institute of Technology,Beijing,China;State Key Laboratory of Software Development Environment,Beihang University,Beijing 100191,China;Xingtai Medical college,Xingtai,Hebei 054000,China)
机构地区:[1]邢台学院数学与信息技术学院,河北邢台054001 [2]中国信息安全测评中心,北京100191 [3]北京理工大学计算机学院,北京100081 [4]北京航空航天大学软件开发环境国家重点实验室,北京100191 [5]邢台医学高等专科学校,河北邢台054000
出 处:《北京理工大学学报》2019年第3期283-289,共7页Transactions of Beijing Institute of Technology
基 金:国家"八六三"计划项目(2015AA016004);国家自然科学基金资助项目(61672081;61502536;61402037);河北省科技厅项目(17214707);邢台学院技级重点项目(XTXYZD2018008);河北省教育厅人文青年拔尖人才项目(BJ2018211)
摘 要:针对现有的可传递电子现金系统在传递协议中传递花费顺序固定以及传递次数受限制的问题,利用Groth-Sahai证明系统、对承诺的承诺和Ghadafi群盲签名,在标准模型下构建一个具有最优匿名性的可任意花费的等长可传递电子现金系统,该系统中电子现金的花费不受任何花费顺序限制,传递次数是任意次.基于对承诺的承诺,可以对所传递的序列号进行压缩,从而保证用户传递电子现金的长度是常量;基于Ghadafi群盲签名,实现了电子现金花费用户的任意性;在标准模型下,证明了新系统的安全属性,该系统具有不可伪造性、最优匿名性、不可重复花费性和不可诬陷性.There exist some problems such that the user spending order is fixed in the transferable E-cash system, and the transferable number is restricted. Using the Groth-Sahai proof system, Ghadafi group blind signature and commitment to commitment, a transferable E-cash system of equal length with optimal anonymity and arbitrarily spending order was designed in a standard model. It was arranged that, based on the commitment to commitment, the users could compress the transferable serial number, and the length of the E-cash could be constant in the spending protocol, based on the Ghadafi group blind signature, the arbitrarily spending order could be achieved. Finally, the security of the transferable E-cash system was verified in the standard model. Results show its unforgeability, anonymity, identification of double spender and exculpability.
关 键 词:可传递电子现金系统 对承诺的承诺 Groth-Sahai证明 Ghadafi的群盲签名
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222