Blind Signatures for Untraceable Payments

By David Chaum. 1982

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “It has many applications in voting [18], [19], mix-nets [20], and solvency proofs [17].”
Zerocash: Decentralized Anonymous Payments from Bitcoin (2014, background): “The currency owes its rise in part to the fact that, unlike traditional e-cash schemes [1, 2, 3], it requires no trusted parties.”
A Survey on Ethereum Systems Security (2019, background): “Unlike traditional digital cash systems [80], in which there is a trusted third party (e.”
Stateful Detection of Black-Box Adversarial Attacks (2019, methodology): “2 We call this query blinding because of its similarities to blind signatures [11].”
On Cryptographic Assumptions and Challenges (2003, background): “This notion, proposed by Chaum [ 11 ] has many application from untraceable electronic money [12] to fairness in two party computation [36].”
Blockchain Technology: Principles and Applications (2015, background): “Long before the advent of the blockchain, digital cash had been conceptualized in a setting with a central server trusted to prevent double-spending (Chaum, 1983)1.”
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks (2002, methodology): “This assumption was used in [5] to prove the security of Chaum’s RSA-based blind-signature scheme [12] in the random oracle model.”
Foundations of Cryptography: Volume 1, Basic Tools (2001, unknown): “Variants on the basic model are discussed in [183] and in [50, 137].”
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme (2003, methodology): “The RSA blind signature scheme [ 12 ] consists of three components: the key generation algorithm KeyGen described in Section 2; the signing protocol depicted in Fig. 2; and the verification algorithm.”
Direct anonymous attestation (2004, background): “Although the latter problem could be solved by using blind signatures [17] instead of ordinary signatures in the private CA’s certification, the first problem, the private CA’s availability, would persist in such a solution.”
SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies (2015, methodology): ““untraceable payments” in 1983 [25], a system involving bankissued cash in the form of blindly signed coins.”
Structure-Preserving Signatures and Commitments to Group Elements (2010, background): “Blind signatures, introduced by Chaum [40], allow a user to obtain a signature on a message such that the signer cannot relate the resulting signature to the execution of the signing protocol.”
Bitcoin, gold and the dollar – A GARCH volatility analysis (2016, background): “How is it different from cryptographic cash ( Chaum, 1983 ) and other virtual currencies ( European Central Bank, 2012 )?”
Security Arguments for Digital Signatures and Blind Signatures (2015, background): “As early as 1982, Chaum’s [13] pioneering work aimed at creating an electronic version of money.”
How to Use Bitcoin to Design Fair Protocols (2014, background): “Starting from Chaum’s work [31], there has been a lot of work proposing use of e-cash for protecting privacy of financial transactions.”
Permacoin: Repurposing Bitcoin Work for Data Preservation (2014, background): “A purely digital implementation of money has been a sought-after goal since the development of blind signatures by Chaum in 1982 [29].”