Abstract
Because of billions of users, the social network is the best choice for person who has an urgent task which needs enough people to participant or that only a few people are able to solve. Inspired by incentive mechanisms for retrieving information from networked agents and motivating the participation of people in crowdsourcing or human tasking systems, we design a paid message forwarding scheme based on social network so that the task will be known to capable persons in a short time. In our scheme, each participant helps solving the task directly or forwards the message he has received. Both kinds of contribution will bring a reward. Additionally, we use Elliptic Curve Digital Signature Algorithm to make the real contribution of participants known to who will pay the reward. Our scheme is shown sybil-proof, incentive compatible, efficient and is proved secure with the assumption that Elliptic Curve Digital Signature Algorithm is safe.
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
References
Babaioff, M., Dobzinski, S., Oren, S., Zohar, A.: On bitcoin and red balloons. ACM SIGECOM Exchanges 10(3), 56–73 (2011)
Buterin, V., et al.: A next-generation smart contract and decentralized application platform
Cebrian, M., Coviello, L., Vattani, A., Voulgaris, P.: Finding red balloons with split contracts: robustness to individuals’ selfishness. In: Forty-fourth Acm Symposium on Theory of Computing (2012)
Chen, W., Wang, Y., Yu, D., Zhang, L.: Sybil-proof mechanisms in query incentive networks. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 197–214 (2013)
Douceur, J.R.: The sybil attack. In: Peer-to-peer Systems. In: First International Workshop, Iptps, Cambridge, MA, USA, March, Revised Papers (2002)
Douceur, J.R., Moscibroda, T.: Lottery trees: motivational deployment of networked systems. ACM SIGCOMM Comput. Commun. Rev. 37(4), 121–132 (2007)
Emek, Y., Karidi, R., Tennenholtz, M., Zohar, A.: Mechanisms for multi level marketing. In: EC 2011: Proceedings of the 12th ACM Conference on Electronic Commerce. ACM (January 2011). https://www.microsoft.com/en-us/research/publication/mechanisms-for-multi-level-marketing/
Johnson, D., Menezes, A., Vanstone, S.: The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 1(1), 36–63 (2001)
Kleinberg, J., Raghavan, P.: Query incentive networks. In: 2005 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005 (2005)
Lv, Y., Moscibroda, T.: Incentive networks. ACM SIGARCH Comput. Architect. News 38(3), 106–116 (2015)
Lv, Y., Moscibroda, T.: Fair and resilient incentive tree mechanisms. Distrib. Comput. 29(1), 1–16 (2016)
Pickard, G., et al.: Time-critical social mobilization. Science 334(6055), 509–512 (2011)
Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-68339-9_33
Acknowledgement
This paper is supported by the National Key R&D Program of China through project 2017YFB0802500, by the National Cryptography Development Fund through project MMJJ20170106, by the foundation of Science and Technology on Information Assurance Laboratory through project 61421120305162112006, the Natural Science Foundation of China through projects 61972019, 61932011, 61772538, 61672083, 61532021, 61472429, 91646203 and 61402029.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Geng, Y., Qin, B., Shi, W., Wu, Q. (2021). A Paid Message Forwarding Scheme Based on Social Network. In: Wu, Y., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2020. Lecture Notes in Computer Science(), vol 12612. Springer, Cham. https://doi.org/10.1007/978-3-030-71852-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-71852-7_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-71851-0
Online ISBN: 978-3-030-71852-7
eBook Packages: Computer ScienceComputer Science (R0)