摘要
电子现金的可分性能够实现电子现金的精确花费,可分性的电子现金大多基于二叉树的思想构造,然而很少的电子现金协议同时具有可分性和公平性的特点。基于二叉树、盲签名和简单的秘密共享等思想,构造了一个公平可分的电子现金方案。
Divisibility of e-cash helps expend digital coin exactly. Most divisible e-cash schemes are based on binary tree, but few e-cash schemes offer fairness and divisibility at the same time. Based on binary tree, blind signature and zeroknowledge proof, a new fair indivisible electronic coins scheme was proposed.
出处
《计算机应用》
CSCD
北大核心
2007年第7期1594-1596,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(90204017)