Paper 2007/216 Original: eprint.iacr.org/2007/216 ↗

Unlinkable Divisible Digital Cash without Trusted Third Party

Pawel Pszona
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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2007-07-05: last updated
2007-06-08: published
Short URL
https://ia.cr/2007/216
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2007/216,
      author = {Pawel Pszona and Grzegorz Stachowiak},
      title = {Unlinkable Divisible Digital Cash without Trusted Third Party},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/216},
      year = {2007},
      url = {https://eprint.iacr.org/2007/216}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.