Abstract
In this paper we present a communicational proof-of-work – a new tool that can be used, among others, for filtering messages and limiting spam. Our idea can be regarded as an analogue of regular proofs-of-work introduced by Dwork and Naor. The idea presented in our paper is as follows: the prover has to provide a convincing evidence that he had communicated with other, randomly chosen entity. This approach is essentially different from previous proofs-of-work, because fulfilling this requirement does not depend on resources owned by the prover (e.g. sender) only. Thanks to this, even if the adversary (e.g. spammer) has an access to much more efficient computers, he does not have any important advantage over regular, honest users of the system. We also demonstrate some other applications of the presented idea as well as some extensions based on its combination with regular proofs-of-work. Together with algorithms we also briefly describe a proof of our concept i.e. working implementation. We present some experimental data and statistics obtained during tests of our application.
Partially supported by EU within the 6th Framework Programme under contract 001907 (DELIS).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, p. 139. Springer, Heidelberg (1993)
Back, A.: The Hashcash Proof-of-Work Function Network Working Group, INTERNET-DRAFT (2003), http://hashcash.org
Dwork, C., Goldberg, A., Naor, M.: On Memory-Bound Functions for Fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 426–444. Springer, Heidelberg (2003)
Jakobsson, M., Juels, A., Rivest, R.L.: Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking. In: Proceedings of the 11th USENIX Security Symposium, pp. 339–353 (2002)
Spam-o-meter Statistics By Percentage: Spam statistics, http://www.spam-o-meter.com
Serjantov, A., Lewis, S.: Puzzles in P2P Systems. In: 8th CaberNet Radicals Workshop, Corsica (2003)
Mankins, D., Krishnan, R., Boyd, C., Zao, J., Frentz, M.: Mitigating Distributed Denial of Service Attacks with Dynamic Resource Pricing. In: ACSAS 2001. Proceedings of 17th Annual Computer Security Applications Conference (2001)
Franklin, M.K., Malkhi, D.: Auditable Metering with Lightweight Security. In: FC 1997. LNCS, vol. 1318, pp. 151–160. Springer, Heidelberg (1997)
Laurie, B., Clayton, R.: ”Proof-of-Work” Proves Not to Work. In: WEIS 2004. Proceedings of the Workshop on Economics and Information Security (2004), http://www.cl.cam.ac.uk/%7Ernc1/proofwork.pdf
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klonowski, M., Strumiński, T. (2008). Proofs of Communication and Its Application for Fighting Spam. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-77566-9_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77565-2
Online ISBN: 978-3-540-77566-9
eBook Packages: Computer ScienceComputer Science (R0)