E-cash and cryptocurrency schemes have been a focus of applied cryptography for a long time. However, we acknowledge the continuing need for a cryptographic protocol that provides global scale, decentralized, secure, and fair delivery of donations. Such a protocol would replace central trusted entities (e.g., charity organizations) and guarantee the privacy of the involved parties (i.e., donors and recipients of the donations). In this work, we target this online donation problem and propose a practical solution for it. First, we propose a novel decentralized e-donation framework, along with its operational components and security definitions. Our framework relies on a public ledger that can be realized via a distributed blockchain. Second, we instantiate our e-donation framework with a practical scheme employing privacy-preserving cryptocurrencies and attributebased signatures. Third, we provide implementation results showing that our operations have feasible computation and communication costs. Finally, we prove the security of our e-donation scheme via formal reductions to the security of the underlying primitives.
 Harry Kalodner, Steven Goldfeder, Xiaoqi Chen, S. Matthew Weinberg, and Edward W. Felten. 2018. Arbitrum: Scalable, Private Smart Contracts. In USENIX (SEC’18).
 J. Katz and Y. Lindell. 2007. Introduction to Modern Cryptography (2nd ed.). Chapman & Hall/CRC.
 A. Kiayias, E. Koutsoupias, M. Kyropoulou, and Y. Tselekounis. 2016. Blockchain Mining Games. In ACM EC ’16.
 A. Kiayias, H.-S. Zhou, and V. Zikas. 2016. Fair and Robust Multi-party Computation Using a Global Transaction Ledger. In EUROCRYPT ’16.
 Sunny King and Scott Nadal. 2012. PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake.
 A. Kosba, A. Miller, E. Shi, Z. Wen, and C. Papamanthou. 2016. Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts. In IEEE SP.
 M. Y. Kubilay, M. S. Kiraz, and H. A. Mantar. 2018. CertLedger: A New PKI Model with Certificate Transparency Based on Blockchain. arXiv preprint arXiv:1806.03914 (2018). http://arxiv.org/abs/1806.03914.
 R. Kumaresan and I. Bentov. 2014. How to Use Bitcoin to Incentivize Correct Computations. In ACM CCS ’14.
 R. Kumaresan, V. Vaikuntanathan, and P. N. Vasudevan. 2016. Improvements to Secure Computation with Penalties. In ACM CCS ’16.
 Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. 4, 3 (July 1982).
 M. Möser, K. Soska, E. Heilman, K. Lee, H. Heffan, S. Srivastava, K. Hogan, J. Hennessey, A. Miller, A. Narayanan, and N. Christin. 2018. An Empirical Analysis of Traceability in the Monero Blockchain. PoPETs (2018).