<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JIS</journal-id><journal-title-group><journal-title>Journal of Information Security</journal-title></journal-title-group><issn pub-type="epub">2153-1234</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jis.2016.73007</article-id><article-id pub-id-type="publisher-id">JIS-65305</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Trusted Heartbeat Framework for Cloud Computing
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>ipen</surname><given-names>Contractor</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Dhiren</surname><given-names>Patel</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Shreya</surname><given-names>Patel</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Computer Engineering, NIT, Surat, India</addr-line></aff><aff id="aff2"><addr-line>Department of Computer Engineering, CKPCET, Surat, India</addr-line></aff><pub-date pub-type="epub"><day>01</day><month>04</month><year>2016</year></pub-date><volume>07</volume><issue>03</issue><fpage>103</fpage><lpage>111</lpage><history><date date-type="received"><day>26</day>	<month>November</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>29</month>	<year>March</year>	</date><date date-type="accepted"><day>1</day>	<month>April</month>	<year>2016</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In cloud computing environment, as the infrastructure not owned by users, it is desirable that its security and integrity must be protected and verified time to time. In Hadoop based scalable computing setup, malfunctioning nodes generate wrong output during the run time. To detect such nodes, we create collaborative network between worker node (
  i.e
  . data node of Hadoop) and Master node (
  i.e
  . name node of Hadoop) with the help of trusted heartbeat framework (THF). We propose procedures to register node and to alter status of node based on reputation provided by other co-worker nodes.
 
