Abstract
MapReduce framework is a widely accepted solution for performing data intensive computations efficiently. The master node prepares the input to be distributed among multiple mappers which distribute the reduced task to the reducers. Reducers perform identical set of computations on the reduced data independently. If any one of the reducers works maliciously and does not produce results as desired by the end-user, a significant error in the final output can be observed. Many other distributed computing platforms also face the same problem due to the malicious participants. The problem for MapReduce must be solved keeping into account the data intensive nature of the computations carried out by MapReduce. MapReduce does not provide any mechanism to detect such Lazy Cheating Attacks by a computation provider. In this paper, we propose a generalized defense to this type of attack on statistical computations. The solution does not involve redundant computations on the data to prove the worker malicious. Implementation results on Hadoop show the detection rate of such cheating behavior by the proposed scheme. The accompanying theoretical analysis proves that the solution does not noticeably affect the timeliness and accuracy of the original service.
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
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)
Zhao, S., Lo, V., Gauthier Dickey, C.G.: Result verification and trust-based scheduling in peer-to-peer grids. In: Fifth IEEE International Conference on, August 31-September 2, pp. 31–38 (2005)
Sarmenta, L.F.G.: Sabotage-tolerance mechanisms for volunteer computing systems. Future Generation Computer Systems 18(4), 561–572 (2002)
Domingues, P., Sousa, B., Silva, L.M.: Sabotage-tolerance and trust management in desktop grid computing. Future Generation Computer Systems 23(7), 904–912 (2007)
Golle, P., Stubblebine, S.G.: Secure distributed computing in a commercial environment. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, p. 279. Springer, Heidelberg (2002)
Golle, P., Mironov, I.: Uncheatable distributed computations. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 425–440. Springer, Heidelberg (2001)
Indrajit, R., Srinath, T.S., Kilzer, A., Shmatikov, V., Witchel, E.: Airavat: Security and Privacy for MapReduce. In: NSDI, vol. 10, pp. 297–312 (2010)
Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol. 1419, pp. 44–60. Springer, Heidelberg (1998)
Wei, W., Du, J., Yu, T., Gu, X.: SecureMR: A Service Integrity Assurance Framework for MapReduce. In: Annual Computer Security Applications Conference, ACSAC 2009, December 7-11, pp. 73–82 (2009)
Zhao, S., Lo, V., Gauthier Dickey, C.: Result verification and trust-based scheduling in peer-to-peer grids. In: Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. IEEE (2005)
Szajda, D., Lawson, B., Owen, J.: Hardening functions for large scale distributed computations. In: Proceedings of the 2003 Symposium on Security and Privacy. IEEE (2003)
Xiao, Z., Xiao, Y.: Accountable MapReduce in cloud computing. In: SCNC 2011 (2011)
Hadoop Tutorial, http://public.yahoo.com/gogate/hadoop-tutorial/start-tutorial.html
Huang, C., Zhu, S., Wu, D.: Towards Trusted Services: Result Verification Schemes for MapReduce. In: 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), May 13-16, pp. 41–48 (2012)
Kroese, D.P., Taimre, T., Botev, Z.I.: Uniform Random Number Generation. In: Handbook of Monte Carlo Methods, ch. 1, p. 772. John Wiley & Sons, New York (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Pareek, G., Goyal, C., Nayal, M. (2015). A Result Verification Scheme for MapReduce Having Untrusted Participants. In: Buyya, R., Thampi, S. (eds) Intelligent Distributed Computing. Advances in Intelligent Systems and Computing, vol 321. Springer, Cham. https://doi.org/10.1007/978-3-319-11227-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-11227-5_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11226-8
Online ISBN: 978-3-319-11227-5
eBook Packages: EngineeringEngineering (R0)