Document Type


Publication Date



In this paper, we introduce a model for donation verification. A randomized algorithm is developed to check if the money claimed being received by the collector is (1 - ϵ)-approximation to the total amount money contributed by the donors. We also derive some negative results that show it is impossible to verify the donations under some circumstances.


Original published version available at

Publication Title

ACMSE '18: Proceedings of the ACMSE 2018 Conference




To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.