Transferable E-cash System of Equal Length with Optimal Anonymity Based on Spending Chain

ZHANG Jiang-xiao; LI Zhou-jun; GAO Yan-wu; FENG Chun-hui; GUO Hua

doi:10.3969/j.issn.0372-2112.2015.09.019

您当前的位置：

首页 >

文章列表页 >

Transferable E-cash System of Equal Length with Optimal Anonymity Based on Spending Chain

更新时间：2025-07-16

- Transferable E-cash System of Equal Length with Optimal Anonymity Based on Spending Chain
- Acta Electronica Sinica Vol. 43, Issue 9, Pages: 1805-1809(2015)
- 作者机构：
  
  1. 邢台学院数学与信息技术学院,河北,邢台,054001
  2. 北京航空航天大学软件开发环境国家重点实验室,北京,100191
  3. 邢台学院数学与信息技术学院,河北,邢台,054001
  4. 北京航空航天大学软件开发环境国家重点实验室,北京,100191
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.60973105, No.61170189, No.61300172, No.61370126);Ph.D. Programs Foundation (No.20111102130003, No.20121102120017);Independent Project of State Key Laboratory of Software Development Environment (No.SKLSDE-2013ZX-19.No.SKLSDE-2012ZX-11);Fundamental Research Funds for the Central Universities (No.YWF-13-A02-13);Youth Top-notch Talents Plan of Universities in Hebei Province (No.BJ201414)
- DOI：10.3969/j.issn.0372-2112.2015.09.019
  CLC： TP393
- Published：2015
- 稿件说明：
移动端阅览
ZHANG Jiang-xiao, LI Zhou-jun, GAO Yan-wu, et al. Transferable E-cash System of Equal Length with Optimal Anonymity Based on Spending Chain[J]. Acta Electronica Sinica, 2015, 43(9): 1805-1809.
DOI：

ZHANG Jiang-xiao, LI Zhou-jun, GAO Yan-wu, et al. Transferable E-cash System of Equal Length with Optimal Anonymity Based on Spending Chain[J]. Acta Electronica Sinica, 2015, 43(9): 1805-1809. DOI： 10.3969/j.issn.0372-2112.2015.09.019.

摘要

针对现有的可传递电子现金系统在传递协议中电子现金长度和传递次数成正比的问题

利用Groth-Sahai证明系统和累加器原理

首次提出花费链构建法

并在标准模型下构建一个具有最优匿名性的传递协议中电子现金长度不变的可传递电子现金系统.基于花费链构建法

用户无需存储任何花费凭证;与现有系统相比

在传递协议中

用户传递电子现金的长度是常量;在安全性上

新系统具有最优匿名性

即全匿名性、完美匿名性1和完美匿名性2.最后

在标准模型下给出系统的安全证明

该系统具有不可伪造性、最优匿名性、不可重复花费性和不可诬陷性.

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 algorithm 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.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