Multiple Denominations in E-cash with Compact Transaction Data

We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transaction data sent to the merchant has a constant number of bits while spending a monetary value 2ℓ . Moreover, the spending protocol does not require complex zero-knowledge proofs of knowledge such as proofs about double discrete logarithms. We then propose the first strongly anonymous scheme with standard unforgeability requirement and realistic generation parameters while improving the efficiency of the spending phase.

• Type: Conference
• Year: 2010
• Where: FC
• Authors: Sébastien Canard, Aline Gouget
• Keywords: Complex Zero-knowledge Proofs, Cryptology, Divisible E-cash, FC 2010, Spending Protocol