• Publications
  • Influence
Blind Signatures for Untraceable Payments
  • D. Chaum
  • Business, Computer Science
  • CRYPTO
  • 1982
TLDR
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. Expand
  • 2,980
  • 230
  • PDF
Untraceable Electronic Mail, Return Addresses and Digital Pseudonyms
  • D. Chaum
  • Business, Computer Science
  • Secure Electronic Voting
  • 2003
  • 1,575
  • 177
The dining cryptographers problem: Unconditional sender and recipient untraceability
  • D. Chaum
  • Mathematics, Computer Science
  • 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. Expand
  • 1,396
  • 160
  • PDF
Untraceable electronic mail, return addresses, and digital pseudonyms
  • D. Chaum
  • Computer Science
  • CACM
  • 1 February 1981
TLDR
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 an unsecured underlying telecommunication system. Expand
  • 3,030
  • 120
  • PDF
Wallet Databases with Observers
TLDR
A combination of tamper-proof and personal workstation can overcome the limitations of each alone, providing both security and correctness for organizations as well as privacy and even anonymity for individuals. Expand
  • 1,217
  • 68
  • PDF
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 ; sending the image in an unblinded form to a second party; and receiving a note including a digital signature, wherein the note represents a commitment by the second party to credit a predetermined amount of money to a first party. Expand
  • 1,131
  • 66
  • PDF
Security without identification: transaction systems to make big brother obsolete
  • D. Chaum
  • Computer Science
  • CACM
  • 1 October 1985
TLDR
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. Expand
  • 1,596
  • 65
  • PDF
Distance-Bounding Protocols (Extended Abstract)
TLDR
The distance bounding technique we introduce solves this problem by timing the delay between sending out a challenge bit and receiving back the corresponding response bit. Expand
  • 519
  • 55
Multiparty unconditionally secure protocols
TLDR
Under the assumption that each pair can communicate secretly, we show that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest. Expand
  • 1,309
  • 44
  • PDF
A Practical Voter-Verifiable Election Scheme
TLDR
We present an election scheme designed to allow voters to verify that their vote is accurately included in the count. Expand
  • 378
  • 42
  • PDF