基于零知识证明签名和强RSA问题的可分电子现金  

Divisible e-cash based on signatures of zero-knowledge proof and strong-RSA problem

作　　者：彭冰[1] 洪帆[1] 崔国华[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《通信学报》2006年第7期12-19,26,共9页Journal on Communications

基　　金：国家自然科学基金资助项目(90104033)~~

摘　　要：针对现有的基于二次剩余的可分电子现金方案存在二叉树深度较大、不同支付节点可链接等弊端,在零知识证明签名和强RSA问题的基础上,首次将群签名的思想引入到离线可分电子现金中,提出了一种新型离线可分电子现金支付系统。该系统克服了只能将父节点分成2个子节点的限制,且同一电子现金分割而得的不同节点具有不可链接性。There exist some drawbacks such as quite deep binary tree and the linkability within various nodes from the same ancestor in the divisible electronic cash （e-cash） scheme based on quadratic residuosity problem. Based on signatures of zero-knowledge proof and strong RSA problem, the concept of group signature was firstly introduced to off-line divisible e-cash thereafter, a new off-line divisible e-cash payment system was presented. In the new system, the ancestor node could be divided into more than 2 nodes, and above all, different nodes stem from the same e-cash was unlikable.

关 键 词：电子现金 可分性 零知识证明签名 

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