一种新的公平有效的可分电子货币系统  

A Novel Fair and Efficient Divisible E-Cash System

作　　者：潘剑峰[1] 唐西林[1] 

机构地区：[1]华南理工大学理学院数学系,广东广州510640

出　　处：《微电子学与计算机》2010年第6期76-79,共4页Microelectronics & Computer

基　　金：国家自然科学基金项目(10571061)

摘　　要：基于schnorr盲签名和非交互的零知识证明构造了一种新的公平有效的可分电子货币系统.该系统中可分电子货币的计算利用了一重离散对数和抗强碰撞的Hash函数.系统中使用了C值以界定其安全性.C值可以是C1,也可以由C1,C2级联得到,其中C1可在发生多重消费时揭示用户身份,而C1和C2结合则使得B(银行)和T(可信方)进行货币追踪和用户追踪简便易行.此外,该方案还能够实现多重花费和多重存款的追踪,并通过限制T的权限,有效防止B和T联合作弊.A novel fair and efficient divisible E-Cash system based on the schnorr blind signature and non-interactive zero-knowledge proofs is proposed in this paper.In this system,both discrete logarithm and collision-resistance Hash function are used in the computation of divisible E-Cash.It contains the C value which defines the security.C can only be C1or be obtained by associated by C1and C2,where C1 is able to disclose the users＇ ID when over-spending happened.Moreover,the combination of and can realized owner tracing and coin tracing through the cooperation of B and T more easily.The scheme can also realize overspending tracing and over-deposit user,furthermore,it can limit the power of T,avoid the possibility of the association guilt between B and T.

关 键 词：电子货币 公平性 可分性 货币追踪和用户追踪 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]