</p></abstract><kwd-group><kwd>Trusted Heartbeat</kwd><kwd> Cloud Computing</kwd><kwd> Hadoop Framework</kwd><kwd> Reputation</kwd><kwd> Attestation</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Outsourcing computation to cloud can reduce IT expenditure spent by companies. Still, most of them are not willing to do so, due to security concerns with cloud computing environment and services. As per survey [<xref ref-type="bibr" rid="scirp.65305-ref1">1</xref>] , it is found that despite of huge benefits, fear is still there about security threats like loss of control of data and integrity of systems. Computing nodes (virtual machines) can be tampered with or ill configured to produce wrong results. E.g. Assigned Hadoop task (related to financial data consolidations) may generate incorrect result due to few malfunctioning nodes [<xref ref-type="bibr" rid="scirp.65305-ref2">2</xref>] . Due the large size of data and its processing, the error is very hard to identify in collective results, and it may result in huge loss.</p>Malfunctioning Nodes and Infrastructure Attacks<p>In a public cloud infrastructure, malfunctioning nodes may infringe security requirements specified by service consumer. They may produce malicious outputs, which may violate the privacy and integrity ofcomputation. This may result in disclosure of users’ confidential data, and profile users’ behaviors (and preferences) for privacy analysis. Moreover, software flaws, bugs and mis-configurations can lead to incorrect results or un- intended information leakage.</p><p>Malicious or tempered nodes may eavesdrop the communication between other nodes, in order to disclose confidential data, enforce malicious privacy profiling [<xref ref-type="bibr" rid="scirp.65305-ref3">3</xref>] , launch replay attacks [<xref ref-type="bibr" rid="scirp.65305-ref3">3</xref>] , and Man-In-the-Middle attacks [<xref ref-type="bibr" rid="scirp.65305-ref2">2</xref>] [<xref ref-type="bibr" rid="scirp.65305-ref4">4</xref>] in the cloud system. They may also impersonate the Master to steal other node’s data, or vice versa. Moreover, malicious node can launch Denial of Service attacks [<xref ref-type="bibr" rid="scirp.65305-ref5">5</xref>] . Growing number of vulnerabilities uncovered in cloud platform has prompted the move towards implementing trust based solutions incorporated with hardware support. The Trusted Computing’s (TC) [<xref ref-type="bibr" rid="scirp.65305-ref6">6</xref>] initiative and adoption of trusted platform module (TPM) [<xref ref-type="bibr" rid="scirp.65305-ref7">7</xref>] has been gaining attestion from industry as well as acadamic. Hardware manufacturer is also participating to accelerate the adoption of TC across varios platform.</p><p>We consider a cloud system, which takes a user task, distributes among computing nodes, and gathers its output as shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>. We propose a framework for integrity verification of cloud. We use three proce- dure viz: for registration, for verification and for detection of virtual machine. TPM based node registration process will initially establish trust. Attested heartbeat procedure periodically verifies the trustworthiness of every node in the system. Tampered or misconfigured nodes can be identified quickly by reputation based decision procedure.</p><p>Rest of the paper is organized as follows: In Section 2, we discuss background and related work on Heartbeats and TPM. In section 3, we propose the Trusted Heartbeat infrastructure. Section 4 shows usage model of proposed framework with conclusion and references at the end.</p></sec><sec id="s2"><title>2. Background and Related Work</title><sec id="s2_1"><title>2.1. Hadoop</title><p>Apache Hadoop [<xref ref-type="bibr" rid="scirp.65305-ref8">8</xref>] is framework that facilitates the data intensive distributed processing of massive data sets across clusters machines. It supports extension of processes from a single to thousands of machines. Designed with a fundamental assumption that hardware failure is common, making it the software’s responsibility to identify and handle failures at the application layer. It replicates data across multiple nodes with rapid data transfer facility. Hadoop implementation essentially consists of two major components: (i) Hadoop Distributed File System (HDFS) [<xref ref-type="bibr" rid="scirp.65305-ref9">9</xref>] : A file system that manages all the nodes in a cluster for data storage, and (ii) Map- Reduce [<xref ref-type="bibr" rid="scirp.65305-ref10">10</xref>] : The framework that allocate work to nodes in a cluster. Hadoop Cluster can be designed in various ways. One of which includes a single master and multiple worker nodes. The master node consists of a Job- Tracker, TaskTracker, NameNode and DataNode. A worker node acts as both a DataNode and TaskTracker, it depends on avalability of physical or virtual resources (<xref ref-type="fig" rid="fig2">Figure 2</xref>).</p></sec><sec id="s2_2"><title>2.2. Heartbeat in Hadoop Environment</title><p>Heartbeat [<xref ref-type="bibr" rid="scirp.65305-ref11">11</xref>] is a communication mechanism that provides a efficient; yet simple way for a Hadoop system to monitor performance and make that information available to external observers. Applications can use heartbeat</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Cloud computing scenario</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x6.png"/></fig><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Hadoop cluster adopted from [<xref ref-type="bibr" rid="scirp.65305-ref10">10</xref>] </title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x7.png"/></fig><p>information to automatically add or subtract resources from their pool. HDFS replicates file blocks for fault tolerance. An application can specify the number of replicas of a file at the time it is created. The NameNode makes all decisions concerning block replication. Each DataNode sends heartbeat messages timely to its NameNode, so the later can identify loss of connectivity if it stops receiving these messages. The NameNode marks such node as dead DataNode (not responding to heartbeats) and desists from sending requests to it. Data stored on such node is no longer available to a client (<xref ref-type="fig" rid="fig3">Figure 3</xref>).</p></sec><sec id="s2_3"><title>2.3. Trusted Platform Module (TPM)</title><p>The trusted computing group consortium has developed specifications for the trusted platform module. The TPM is a special purpose microcontroller on a motherboard. By incorporating a physical facility for secure generation and storage of cryptographic keys, the TPM becomes the core supporter for creating an interoperable “trusted computing” environment. These capabilities that every TPM provides include hashing by SHA-1 algorith, random number generation, asymmetric key generation as well as encryption and decryption by RSA algorithm. Following in <xref ref-type="table" rid="table1">Table 1</xref>; is the list of different types of keys can be created with TPM with their properties.</p><p>Integrity verification of the software components to support mitigation of security concerns related to cloud computing infrastructure. Though, it does not actually provide absolute assurance, trusted computing improves the complexity for attackers by operating at hardware level. With a correct implementation, an attacker would need physical access to the hardware in order to subvert the TPM [<xref ref-type="bibr" rid="scirp.65305-ref13">13</xref>] . In our proposed work, we use TPM to prevent Man-In-The-Middle attack and verify the integrity of Virtual machine via attestation.</p></sec><sec id="s2_4"><title>2.4. Related Work</title><p>There have been many attempts to enhance the fault tolerance and trust based mechanisms to preserve integrity of cloud system in open distributed environment [<xref ref-type="bibr" rid="scirp.65305-ref14">14</xref>] . For sensitive data in open distributed systems, Airavat [<xref ref-type="bibr" rid="scirp.65305-ref15">15</xref>] is developed. It incorporates mandatory access control to detect privacy violation. Verification-based Integrity Assurance Framework [<xref ref-type="bibr" rid="scirp.65305-ref16">16</xref>] is based on the idea of replication and quiz related methods. It can detect malicious and normal task trackers in Hadoop system with the help of predefined set of questionnaires. Authors in article [<xref ref-type="bibr" rid="scirp.65305-ref17">17</xref>] , proposed algorithm named Longest Approximate Time to End (LATE). LATE finds the slow tasks in a homogeneous environment. LATE first estimates the remaining time for each tasks, then assigns the speculative tasks for those with the longest remaining time to end and maintains integrity of the system. Terra [<xref ref-type="bibr" rid="scirp.65305-ref18">18</xref>] provides an attestation ability that allows a remote party to reliably detect whether the host is running a platform that the remote party trusts. As elaborated by Bercher et al. [<xref ref-type="bibr" rid="scirp.65305-ref19">19</xref>] , for encrypted communication between all the nodes in the HDFS system, a key must be securely exchanged in advance. However, there are issues with how the key is shared. As seen in [<xref ref-type="bibr" rid="scirp.65305-ref20">20</xref>] ; key exchange is done frequently by heartbeat messages and attacker can pretend to be a data node and can many chunks of data.</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Heartbeat in Hadoop environment adopted from [<xref ref-type="bibr" rid="scirp.65305-ref12">12</xref>] </title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x8.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> TPM Key types with their pupose [<xref ref-type="bibr" rid="scirp.65305-ref7">7</xref>] </title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Key Name</th><th align="center" valign="middle" >Purpose</th></tr></thead><tr><td align="center" valign="middle" >Endorsement Key (EK)</td><td align="center" valign="middle" >A key-pair based on RSA algorithm; imposed by TPM manufacturer to identify uniquely TPM.</td></tr><tr><td align="center" valign="middle" >Storage Root Key (SRK)</td><td align="center" valign="middle" >A non-transferable key generated by the platform owner to serve as the root key in the hierarchy of keys associated with the TPM.</td></tr><tr><td align="center" valign="middle" >Attestation Identity Key (AIK)</td><td align="center" valign="middle" >Used for attestation and identification of a TPM (i.e. activated mode). Trusted third party can create identity certificate by signing public key part of AIK.</td></tr><tr><td align="center" valign="middle" >Signing Key</td><td align="center" valign="middle" >Used by the system to sign messages.</td></tr><tr><td align="center" valign="middle" >Storage Key</td><td align="center" valign="middle" >Used to encrypt and decrypt other keys. (using RSA)</td></tr><tr><td align="center" valign="middle" >Identity Key</td><td align="center" valign="middle" >Used for operations that requires TPM identity.</td></tr><tr><td align="center" valign="middle" >Binding Key</td><td align="center" valign="middle" >Used for Unbind operations to decrypt a data.</td></tr></tbody></table></table-wrap><p>We propose a scheme to determine whether a particular VM is trustworthy or not. Only attested and trusted VMs can get the tasks and collaborate in network. Negative reputation is assigned if node does not generate output (or produce malicious output).</p></sec></sec><sec id="s3"><title>3. Trusted Heartbeat Framework</title><p>In this framework, we assume TPM communication cannot temper, and storage is not exposed. The main intention of TPM is to repel most of the attacks on the software, we presume that trusted platform can assess each and every software module loaded on platform in terms of hash code [<xref ref-type="bibr" rid="scirp.65305-ref7">7</xref>] . In addition, we assume Master node works as a trusted party which performs attestations as suggested by TC [<xref ref-type="bibr" rid="scirp.65305-ref21">21</xref>] . For better understanding of our framework, we denote job tracker as a master node and task tracker as simple node. Proposed framework is as shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>. The Task scheduler present at every node executes tasks assign to them. Trust collector is attached to each node to manage assessments and support the attestation service. In master node, the task scheduler deploys jobs to nodes and collects their outcomes. Task manager stores node information and their assign task information. In addition, trust and reputation collector manages the trust information of nodes, and Trust Verifier performs attestations to them. The collected security properties (Endorsement Key and Attestation Identity Key) are stored in the Trust storage.</p><p>Trust manger binds evidence generated with accordance to TC’s notation as trusted data. Moreover, users can get such information to assess the security properties of the worker node at any time, for the entire processing cycle. The Trust &amp; reputation collector collects such properties of nodes and stores them with corresponding values. These values are kept in the trust storage for future score calculation. Following are the three main procedures for our proposed system.</p><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Architecture of trusted heartbeat framework</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x9.png"/></fig><p>(a) Initial Node Registration</p><p>Initially, when a data node joins a network, node registration takes place. It identifies a genuineness of TPM and exchanges keys for sealing and binding operations. The genuineness of TPM is identified by its public EK key.</p><p>Every time a worker node initiate connection request to the master node, an initial attestation procedure will be executed by master node. Verifier has collected all the properties of each node whose information is stored at the storage. Therefore, only registered node with allowed properties will be included to the list of the task Manager (for completing tasks). TC credentials and public session keys are stored at trust storage.</p><p>In Trusted Heartbeat framework, every node (N) is identified with its corresponding and unique AIK, and the Master (M) facilitates as the Privacy-CA defined by TC infrastructure [<xref ref-type="bibr" rid="scirp.65305-ref22">22</xref>] , for registering and identifying all these AIKs. Whenever a new node is included to the Hadoop based cloud system, it is first get registered at the Master and assigned with AIK key credentials. <xref ref-type="fig" rid="fig5">Figure 5</xref> shows steps for node registration. As suggested earlier, only registered node can communicate with master and can get tasks with genuine TC credentials. Node registration procedure is more elaborated in <xref ref-type="fig" rid="fig6">Figure 6</xref>. In our Trusted Heartbeat framework implementation, the Trust &amp; Reputation Collector is added to Master node and Trust collector to every node. Their exchanged messages are incorporated into the heartbeat protocol via Heartbeat manager. To simplify our protocol, we assign manually AIK credentials to node.</p><p>Time to time collector and trust storage updates the nonce information, and initiate the attestation procedure by invoking the TPM Quote from TPM instruction with the fresh nonce. As shown in <xref ref-type="fig" rid="fig9">Figure 9</xref>(a), latest generated nonce and reputation is then added to the request and sent to the Master. The verifier collects and maintains the public credentials of individual nodes. When a request in heartbeat message; with genuine AIK credentials is received, verifier will first perform verification followed by registration of that node. The properties indicated from the worker node’s Stored Message Logs (SML) are inspected with security policies which are defined earlier and stored in Trust storage (shown in <xref ref-type="fig" rid="fig9">Figure 9</xref>(c)), and only the expected worker node can be added in future. As shown in node registration procedure (<xref ref-type="fig" rid="fig6">Figure 6</xref>), Trust verifier maintains nonce information in a cache (i.e. for faster execution) and revise cache value by execution the SHA-1 hash operation to get the new value. Time interval between each received messages and the stored information of the cache together determines the longer time for a heartbeat to be valid (<xref ref-type="fig" rid="fig7">Figure 7</xref>).</p><p>(b) Verification of Heartbeats</p><p>The verifier from trust and reputation collector is invoked each time, when a heartbeat message with attestation request reaches to the master node. It examines the nonce value in the cache; received through recent heartbeat (last_nonce) message. If verifier does not find that nonce value, it invalidates the connection request through heartbeat message. Once more when worker node sends heartbeat message with valid new_nonce, it can continues to communicate the master and get the task. The trust verifier can verifies the received signature and quote of PCR values using the TPM_Verify [<xref ref-type="bibr" rid="scirp.65305-ref7">7</xref>] set of instructions of TPM. If the verifier finds any mismatch in hash value, it will put that node to gray list and that node has to again start with node initialization procedure (As shown in <xref ref-type="fig" rid="fig9">Figure 9</xref>). Difference in PCR values shows variation in node software status, therefore a new assessment requires to be initiated. After successful completion of verification, the new worker node’s assessment information is updated for further communication.</p><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Node registration procedure</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x10.png"/></fig><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Step by step node registration procedure</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x11.png"/></fig><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Verifying heartbeat procedure</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x12.png"/></fig><p>(c) Reputation based detection</p><p>Reputations are gathered with each Heartbeat message received from Master. Calculated reputations, which are lower than a pre-defined threshold, master node, will unregister that node or mark it as a lost one. The threshold value can be computed based on the number of nodes and previously stored information available at trust storage. The Black list is one that contains a list of all such failed nodes. Similarly, Gray list is one that contains a probable list of nodes that have faced some decrements in reputations (<xref ref-type="fig" rid="fig8">Figure 8</xref>). Every susceptible node comes in Graylist first and then after inactivity it will be in Blacklist (shown in <xref ref-type="fig" rid="fig9">Figure 9</xref>(d)). Since reputations</p><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> Procedure for reputation based decision</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x13.png"/></fig><fig id="fig9"  position="float"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> Working of our framework</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-7800336x14.png"/></fig><p>are collected in same cluster only, detecting a failed or malicious node is faster compared to collecting all reputations from all the nodes as depicted in Reputation based decision procedure.</p><p>A worker node can receive its reputation or penalties through heartbeat messages. Master node increases reputation of a worker node each time when it gets heartbeat messages with hash values. The Trust &amp; reputation based detector has a upper bound for the maximum reputation, After reaching that value, initialization process begins. However, when node comes in graylist then it starts receiving penalties if it does not reply.</p><p><xref ref-type="fig" rid="fig9">Figure 9</xref> shows general step by step working of Trust and Reputation Collector with the procedures. All tasks performed by the Master node are indicated in it.</p></sec><sec id="s4"><title>4. Conclusion</title><p>In this paper, we propose Trusted Heartbeat framework; that creates a collaborative network among virtual machines. With remote attestations and heartbeat messages, a Master node can define the exact status (working or malfunctioning) of its nodes. This proposed framework identifies the genuine worker node using trusted computing facilities. Heartbeat interval time is very important parameter in our system. Trust and reputation based detector improve Hadoop like distributed systems in detecting malicious nodes quickly. This framework shows utilization of common messages to establish trust among all the corresponding nodes in distributed environment.</p></sec><sec id="s5"><title>Cite this paper</title><p>Dipen Contractor,Dhiren Patel,Shreya Patel, (2016) Trusted Heartbeat Framework for Cloud Computing. Journal of Information Security,07,103-111. doi: 10.4236/jis.2016.73007</p></sec></body><back><ref-list><title>References</title><ref id="scirp.65305-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">(2012) What’s Holding Back the Cloud. http://www.intel.in/content/dam/www/public/us/en/documents/reports/whats-holding-back-the-cloud-peer-research-report2.pdf</mixed-citation></ref><ref id="scirp.65305-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Khan, S.M. and Hamlen, K.W. (2012) Hatman: Intra-Cloud Trust Management for Hadoop. CLOUD’12: Proceedings of 5th International Conference on Cloud Computing, Honolulu, 24-29 June 2012, 494-501. http://dx.doi.org/10.1109/cloud.2012.64</mixed-citation></ref><ref id="scirp.65305-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Feng, J., Chen, Y., Ku, W. and Liu, P. (2010) Analysis of Integrity Vulnerabilities and a Non-Repudiation Protocol for Cloud Data Storage Platforms. ICPPW’10: Proceedings of 39th International Conference on Parallel Processing Workshops, San Diego, 13-16 September 2010, 1-8. http://dx.doi.org/10.1109/icppw.2010.42</mixed-citation></ref><ref id="scirp.65305-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Sujitha, G., Varadharajan, M., Rao, Y.V., Sridev, R., Gauthaum, M.K.S., Narayanan, S., Raja, R.S. and Shalinie, S.M. (2013) Improving Security of Parallel Algorithm Using Key Encryption Technique. Information Technology Journal, 12, 2398. http://dx.doi.org/10.3923/itj.2013.2398.2404</mixed-citation></ref><ref id="scirp.65305-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Contractor, D. and Patel, D. (2012) Trust Management Framework for Attenuation of Application Layer DDoS Attack in Cloud Computing. IFIPTM 2012: 6th IFIP WG 11.11 International Conference on Trust Management, 374, 201-208. http://dx.doi.org/10.1007/978-3-642-29852-3_14</mixed-citation></ref><ref id="scirp.65305-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Futral, W. and Greene, J. (2013) Introduction to Trust and Intel Trusted Execution Technology. Intel Trusted Execution Technology for Server Platforms, 1-14.</mixed-citation></ref><ref id="scirp.65305-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">TPM Software Stack (TSS) Specification, Version 1.2. http://www.trustedcomputinggroup.org/resources/tcg_software_stack_specification_tss_12_faq</mixed-citation></ref><ref id="scirp.65305-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">White, T. (2012) Hadoop: The Definitive Guide. O’Reilly.</mixed-citation></ref><ref id="scirp.65305-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Dean, J. and Ghemawat, S. (2008) MapReduce: Simplified Data Processing on Large Clusters. Communications of the ACM, 51, 107-113. http://dx.doi.org/10.1145/1327452.1327492</mixed-citation></ref><ref id="scirp.65305-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Borthakur, D. (2007) The Hadoop Distributed File System: Architecture and Design. In hadoop.apache.org, 2007.http://hadoop.apache.org/docs/r0.18.0/hdfs_design.pdf</mixed-citation></ref><ref id="scirp.65305-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Hoffmann, H., Eastep, J., Santambrogio, M.D., Miller, J.E. and Agarwal, A. (2010) Application Heartbeats for Software Performance and Health. ACM Sigplan Notices, 45, 347-348. http://dx.doi.org/10.1145/1837853.1693507</mixed-citation></ref><ref id="scirp.65305-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Hanson, J. (2011) Hadoop Heartbeat. http://www.ibm.com/developerworks/library/wa-introhdfs/</mixed-citation></ref><ref id="scirp.65305-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Krautheim, F.J., Phatak, D.S. and Sherman, A.T. (2010) Introducing the Trusted Virtual Environment Module: A New Mechanism for Rooting Trust in Cloud Computing. TRUST ’10: Proceedings of 3rd International Conference on Trust and Trustworthy Computing, Berlin, 21-23 June 2010, 211-227. http://dx.doi.org/10.1007/978-3-642-13869-0_14</mixed-citation></ref><ref id="scirp.65305-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Scales, D.J., Nelson, M. and Venkitachalam, G. (2010) The Design of a Practical System for Fault-Tolerant Virtual Machines. ACM SIGOPS Operating Systems Review, 44, 30-39. http://dx.doi.org/10.1145/1899928.1899932</mixed-citation></ref><ref id="scirp.65305-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Roy, I., Setty, S.T.V., Kilzer, A., Shmatikov, V. and Witchel, E. (2010) Airavat: Security and Privacy for MapReduce. Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 10, 297-312.</mixed-citation></ref><ref id="scirp.65305-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Wang, Y. and Wei, J. (2011) VIAF: Verification-Based Integrity Assurance Framework for MapReduce. CLOUD’11: Proceedings of IEEE International Conference on Cloud Computing, Washington DC, 4-9 July 2011, 300-307. http://dx.doi.org/10.1109/cloud.2011.33</mixed-citation></ref><ref id="scirp.65305-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Zaharia, M., Konwinski, A., Joseph, A.D., Katz, R.H. and Stoica, I. (2008) Improving MapReduce Performance in Heterogeneous Environments. OSDI, 8, 7.</mixed-citation></ref><ref id="scirp.65305-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Garfinkel, T., Pfaff, B., Chow, J., Rosenblum, M. and Boneh, D. (2003) Terra: A Virtual Machine-Based Platform for Trusted Computing. SIGOPS Operating System Review, 37, 193-206. http://dx.doi.org/10.1145/1165389.945464</mixed-citation></ref><ref id="scirp.65305-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Becherer, A. (2010) Hadoop Security Design Just Add Kerberos? Really. iSEC PARTNER, 1-10.</mixed-citation></ref><ref id="scirp.65305-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Devi, S. and Kamaraj, K. (2014) Architecture for Hadoop Distributed File Systems. International Journal of Enhanced Research in Management &amp; Computer Applications, 3, 13-19.</mixed-citation></ref><ref id="scirp.65305-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Ko, S.Y., Hoque, I., Cho, B. and Gupta, I. (2010) Making Cloud Intermediate Data Fault-Tolerant. Proceedings of the 1st ACM Symposium on Cloud Computing, Indianapolis, 2010, 181-192. http://dx.doi.org/10.1145/1807128.1807160</mixed-citation></ref><ref id="scirp.65305-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Schiffman, J., Moyer, T., Vijayakumar, H., Jaeger, T. and McDaniel, P. (2010) Seeding Clouds with Trust Anchors. Proceedings of the 2010 ACM Workshop on Cloud Computing Security Workshop, Chicago, 2010, 43-46.</mixed-citation></ref></ref-list></back></article>