A Result Verification Scheme for MapReduce Having Untrusted Participants

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 321)

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.

Keywords

Mobile Agent Master Node Cheat Behavior Desktop Grid Hadoop Distribute File System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)CrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Sarmenta, L.F.G.: Sabotage-tolerance mechanisms for volunteer computing systems. Future Generation Computer Systems 18(4), 561–572 (2002)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Golle, P., Mironov, I.: Uncheatable distributed computations. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 425–440. Springer, Heidelberg (2001)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Xiao, Z., Xiao, Y.: Accountable MapReduce in cloud computing. In: SCNC 2011 (2011)Google Scholar
  13. 13.
  14. 14.
    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)Google Scholar
  15. 15.
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.BT Kumaon Institute of TechnologyDwarahatIndia

Personalised recommendations