首页 | 本学科首页   官方微博 | 高级检索  
     

可任意花费的可传递电子现金系统
引用本文:张江霄,冯春辉,马金鑫,张斌,徐畅,李舟军,党莹. 可任意花费的可传递电子现金系统[J]. 北京理工大学学报, 2019, 39(3): 283-289. DOI: 10.15918/j.tbit1001-0645.2019.03.010
作者姓名:张江霄  冯春辉  马金鑫  张斌  徐畅  李舟军  党莹
作者单位:邢台学院数学与信息技术学院,河北,邢台054001;中国信息安全测评中心,北京,100191;北京理工大学计算机学院,北京,100081;北京航空航天大学软件开发环境国家重点实验室,北京,100191;邢台医学主高等专科学校,河北,邢台054000
基金项目:国家"八六三"计划项目(2015AA016004);国家自然科学基金资助项目(61672081,61502536,61402037);河北省科技厅项目(17214707);邢台学院技级重点项目(XTXYZD2018008);河北省教育厅人文青年拔尖人才项目(BJ2018211)
摘    要:针对现有的可传递电子现金系统在传递协议中传递花费顺序固定以及传递次数受限制的问题,利用Groth-Sahai证明系统、对承诺的承诺和Ghadafi群盲签名,在标准模型下构建一个具有最优匿名性的可任意花费的等长可传递电子现金系统,该系统中电子现金的花费不受任何花费顺序限制,传递次数是任意次.基于对承诺的承诺,可以对所传递的序列号进行压缩,从而保证用户传递电子现金的长度是常量;基于Ghadafi群盲签名,实现了电子现金花费用户的任意性;在标准模型下,证明了新系统的安全属性,该系统具有不可伪造性、最优匿名性、不可重复花费性和不可诬陷性. 

关 键 词:可传递电子现金系统  对承诺的承诺  Groth-Sahai证明  Ghadafi的群盲签名
收稿时间:2017-07-30

Transferable E-Cash System with Arbitrarily Spending Order
ZHANG Jiang-xiao,FENG Chun-hui,MA Jin-xin,ZHANG Bin,XU Chang,LI Zhou-jun and DANG Ying. Transferable E-Cash System with Arbitrarily Spending Order[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 2019, 39(3): 283-289. DOI: 10.15918/j.tbit1001-0645.2019.03.010
Authors:ZHANG Jiang-xiao  FENG Chun-hui  MA Jin-xin  ZHANG Bin  XU Chang  LI Zhou-jun  DANG Ying
Affiliation:1. Mathematics and Information Technology Institute, Xingtai University, Xingtai, Hebei 054001, China;2. China Information Technology Security Evaluation Center, Beijing 100191, China;3. School of Computer Science & Technology, Beijing Institute of Technology, Beijing, China;4. State Key Laboratory of Software Development Environment, Beihang University, Beijing 100191, China;5. Xingtai Medical college, Xingtai, Hebei 054000, China
Abstract: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.
Keywords:transferable E-cash system  commitment to commitment  Groth-Sahai proof  Ghadafi group blind signature
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号