EPiC: efficient privacy-preserving counting for MapReduce

被引:5
|
作者
Triet Dang Vo-Huu [1 ]
Blass, Erik-Oliver [2 ]
Noubir, Guevara [1 ]
机构
[1] Northeastern Univ, Boston, MA 02115 USA
[2] Airbus Grp Innovat, D-81663 Munich, Germany
基金
美国国家科学基金会;
关键词
Privacy-preserving; MapReduce; Somewhat homomorphic encryption; FULLY HOMOMORPHIC ENCRYPTION;
D O I
10.1007/s00607-018-0634-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In the face of an untrusted cloud infrastructure, outsourced data needs to be protected. We present EPiC, a practical protocol for the privacy-preserving evaluation of a fundamental operation on data sets: frequency counting. In an encrypted outsourced data set, a cloud user can specify a pattern, and the cloud will count the number of occurrences of this pattern in an oblivious manner. A pattern is expressed as a Boolean formula on the fields of data records and can specify values counting, value comparison, range counting, and conjunctions/disjunctions of field values. We show how a general pattern, defined by a Boolean formula, is arithmetized into a multivariate polynomial and used in EPiC. To increase the performance of the system, we introduce a new privacy-preserving encoding with "somewhat homomorphic" properties. The encoding is highly efficient in our particular counting scenario. Besides a formal analysis where we prove EPiC 's privacy, we also present implementation and evaluation results. We specifically target Google's prominent MapReduce paradigm as offered by major cloud providers. Our evaluation performed both locally and in Amazon's public cloud with up to 1 TByte data sets shows only a modest overhead of compared to non-private counting, attesting to EPiC 's efficiency.
引用
收藏
页码:1265 / 1286
页数:22
相关论文
共 50 条
  • [41] EPPD: Efficient and Privacy-Preserving Proximity Testing with Differential Privacy Techniques
    Huang, Cheng
    Lu, Rongxing
    Zhu, Hui
    Shao, Jun
    Alamer, Abdulrahman
    Lin, Xiaodong
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [42] Efficient privacy-preserving classification construction model with differential privacy technology
    Lin Zhang
    Yan Liu
    Ruchuan Wang
    Xiong Fu
    Qiaomin Lin
    Journal of Systems Engineering and Electronics, 2017, 28 (01) : 170 - 178
  • [43] Efficient privacy-preserving classification construction model with differential privacy technology
    Zhang, Lin
    Liu, Yan
    Wang, Ruchuan
    Fu, Xiong
    Lin, Qiaomin
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2017, 28 (01) : 170 - 178
  • [44] Efficient Privacy-Preserving Recommendations based on Social Graphs
    Wainakh, Aidmar
    Grube, Tim
    Daubert, Joerg
    Muehlhaeuser, Max
    RECSYS 2019: 13TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2019, : 78 - 86
  • [45] Efficient paillier cryptoprocessor for privacy-preserving data mining
    San, Ismail
    At, Nuray
    Yakut, Ibrahim
    Polat, Huseyin
    SECURITY AND COMMUNICATION NETWORKS, 2016, 9 (11) : 1535 - 1546
  • [46] Efficient privacy-preserving decision tree classification protocol
    Ma L.
    Peng J.
    Pei Q.
    Zhu H.
    Tongxin Xuebao/Journal on Communications, 2021, 42 (08): : 80 - 89
  • [47] Efficient and Privacy-Preserving Outsourced Calculation of Rational Numbers
    Liu, Ximeng
    Choo, Kim-Kwang Raymond
    Deng, Robert H.
    Lu, Rongxing
    Weng, Jian
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2018, 15 (01) : 27 - 39
  • [48] An efficient privacy-preserving recommender system in wireless networks
    Luo, Junwei
    Yi, Xun
    Han, Fengling
    Yang, Xuechao
    WIRELESS NETWORKS, 2024, 30 (06) : 4949 - 4960
  • [49] Computing Betweenness Centrality: An Efficient Privacy-Preserving Approach
    Kukkala, Varsha Bhat
    Iyengar, S. R. S.
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2018, 2018, 11124 : 23 - 42
  • [50] Towards Efficient and Privacy-preserving Federated Deep Learning
    Hao, Meng
    Li, Hongwei
    Xu, Guowen
    Liu, Sen
    Yang, Haomiao
    ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,