Practical Verifiable Computation-A MapReduce Case Study

被引:6
|
作者
Wang, Yongzhi [1 ,2 ]
Shen, Yulong [1 ]
Jiang, Xiaohong [1 ,3 ]
机构
[1] Xidian Univ, Sch Comp Sci & Technol, Xian 710071, Shaanxi, Peoples R China
[2] Henan Univ Technol, Minist Educ, Key Lab Grain Informat Proc & Control, Zhengzhou 450066, Henan, Peoples R China
[3] Future Univ Hakodate, Sch Syst Informat Sci, Hakodate, Hokkaido 0418655, Japan
基金
中国国家自然科学基金;
关键词
Runtime integrity; remote verification; cloud computing; mapreduce;
D O I
10.1109/TIFS.2017.2787993
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Public cloud vendors have been offering a variety of big data computing services on their clouds. However, runtime integrity is one of the major security concerns that hinder the wide adoption of those services. In this paper, we focus on MapReduce, a popular big data computing framework, and propose the runtime integrity audition (RIA), a solution that remotely verifies the runtime integrity of MapReduce applications. RIA records the runtime variable values of the MapReduce application on the public cloud and checks those values against the application's code on the private cloud. By doing so, RIA protects the runtime integrity of MapReduce applications. Based on the idea of RIA, we developed a prototype system, called MR Auditor, and tested its applicability and performance with several Hadoop applications. Our experimental results showed that MR Auditor is a general tool that can efficiently audit the runtime integrity of all the MapReduce applications that we tested. In addition, MR Auditor incurs a moderate performance overhead. For example, when verifying the Word Count application, a proper parameter setting of MR Auditor incurs 1% of extra execution time on the public cloud and 14% of extra execution time on the private cloud.
引用
收藏
页码:1376 / 1391
页数:16
相关论文
共 50 条
  • [1] Interactive design computation-a case study on quantum design paradigm
    Feng, Han
    [J]. FRONTIERS OF ARCHITECTURAL RESEARCH, 2013, 2 (02) : 252 - 262
  • [2] Pinocchio: Nearly Practical Verifiable Computation
    Parno, Bryan
    Howell, Jon
    Gentry, Craig
    Raykova, Mariana
    [J]. COMMUNICATIONS OF THE ACM, 2016, 59 (02) : 103 - 112
  • [3] Pinocchio: Nearly Practical Verifiable Computation
    Parno, Bryan
    Howell, Jon
    Gentry, Craig
    Raykova, Mariana
    [J]. 2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2013, : 238 - 252
  • [4] AssureMR: Verifiable SQL Execution on MapReduce
    Zhang, Bo
    Dong, Boxiang
    Wang, Wendy Hui
    [J]. 2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2018, : 1228 - 1231
  • [5] Dynamic optimization based on quantum computation-A comprehensive review
    Kou, Haijiang
    Zhang, Yaowen
    Lee, Heow Pueh
    [J]. COMPUTERS & STRUCTURES, 2024, 292
  • [6] Practical Verifiable Computation by Using a Hardware-Based Correct Execution Environment
    Lee, Junghee
    Nicopoulos, Chrysostomos
    Jeong, Gweonho
    Kim, Jihye
    Oh, Hyunok
    [J]. IEEE ACCESS, 2020, 8 : 216689 - 216706
  • [7] A Survey of Verifiable Computation
    Yu, Xixun
    Yan, Zheng
    Vasilakos, Athanasios V.
    [J]. MOBILE NETWORKS & APPLICATIONS, 2017, 22 (03): : 438 - 453
  • [8] A Survey of Verifiable Computation
    Xixun Yu
    Zheng Yan
    Athanasios V. Vasilakos
    [J]. Mobile Networks and Applications, 2017, 22 : 438 - 453
  • [9] A Model of Computation for MapReduce
    Karloff, Howard
    Suri, Siddharth
    Vassilvitskii, Sergei
    [J]. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 938 - 948
  • [10] Hybrid Publicly Verifiable Computation
    Alderman, James
    Janson, Christian
    Cid, Carlos
    Crampton, Jason
    [J]. TOPICS IN CRYPTOLOGY - CT-RSA 2016, 2016, 9610 : 147 - 163