The SCEAS System
Navigation Menu

Search the dblp DataBase


David Chaum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Chaum
    Security Without Identification: Transaction Systems to Make Big Brother Obsolete. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:10, pp:1030-1044 [Journal]
  2. David Chaum
    Blind Signatures for Untraceable Payments. [Citation Graph (1, 0)][DBLP]
    CRYPTO, 1982, pp:199-203 [Conf]
  3. David Chaum, Amos Fiat, Moni Naor
    Untraceable Electronic Cash. [Citation Graph (1, 0)][DBLP]
    CRYPTO, 1988, pp:319-327 [Conf]
  4. David Chaum
    Numbers Can Be a Better Form of Cash than Paper. [Citation Graph (0, 0)][DBLP]
    Computer Security and Industrial Cryptography, 1991, pp:174-178 [Conf]
  5. David Chaum
    Showing Credentials without Identification Transfeering Signatures between Unconditionally Unlinkable Pseudonyms. [Citation Graph (0, 0)][DBLP]
    AUSCRYPT, 1990, pp:246-264 [Conf]
  6. Jurjen N. Bos, David Chaum
    Provably Unforgeable Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:1-14 [Conf]
  7. Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen
    Convertible Undeniable Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:189-205 [Conf]
  8. David Chaum
    Verification by Anonymous Monitors. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1981, pp:138-139 [Conf]
  9. David Chaum
    Blind Signature System. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:153- [Conf]
  10. David Chaum
    Design Concepts for Tamper Responding Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:387-392 [Conf]
  11. David Chaum
    New Secret Codes Can Prevent a Computerized Big Brother (Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:432-433 [Conf]
  12. David Chaum
    How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:481-485 [Conf]
  13. David Chaum
    Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:195-199 [Conf]
  14. David Chaum
    The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:591-602 [Conf]
  15. David Chaum, Hans Van Antwerpen
    Undeniable Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:212-216 [Conf]
  16. David Chaum, Claude Crépeau, Ivan Damgård
    Multiparty Unconditionally Secure Protocols (Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:462- [Conf]
  17. David Chaum, Ivan Damgård, Jeroen van de Graaf
    Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:87-119 [Conf]
  18. David Chaum, Jan-Hendrik Evertse
    Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:192-211 [Conf]
  19. David Chaum, Jan-Hendrik Evertse
    A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:118-167 [Conf]
  20. David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf, René Peralta
    Demonstrating Possession of a Discrete Logarithm Without Revealing It. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:200-212 [Conf]
  21. David Chaum, Eugène van Heijst, Birgit Pfitzmann
    Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:470-484 [Conf]
  22. David Chaum, Torben P. Pedersen
    Wallet Databases with Observers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:89-105 [Conf]
  23. David Chaum, Sandra Roijakkers
    Unconditionally Secure Digital Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:206-214 [Conf]
  24. Ernest F. Brickell, David Chaum, Ivan Damgård, Jeroen van de Graaf
    Gradual and Verifiable Release of a Secret. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:156-166 [Conf]
  25. Wiebren de Jonge, David Chaum
    Attacks on Some RSA Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:18-27 [Conf]
  26. Wiebren de Jonge, David Chaum
    Some Variations on RSA Signatures and Their Security. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:49-59 [Conf]
  27. David Chaum
    New Secret Codes can Prevent a Computerized Big Brother. [Citation Graph (0, 0)][DBLP]
    Datenschutz und Datensicherung, 1985, pp:33-34 [Conf]
  28. David Chaum, Peter Y. A. Ryan, Steve A. Schneider
    A Practical Voter-Verifiable Election Scheme. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2005, pp:118-139 [Conf]
  29. David Chaum
    Showing Credentials Without Identification: SIgnatures Transferred Between Unconditionally Unlinkable Pseudonyms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1985, pp:241-244 [Conf]
  30. David Chaum
    Blinding for Unanticipated Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1987, pp:227-233 [Conf]
  31. Stefan Brands, David Chaum
    Distance-Bounding Protocols (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1993, pp:344-359 [Conf]
  32. David Chaum
    Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1988, pp:177-182 [Conf]
  33. David Chaum
    Online Cash Checks. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:288-293 [Conf]
  34. David Chaum
    Zero-Knowledge Undeniable Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:458-464 [Conf]
  35. David Chaum
    Some Weaknesses of "Weaknesses of Undeniable Signatures". [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:554-556 [Conf]
  36. David Chaum
    Designated Confirmer Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1994, pp:86-91 [Conf]
  37. David Chaum, Bert den Boer, Eugène van Heyst, Stig Fr. Mjølsnes, Adri Steenbeek
    Efficient Offline Electronic Checks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:294-301 [Conf]
  38. David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf
    An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1987, pp:127-141 [Conf]
  39. David Chaum, Eugène van Heyst
    Group Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:257-265 [Conf]
  40. David Chaum, Torben P. Pedersen
    Transferred Cash Grows in Size. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:390-407 [Conf]
  41. Tatsuaki Okamoto, David Chaum, Kazuo Ohta
    Direct Zero Knowledge Proofs of Computational Power in Five Rounds. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:96-105 [Conf]
  42. Bart Preneel, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen
    Race Integrity Primitives Evaluation (RIPE): A Status Report. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:547-551 [Conf]
  43. Joos Vandewalle, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen
    A European Call For Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:267-271 [Conf]
  44. David Chaum
    A New Paradigm for Individuals in the Information Age. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 1984, pp:99-106 [Conf]
  45. David Chaum, Claude Crépeau, Ivan Damgård
    Multiparty Unconditionally Secure Protocols (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:11-19 [Conf]
  46. David Chaum
    Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1981, v:24, n:2, pp:84-88 [Journal]
  47. Poorvi L. Vora, Ben Adida, Ren Bucholz, David Chaum, David L. Dill, David Jefferson, Douglas W. Jones, William Lattin, Aviel D. Rubin, Michael I. Shamos, Moti Yung
    Evaluation of voting systems. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2004, v:47, n:11, pp:144- [Journal]
  48. David Chaum
    Secret-Ballot Receipts: True Voter-Verifiable Elections. [Citation Graph (0, 0)][DBLP]
    IEEE Security & Privacy, 2004, v:2, n:1, pp:38-47 [Journal]
  49. David Chaum
    Sicherheit ohne Identifizierung: Scheckkartencomputer, die den Großen Bruder der Vergangenheit angehören lassen - Zur Diskussion gestellt. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1987, v:10, n:5, pp:262-277 [Journal]
  50. David Chaum
    On Electronic Commerce: How Much Do You Trust Big Brother? (Interview). [Citation Graph (0, 0)][DBLP]
    IEEE Internet Computing, 1997, v:1, n:6, pp:8-16 [Journal]
  51. Gilles Brassard, David Chaum, Claude Crépeau
    Minimum Disclosure Proofs of Knowledge. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:2, pp:156-189 [Journal]
  52. David Chaum
    The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1988, v:1, n:1, pp:65-75 [Journal]

  53. 07311 Executive Summary -- Frontiers of Electronic Voting. [Citation Graph (, )][DBLP]

  54. 07311 Abstracts Collection -- Frontiers of Electronic Voting. [Citation Graph (, )][DBLP]

  55. Freezing More Than Bits: Chilling Effects of the OLPC XO Security Model. [Citation Graph (, )][DBLP]

  56. Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. [Citation Graph (, )][DBLP]

  57. Scantegrity Mock Election at Takoma Park. [Citation Graph (, )][DBLP]

  58. Attacking Paper-Based E2E Voting Systems. [Citation Graph (, )][DBLP]

  59. Securing Optical-Scan Voting. [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.008secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002