VLDB 2026 Research / reviewers in the wild / expert
David Chaum
dblp:c/DavidChaum
· DBLP profile ↗
34ranked-venue papers
25as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 32 · 24 first-author · 1 since 2021Theory of computation · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
27 papers |
Cryptographic protocols and secure computation · 77% Cryptographic primitives and cryptanalysis · 16% Privacy and data protection · 4% |
Topics — the 30 heaviest of 38, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › electronic voting
ballot secrecy |
0.1 | 1 | 2010 | Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy · USENIX Security Symposium 2010 |
Cryptographic protocols and secure computation › electronic voting
end-to-end verifiable e-voting |
0.1 | 1 | 2010 | Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy · USENIX Security Symposium 2010 |
Cryptographic protocols and secure computation › electronic voting
end-to-end verifiable voting |
0.1 | 1 | 2009 | Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes · IEEE Trans. Inf. Forensics Secur. 2009 |
Cryptographic protocols and secure computation › electronic voting
verifiable voting |
0.1 | 1 | 2009 | Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes · IEEE Trans. Inf. Forensics Secur. 2009 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.1 | 9 | 1992 | Provably Unforgeable Signatures · CRYPTO 1992 Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer · CRYPTO 1991 Unconditionally Secure Digital Signatures · CRYPTO 1990 |
Cryptographic protocols and secure computation
voting |
0.0 | 1 | 2010 | Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy · USENIX Security Symposium 2010 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.0 | 5 | 1992 | Wallet Databases with Observers · CRYPTO 1992 The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities · CRYPTO 1989 Multiparty Unconditionally Secure Protocols (Extended Abstract) · STOC 1988 |
Cryptographic protocols and secure computation › electronic voting › verifiable voting
voter verification |
0.0 | 1 | 2009 | Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes · IEEE Trans. Inf. Forensics Secur. 2009 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › non-transferable signatures
undeniable signature |
0.0 | 3 | 1991 | Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer · CRYPTO 1991 Convertible Undeniable Signatures · CRYPTO 1990 Undeniable Signatures · CRYPTO 1989 |
Privacy and data protection › anonymity
anonymous payment |
0.0 | 3 | 1992 | Wallet Databases with Observers · CRYPTO 1992 Untraceable Electronic Cash · CRYPTO 1988 Blind Signatures for Untraceable Payments · CRYPTO 1982 |
Blockchain and cryptocurrency security
electronic cash |
0.0 | 2 | 1992 | Wallet Databases with Observers · CRYPTO 1992 Untraceable Electronic Cash · CRYPTO 1988 |
Cryptographic protocols and secure computation › secure multiparty computation
unconditionally secure multiparty computation |
0.0 | 2 | 1989 | The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities · CRYPTO 1989 Multiparty Unconditionally Secure Protocols (Abstract) · CRYPTO 1987 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures |
0.0 | 3 | 1988 | Untraceable Electronic Cash · CRYPTO 1988 Blind Signature System · CRYPTO 1983 Blind Signatures for Untraceable Payments · CRYPTO 1982 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › unforgeability
existential unforgeability |
0.0 | 1 | 1992 | Provably Unforgeable Signatures · CRYPTO 1992 |
Privacy and data protection
anonymity |
0.0 | 2 | 1988 | The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability · J. Cryptol. 1988 A New Paradigm for Individuals in the Information Age · S&P 1984 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.0 | 2 | 1986 | Demonstrating Possession of a Discrete Logarithm Without Revealing It · CRYPTO 1986 Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How · CRYPTO 1986 |
Cryptographic protocols and secure computation
secret sharing |
0.0 | 2 | 1987 | Gradual and Verifiable Release of a Secret · CRYPTO 1987 How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems · CRYPTO 1984 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › digital signature security
unconditionally secure signature |
0.0 | 1 | 1990 | Unconditionally Secure Digital Signatures · CRYPTO 1990 |
Cryptographic protocols and secure computation › secure multiparty computation
honest-majority MPC |
0.0 | 1 | 1988 | Multiparty Unconditionally Secure Protocols (Extended Abstract) · STOC 1988 |
Cryptographic protocols and secure computation › fair exchange
gradual release |
0.0 | 1 | 1987 | Gradual and Verifiable Release of a Secret · CRYPTO 1987 |
Cryptographic protocols and secure computation › secret sharing
verifiable secret sharing |
0.0 | 1 | 1987 | Gradual and Verifiable Release of a Secret · CRYPTO 1987 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
proofs of knowledge |
0.0 | 1 | 1986 | Demonstrating Possession of a Discrete Logarithm Without Revealing It · CRYPTO 1986 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › factorization-based signature
RSA signature |
0.0 | 1 | 1986 | Some Variations on RSA Signatures and Their Security · CRYPTO 1986 |
Cryptographic primitives and cryptanalysis
security analysis |
0.0 | 1 | 1986 | Some Variations on RSA Signatures and Their Security · CRYPTO 1986 |
Cryptographic primitives and cryptanalysis
block cipher cryptanalysis |
0.0 | 1 | 1985 | Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers · CRYPTO 1985 |
Cryptographic primitives and cryptanalysis › public-key cryptography
signature scheme cryptanalysis |
0.0 | 1 | 1985 | Attacks on Some RSA Signatures · CRYPTO 1985 |
Cryptographic primitives and cryptanalysis
encryption |
0.0 | 1 | 1984 | New Secret Codes Can Prevent a Computerized Big Brother (Abstract) · CRYPTO 1984 |
Cryptographic protocols and secure computation
key management |
0.0 | 1 | 1984 | How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems · CRYPTO 1984 |
Privacy and data protection › anonymity
pseudonym systems |
0.0 | 1 | 1984 | A New Paradigm for Individuals in the Information Age · S&P 1984 |
Cryptographic protocols and secure computation
threshold cryptography |
0.0 | 1 | 1984 | How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems · CRYPTO 1984 |
Methods — techniques the papers use, named apart from their topics
cryptographic verification · 0.1cryptanalysis · 0.0secret communication · 0.0cryptographic credential transformation · 0.0anonymous payments · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | W-OTS+ Up My Sleeve! A Hidden Secure Fallback for Cryptocurrency Wallets
David Chaum, Mario Larangeira, Mario Yaksetig, William Carter |
ACNS (1) | 1 |
| 2017 | cMix: Mixing with Minimal Real-Time Asymmetric Cryptographic Operations
David Chaum, Debajyoti Das 0001, Farid Javani, Aniket Kate, Anna Krasnova, Joeri de Ruiter, Alan T. Sherman |
ACNS | 1 |
| 2013 | Remotegrity: Design and Use of an End-to-End Verifiable Remote Voting System
Filip Zagórski, Richard Carback, David Chaum, Jeremy Clark, Aleksander Essex, Poorvi L. Vora |
ACNS | 3 |
| 2010 | Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy
Richard Carback, David Chaum, Jeremy Clark, John Conway, Aleksander Essex, Paul S. Herrnson, Travis Mayberry, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Alan T. Sherman, Poorvi L. Vora |
USENIX Security Symposium | 2 |
| 2010 | Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codesabstractIn the above titled paper (ibid., vol. 4, no. 4, pp. 611-627, Dec. 09), due to a production error, the affiliations of two of the authors were listed incorrectly. The correct affiliations are presented here. Also, the name of the last author in the affiliations footnote was printed incorrectly. The correct name is P. Y. A. Ryan. David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2009 | Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codesabstractScantegrity II is an enhancement for existing paper ballot systems. It allows voters to verify election integrity - from their selections on the ballot all the way to the final tally - by noting codes and checking for them online. Voters mark Scantegrity II ballots just as with conventional optical scan, but using a special ballot marking pen. Marking a selection with this pen makes legible an otherwise invisible preprinted confirmation code. Confirmation codes are independent and random for each potential selection on each ballot. To verify that their individual votes are recorded correctly, voters can look up their ballot serial numbers online and verify that their confirmation codes are posted correctly. The confirmation codes do not allow voters to prove how they voted. However, the confirmation codes constitute convincing evidence of error or malfeasance in the event that incorrect codes are posted online. Correctness of the final tally with respect to the published codes is proven by election officials in a manner that can be verified by any interested party. Thus, compromise of either ballot chain of custody or the software systems cannot undetectably affect election integrity. Scantegrity II has been implemented and tested in small elections in which ballots were scanned either at the polling place or centrally. Preparations for its use in a public sector election have commenced. David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2009 | Guest editorial: special issue on electronic votingabstractThe 13 papers in this special issue focus on electronic voting. Ronald L. Rivest, David Chaum, Bart Preneel, Aviel D. Rubin, Donald G. Saari, Poorvi L. Vora |
IEEE Trans. Inf. Forensics Secur. | 2 |
| 2005 | A Practical Voter-Verifiable Election Scheme
David Chaum, Peter Y. A. Ryan, Steve A. Schneider |
ESORICS | 1 |
| 1992 | Provably Unforgeable Signatures
Jurjen N. Bos, David Chaum |
CRYPTO | 2 |
| 1992 | Wallet Databases with Observers
David Chaum, Torben P. Pedersen |
CRYPTO | 1 |
| 1991 | Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
David Chaum, Eugène van Heijst, Birgit Pfitzmann |
CRYPTO | 1 |
| 1990 | Convertible Undeniable Signatures
Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen |
CRYPTO | 2 |
| 1990 | Unconditionally Secure Digital Signatures
David Chaum, Sandra Roijakkers |
CRYPTO | 1 |
| 1989 | The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities
David Chaum |
CRYPTO | 1 |
| 1989 | Undeniable Signatures
David Chaum, Hans Van Antwerpen |
CRYPTO | 1 |
| 1988 | Untraceable Electronic Cash
David Chaum, Amos Fiat, Moni Naor |
CRYPTO | 1 |
| 1988 | Multiparty Unconditionally Secure Protocols (Extended Abstract)abstractUnder the assumption that each pair of participants em communieatc secretly, we show that any reasonable multiparty protwol can be achieved if at least Q of the Participants am honest. The secrecy achieved is unconditional, It does not rely on any assumption about computational intractability. 1. David Chaum, Claude Crépeau, Ivan Damgård |
STOC | 1 |
| 1988 | Minimum Disclosure Proofs of Knowledge
Gilles Brassard, David Chaum, Claude Crépeau |
J. Comput. Syst. Sci. | 2 |
| 1988 | The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability
David Chaum |
J. Cryptol. | 1 |
| 1987 | Gradual and Verifiable Release of a Secret
Ernie Brickell, David Chaum, Ivan Damgård, Jeroen van de Graaf |
CRYPTO | 2 |
| 1987 | Multiparty Unconditionally Secure Protocols (Abstract)
David Chaum, Claude Crépeau, Ivan Damgård |
CRYPTO | 1 |
| 1987 | Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
David Chaum, Ivan Damgård, Jeroen van de Graaf |
CRYPTO | 1 |
| 1986 | Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How
David Chaum |
CRYPTO | 1 |
| 1986 | A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations
David Chaum, Jan-Hendrik Evertse |
CRYPTO | 1 |
| 1986 | Demonstrating Possession of a Discrete Logarithm Without Revealing It
David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf, René Peralta 0001 |
CRYPTO | 1 |
| 1986 | Some Variations on RSA Signatures and Their Security
Wiebren de Jonge, David Chaum |
CRYPTO | 2 |
| 1985 | Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers
David Chaum, Jan-Hendrik Evertse |
CRYPTO | 1 |
| 1985 | Attacks on Some RSA Signatures
Wiebren de Jonge, David Chaum |
CRYPTO | 2 |
| 1984 | New Secret Codes Can Prevent a Computerized Big Brother (Abstract)
David Chaum |
CRYPTO | 1 |
| 1984 | How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems
David Chaum |
CRYPTO | 1 |
| 1984 | A New Paradigm for Individuals in the Information AgeabstractToday, individuals provide substantially the same identifying information to each organization with which they have a relationship. In a new paradigm, individuals provide different "pseudonyms" or alternate names to each organization. A critical advantage of systems based on such pseudonyms is that the information associated with each pseudonym can be insufficient to allow data on an individual to be linked and collected together, and thus they can prevent the formation of a dossier society reminiscent of Orwell's "1984".A system is proposed in which an individual's pseudonyms are created and stored in a computer held and trusted only by the individual. New cryptographic techniques allow an organization to securely exchange messages or payments with an individual known under a pseudonym--without the communication or payments systems providers being able to trace messages or payments. Other new techniques allow a digitally signed credential to be transformed by the individual, from the individual's pseudonym with the issuing organization, to the individual's pseudonym with a recipient organization. Credentials can be transformed only between pseudonyms of a single individual, and an individual can obtain at most one pseudonym with a particular organization, but even a conspiracy of all organizations can gain no information from the pseudonyms about their correspondence. The combination of these systems can prevent abuses by individuals, while averting the potential for a dossier society. David Chaum |
S&P | 1 |
| 1983 | Blind Signature System
David Chaum |
CRYPTO | 1 |
| 1983 | Design Concepts for Tamper Responding Systems
David Chaum |
CRYPTO | 1 |
| 1982 | Blind Signatures for Untraceable Payments
David Chaum |
CRYPTO | 1 |