Paper 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.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
digital cashdivisibilityunlinkability
Contact author(s)
gst @ ii uni wroc pl
History
2007-07-05: last of 2 revisions
2007-06-08: received
See all versions
Short URL
https://ia.cr/2007/216
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2007/216}},
      url = {https://eprint.iacr.org/2007/216}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.