电子学报Issue(9)：1805-1809,5.DOI:10.3969/j.issn.0372-2112.2015.09.019
基于花费链最优匿名的等长可传递电子现金系统
Transferable E-cash System of Equal Length with Optimal Anonymity Based on Spending Chain
摘要
Abstract
There exist some problems such that the length of the E-cash is proportional to the number of the transfer protocol in the transferable E-cash system.Using the Groth-Sahai (GS)proof system and accumulator,we first propose spending chain algo-rithm and design a transferable E-cash system of equal length with optimal anonymity in the standard model.Based on the spending chain,the users do not need to keep in memory the data associated to all past transactions.Compared with the existing systems,the length of the E-cash is constant in the spending protocol.Meanwhile,the new system achieves the optimal anonymity,such as full anonymity,perfect anonymity 1 and perfect anonymity 2.At last,the security proof of the systemis given in the standard model,i.e. unforgeability,anonymity,identification of double spender and exculpability.关键词
可传递电子现金系统/花费链/有限累加器/Groth-Sahai 证明/交互签名Key words
transferable E-cash system/spending chain/bounded accumulator/Groth-Sahai proof/commuting signature分类
信息技术与安全科学引用本文复制引用
张江霄,李舟军,高延武,冯春辉,郭华..基于花费链最优匿名的等长可传递电子现金系统[J].电子学报,2015,(9):1805-1809,5.基金项目
国家自然科学基金（No．60973105，No．61170189，No．61300172，No．61370126）；博士点基金（No．20111102130003，No．20121102120017）；软件开发环境国家重点实验自主课题（No．SKLSDE-2013ZX-19．No．SKLSDE-2012ZX-11）；中央高校基本科研业务专项资金（No．YWF-13-A02-13）；河北省高等学校青年拔尖人才计划项目 （）
