• Publications
  • Influence
Blind Signatures for Untraceable Payments
Automation of the way we pay for goods and services is already underway, as can be seen by the variety and growth of electronic banking services available to consumers. The ultimate structure of the
Untraceable electronic mail, return addresses, and digital pseudonyms
  • D. Chaum
  • Computer Science
    CACM
  • 1 February 1981
A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of
The dining cryptographers problem: Unconditional sender and recipient untraceability
  • D. Chaum
  • Computer Science, Mathematics
    Journal of Cryptology
  • 1 March 1988
TLDR
The solution presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively, and can be adapted to address efficiently a wide variety of practical considerations.
Untraceable Electronic Mail, Return Addresses and Digital Pseudonyms
  • D. Chaum
  • Business, Computer Science
    Secure Electronic Voting
  • 2003
Wallet Databases with Observers
TLDR
This article argues that a particular combination of these two kinds of mechanism can overcome the limitations of each alone, providing both security and correctness for organizations as well as privacy and even anonymity for individuals.
Untraceable Electronic Cash
TLDR
An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.
Security without identification: transaction systems to make big brother obsolete
  • D. Chaum
  • Computer Science
    CACM
  • 1 October 1985
The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.
Distance-Bounding Protocols (Extended Abstract)
TLDR
The "distance bounding" technique is introduced, which solves the problem of timing the delay between sending out a challenge bit and receiving back the corresponding response bit and can be integrated into common identification protocols.
Multiparty unconditionally secure protocols
TLDR
It is shown that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest and the secrecy achieved is unconditional.
Secret-ballot receipts: True voter-verifiable elections
  • D. Chaum
  • Computer Science
    IEEE Security & Privacy Magazine
  • 2004
A new kind of receipt sets a far higher standard of security by letting voters verify the election outcome - even if all election computers and records were compromised. The system preserves ballot
...
1
2
3
4
5
...