
List of Publications
“A New Paradigm for Individuals in the Information Age,” D. Chaum, Proceedings of the Oakland Security and Privacy Conference 1984, IEEE Press.
“Accessible VoterVerifiability,” D. Chaum, B. Hosp, S. Popoveniuc, & P. L. Vora, Taylor & Francis Group, LLC, Cryptologia, 33:283–291, 2009.
“Achieving Electronic Privacy,” D. Chaum, (invited) Scientific American, August 1992, pp. 96101.
“An Efficient Credential Mechanism Allowing Limited Number of Credential Types,” D. Chaum & J.H. Evertse. Unpublished.
“An Improved Protocol for Demonstrating Possession of a Discrete Logarithm and Some Generalizations,” D. Chaum, J.H. Evertse, & J. van de Graaf, Advances in Cryptology EUROCRYPT '87, D. Chaum & W.L. Price (Eds.), SpringerVerlag, pp. 127141.
“A Provably Secure and Fast Message Authentication Scheme,” D. Chaum & Maarten van der Ham, Unpublished.
“A Secure and PrivacyProtecting Protocol for Transmitting Personal Information Between Organizations,” D. Chaum & J.H. Evertse, Advances in Cryptology CRYPTO '86, A.M. Odlyzko (Ed.), SpringerVerlag, pp. 118167.
“An Interactive Signature Scheme,” D. Chaum & N.T. Ferguson, Unpublished.
“Attacks on some RSA Signature Schemes,” D. Chaum & W. de Jonge, Advances in Cryptology CRYPTO '85, H.C. Williams (Ed.), SpringerVerlag, pp. 1827.
“Blind Signatures for Untraceable Payments,” D. Chaum, Advances in Cryptology Proceedings of Crypto 82, D. Chaum, R.L. Rivest, & A.T. Sherman (Eds.), Plenum, pp. 199203.
“Blinding for Unanticipated Signatures,” D. Chaum, Advances in Cryptology EUROCRYPT '87, D. Chaum & W.L. Price (Eds.), SpringerVerlag, pp. 227233.
“Chaum's protocol for detecting maninthemiddle: Explanation, demonstration, and timing studies for a textmessaging scenario,” (Not listed as author.) A.T. Sherman, J. Seymour, A. Kore, & W. Newton Cryptologia, May, 2016.
“Combining Secrets in Most Concealing Ways: Dynamic Graphs for Restricted Choices in Hidden Key Transformations,” B. den Boer & D. Chaum. Unpublished.
“Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups,” D. Chaum, Dissertation, Computer Science, UC Berkeley, June 1982.
“Convertible Undeniable Signatures,” D. Chaum, I. Damgard, & T. Pedersen, Advances in Cryptology CRYPTO '90, A.J. Menezes & S.A. Vanstone (Eds.), SpringerVerlag, pp. 189205.
“Cryptanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers,” D. Chaum & J.H. Evertse, Advances in Cryptology CRYPTO '85, H.C. Williams (Ed.), SpringerVerlag, pp. 192211.
“Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer,” D. Chaum, E. van Heijst & B. Pfitzmann, Advances in Cryptology CRYPTO '91, J. Feigenbaum (Ed.), SpringerVerlag, pp. 470484.
“Demonstrating Possession of a Discrete Log Without Revealing It,” D. Chaum, J.H. Evertse, J. van de Graaf, & R. Peralta, Advances in Cryptology CRYPTO '86, A.M. Odlyzko (E d.), SpringerVerlag, pp. 200212.
“Demonstrating that a Public Predicate can be Satisfied Without Revealing any Information About How,” D. Chaum, Advances in Cryptology CRYPTO '86, A.M. Odlyzko (Ed.), SpringerVerlag, pp. 195199.
“Design Concepts for TamperResponding Systems,” D. Chaum, Advances in Cryptology Proceedings of Crypto 83, D. Chaum (Ed.), Plenum, pp. 387392.
“Direct Zero Knowledge Proofs of Computational Power in Five Rounds,” T. Okamoto, K. Ohta, & D. Chaum, Advances in Cryptology EUROCRYPT '91, D.W. Davies (Ed.), SpringerVerlag, pp. 96105.
“Efficient Offline Electronic Checks,” B. den Boer, D. Chaum, E. van Heyst, S. Mjxlsnes, & A. Steenbeek, Advances in Cryptology EUROCRYPT '89, J.J. Quisquater & J. Vandewalle (Eds.), SpringerVerlag, pp. 294301.
“Elections with Unconditionally Secret Ballots and Disruption Equivalent to Breaking RSA,” D. Chaum, Advances in Cryptology EUROCRYPT '88, .G. Gunther (Ed.), SpringerVerlag, pp. 177182.
“Gradual and Verifiable Release of a Secret,” E.F. Brickell, D. Chaum, I.B. Damgerd, & J. van de Graaf, Advances in Cryptology CRYPTO ' 87, C. Pomerance (Ed.), SpringerVerlag, pp. 156166.
“Group Signatures,” D. Chaum & E van Heyst, Advances in Cryptology EUROCRYPT '91, D.W. Davies (Ed.), SpringerVerlag, pp. 257265.
“Highly Secure But Untraceable Transactions,” D. Chaum, Proceedings of IFIP SEC'86, NorthHolland, to appear.
“How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding and Threshold Systems,” D. Chaum, Advances in Cryptology CRYPTO '84, G. R Blakley & D. Chaum (Eds.), SpringerVerlag, pp. 481485.
“Implementating Capability Based Protection Using Encryption,” D. Chaum & R.S. Fabry, UC Berkeley Memorandum UCB/ERL M78/46.
“Minimum Disclosure Proofs of Knowledge,” G. Brassard, D. Chaum & C. Crepeau, (invited) Journal of Computer an Systems Sciences, vol. 37 no. 2, 19 88, pp.156189.
“Multiparty Computations Ensuring Secrecy of Each Party's Input and Correctness of the Result,” D. Chaum, I.B. Damgerd, & J. van de Graaf, Advances in Cryptology CRYPTO '87, C. Pomerance (Ed.), SpringerVerlag, pp. 87119.
“Multiparty Unconditionally Secure Protocols,” D. Chaum, C. Crhpeau & I. Damgerd, Proceedings of the Twentieth ACM Symposium on the Theory of Computing, ACM, 1988, pp. 1119.
“Numbers Can Be a Better Form of Cash than Paper,” D. Chaum, Smart Card 2000, D. Chaum (Ed.), North Holland, 1991, pp. 151156.
“Online Cash Checks,” D. Chaum, Advances in Cryptology EUROCRYPT '89, J.J. Quisquater & J. Vandewalle (Eds.), SpringerVerlag, pp. 288293.
“Payasyougo Poker & Showing Satisfiability of an Arbitrary Predicate Without Revealing How Both as Secure as Factoring,” D. Chaum, workshop record, Algorithms, randomness and complexity, CIRM, MarseilleLuminy, March 1986. Unpublished.
“Prepaid Smart Card Techniques: A Brief Introduction and Comparison,” D.Chaum, 1993.
“Privacy Protected Payments: Unconditional Payer and/or Payee Untraceability,” D. Chaum, Smart Card 2000, D. Chaum & I. SchaumullerBichl (Eds.), North Holland, 1989, pp. 6993.
“Provably Unforgeable Signatures,” D. Chaum & J. Bos, Advances in Cryptology CRYPTO '92, Ernest F. Brickell (Ed), SpringerVerlag, pp. 114.
“Provers Can Limit the Number of Verifiers,” D. Chaum.
“Remotegrity: Design and Use of an EndtoEnd Verifiable Remote Voting System,” F. Zagorski, R. T. Carback, D. Chaum, J. Clark, A. Essex & P. L. Vora M. Jacobson et al. (Eds.): ACNS 2013, LNCS 7954, pp. 441–457, 2013.
“Scantegrity: EndtoEnd VoterVerifiable OpticalScan Voting,” D. Chaum, A. Essex, R. Carback, A. Sherman, J. Clark, S. Popoveniuc & P. Vora 2008 IEEE.
“Scantegrity II: EndtoEnd Verifiability by Voters of Optical Scan Elections Through Confirmation Codes,” D. Chaum, R. T. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Y. A. Ryan, E. Shen, A. T. Sherman & P. L. Vora 2009 IEEE.
“Scantegrity II: EndtoEnd Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes,” D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Y. A. Ryank, E. Shen & A. T. Sherman pp. 113.
“Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy,” R. Carback, D. Chaum, J. Clark, J. Conway, A. Essex, P. S. Herrnson, T. Mayberry, S. Popoveniuc, R. L. Rivest, E. Shen A. T. Sherman & P. L. Vora.
“Scantegrity III: automatic trustworthy receipts, highlighting over/under votes, and full voter verifiability,” Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections (EVT/WOTE'11). USENIX Association, Berkeley, CA, USA, 77. Alan T. Sherman, Russell A. Fink, Richard Carback, and David Chaum. 2011.
“Scantegrity Mock Election at Takoma Park,” R. Carback, D. Chaum, J. Clark, J. Conway, A. Essex, P. S. Herrnson, T. Mayberry, S. Popoveniuc, R. L. Rivest, E. Shen A. T. Sherman & P. L. Vora.
“SecretBallot Receipts: True VoterVerifiable Elections,” D. Chaum IEEE Computer Society, pp. 3947, 2004.
“Securing OpticalScan Voting,” S. Popoveniuc1, J. Clark, R. Carback, A. Essex, and D. Chaum Towards Trustworthy Elections, LNCS 6000, pp. 357–369, 2010.
“Security Without Identification: Transaction Systems to Make Big Brother Obsolete,” D. Chaum, (invited) Communications of the ACM, vol. 28 no. 10, October 1985 pp. 10301044; Revised version (in Dutch) Informatie, pp. 213, 1987. Extended and revised version: Subtitled ”Card Computers to Make Big Brother Obsolete” (in German), InformatikSpektrum, vol. 10, pp. 262277 1987; & Datenschutz und Datensicherung, no. 1, 1988, pp. 2641.
“Showing Credentials Without Identification: Signatures Transferred Between Unconditionally Unlinkable Pseudonyms,” D. Chaum, Accepted but not Presented Auscrypt '89.
“Silo Watching” also known as ”Verification by Anonymous Monitors,” D. Chaum, Advances in Cryptology a Report on CRYPTO 81, A Gersho (Ed.), U. of Cal., Santa Barbara, ECE Report No. 8204, pp. 138140.
“Smart Cash: A Practical Electronic Payment System,” J. Bos & D. Chaum, CWIReport CSR9035, August 1990.
“Some Variations on RSA Signatures and Their Security,” D. Chaum & W. de Jonge, Advances in Cryptology CRYPTO '86, A.M. Odlyzko (Ed.), SpringerVerlag, pp. 4959.
“Some Weaknesses of Weaknesses of Undeniable Signatures,” D. Chaum, EUROCRYPT '91, D.W. Davies (Ed.), SpringerVerlag, pp. 554556.
“The Dining Cryptographers Problem: Unconditional Sender Untraceability,” D. Chaum, (invited) Journal of Cryptology, vol. 1 no. 1, 1988, pp. 6575.
“The Spymasters Double Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities,” D. Chaum, Advances in Cryptology CRYPTO'89, G. Brassard (Ed.), SpringerVerlag, pp. 591601.
“Transferred money grows,” D. Chaum & T.P. Pedersen, Advances in Cryptology Eurocrypt '92, R.A. Ruepp el (Ed.), SpringerVerlag, pp. 89105.
“Trust Relationships and Information Security,” D. Chaum, (invited) Proceedings of the National Electronics Conference, 1981.
“UnconditionallySecure Digital Signatures,” D. Chaum & S. Roijakkers, Advances in Cryptology CRYPTO '90, SpringerVerlag, A.J. Menezes & S.A. Vanstone (Eds.), pp. 206 214.
“Undeniable Signatures,” D. Chaum & H. van Antwerpen, Advances in CryptologyCRYPTO '89, G. Brassard (Ed.), SpringerVerlag, pp. 2122 6.
“Undeniable Signatures: Applications and Theory,” J. Boyar, D. Chaum, I. Damgerd & T. Pedersen, July, 1991.
“Untraceable Electronic Cash,” D. Chaum, A. Fiat, & M. Naor, Advances in Cryptology CRYPTO '88, S. Goldwasser (Ed.), SpringerVerlag, pp. 319327.
“Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” D. Chaum, Communications of the ACM, vol. 24 no. 2, February, 1981.
“Wallet Databases with Observers,” D. Chaum & T.P. Pedersen, Advances in Cryptology CRYPTO'92, Ernest F. Brickell (Ed), SpringerVerlag, pp. 114.
“Zero Information Circuits with DES,” D. Chaum & B. den Boer. Unpublished.
“ZeroKnowledge Undeniable Signatures,” D. Chaum, Advances in Cryptology EUROCRYPT'90, I.B. Damgard (Ed.), SpringerVerlag, pp. 458464.