Cryptology ePrint Archive: Report 2007/216
Unlinkable Divisible Digital Cash without Trusted Third Party
Pawel Pszona and Grzegorz Stachowiak
Abstract: We present an efficient divisible digital cash scheme
which is unlinkable and does not require Trusted Third Party.
The size of the coin is proportional to the size
of the primes we use, i.e., hundreds of bytes.
The computational and communication complexity of the protocol
is proportional to a polynomial of the size of the primes
and polylogarithm of the maximum number of pieces to which a coin can be subdivided.
Category / Keywords: cryptographic protocols / digital cash, divisibility, unlinkability
Date: received 6 Jun 2007, last revised 5 Jul 2007
Contact author: gst at ii uni wroc pl
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20070705:132802 (All versions of this report)
Short URL: ia.cr/2007/216
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]