STSHC: secure and trusted scheme for Hadoop cluster
by Quan Zhou; Daixian Wu; Chunming Tang; Chunming Rong
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 5, No. 1, 2014

Abstract: Hadoop is a distributed big data storage and processing framework hugely adopted in different sectors from online media, education, government and social media to handle the enormous growth of information in their respective domains. However, the core architecture of the solution is based on a trusted cluster. It lacks native methods for protecting sensitive data that cross over enterprises and are exposed or accessed illegally. In the paper, this work aims to construct a secure and trusted scheme for Hadoop cluster (STSHC). Firstly, we review the architecture of Hadoop cluster, and discuss the security risks and security requirements. And then we propose a secure and trusted architecture framework for Hadoop cluster with trusted computing base (TCB). Moreover, some protocols, which are the key management, the node trusted management protocol, the client access management protocol, the node access management protocol and job executing management protocol, are designed in detail. Finally, the security analysis shows that the scheme can efficiently meet the security requirement of Hadoop cluster.

Online publication date:: Sat, 12-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email