Name
Abstract | ||
|---|---|---|
Computation integrity is difficult to verify when mass data processing is outsourced. Current integrity protection mechanisms and policies verify results generated by participating nodes within a computing environment of service providers (SP), which cannot prevent the subjective cheating of SPs. This paper provides an analysis and modeling of computation integrity for mass data processing services. A third-party sampling-result verification method, named TS-TRV, is proposed to prevent lazy cheating by SPs. TS-TRV is a general solution of verification on the intermediate results of common Map Reduce jobs, and it utilizes the powerful computing capability of SPs to support verification computing, thus lessening the computing and transmission burdens of the verifier. Theoretical analysis indicates that TS-TRV is effective on detecting the incorrect results with no false positivity and almost no false negativity, while ensuring the authenticity of sampling. Intensive experiments show that the cheating detection rate of TS-TRV achieves over 99% with only a few samples needed, the computation overhead is mainly on the SP, while the network transmission overhead of TS-TRV is only O(log N). |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1587/transcom.E97.B.19 | IEICE TRANSACTIONS ON COMMUNICATIONS |
Keywords | Field | DocType |
result verification, mass data processing, MapReduce, trusted sampling, Merkle tree | Data processing,Computer science,Computer network,Direct Anonymous Attestation,Merkle tree | Journal |
Volume | Issue | ISSN |
E97B | 1 | 0916-8516 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yan Ding | 1 | 5 | 4.46 |
| Wang Huaimin | 2 | 1025 | 121.31 |
| Peichang Shi | 3 | 38 | 17.48 |
| Hongyi Fu | 4 | 68 | 12.50 |
| Xinhai Xu | 5 | 22 | 7.73 |