Learning Without Peeking: Secure Multi-party Computation Genetic Programming

被引:1
|
作者
Kim, Jinhan [1 ]
Epitropakis, Michael G. [2 ]
Yoo, Shin [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Sch Comp, Daejeon, South Korea
[2] Univ Lancaster, Dept Management Sci, Lancaster, England
基金
新加坡国家研究基金会;
关键词
ALGORITHMS;
D O I
10.1007/978-3-319-99241-9_13
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Genetic Programming is widely used to build predictive models for defect proneness or development efforts. The predictive modelling often depends on the use of sensitive data, related to past faults or internal resources, as training data. We envision a scenario in which revealing the training data constitutes a violation of privacy. To ensure organisational privacy in such a scenario, we propose SMCGP, a method that performs Genetic Programming as Secure Multiparty Computation. In SMCGP, one party uses GP to learn a model of training data provided by another party, without actually knowing each datapoint in the training data. We present an SMCGP approach based on the garbled circuit protocol, which is evaluated using two problem sets: a widely studied symbolic regression benchmark, and a GP-based fault localisation technique with real world fault data from Defects4J benchmark. The results suggest that SMCGP can be equally accurate as the normal GP, but the cost of keeping the training data hidden can be about three orders of magnitude slower execution.
引用
收藏
页码:246 / 261
页数:16
相关论文
共 50 条
  • [41] Round-Optimal Secure Multi-party Computation
    Halevi, Shai
    Hazay, Carmit
    Polychroniadou, Antigoni
    Venkitasubramaniam, Muthuramakrishnan
    JOURNAL OF CRYPTOLOGY, 2021, 34 (03)
  • [42] Secure Multi-party Computation of Differentially Private Median
    Bohler, Jonas
    Kerschbaum, Florian
    PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, 2020, : 2147 - 2164
  • [43] Conclave: secure multi-party computation on big data
    Volgushev, Nikolaj
    Schwarzkopf, Matte
    Ben Getchell
    Varia, Mayank
    Lapets, Andrei
    Bestavros, Azer
    PROCEEDINGS OF THE FOURTEENTH EUROSYS CONFERENCE 2019 (EUROSYS '19), 2019,
  • [44] Secure Multi-Party Computation Using Polarizing Cards
    Shinagawa, Kazumasa
    Mizuki, Takaaki
    Schuldt, Jacob
    Nuida, Koji
    Kanayama, Naoki
    Nishide, Takashi
    Hanaoka, Goichiro
    Okamoto, Eiji
    ADVANCES IN INFORMATION AND COMPUTER SECURITY (IWSEC 2015), 2015, 9241 : 281 - 297
  • [45] Secure Multi-party Computation Minimizing Online Rounds
    Choi, Seung Geol
    Elbaz, Ariel
    Malkin, Tal
    Yung, Moti
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2009, 2009, 5912 : 268 - 286
  • [46] SECURE MULTI-PARTY QUANTUM CONFERENCE AND XOR COMPUTATION
    Das, Nayana
    Paul, Goutam
    QUANTUM INFORMATION & COMPUTATION, 2021, 21 (3-4) : 203 - 232
  • [47] Efficient secure multi-party computation - (Extended abstract)
    Hirt, M
    Maurer, U
    Przydatek, B
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2000, PROCEEDINGS, 2000, 1976 : 143 - 161
  • [48] Secure Key Management for Multi-Party Computation in MOZAIK
    Marque, Enzo
    Moeyersons, Jerico
    Pohle, Erik
    Van Kenhove, Michiel
    Abidin, Aysajan
    Volckaert, Bruno
    2023 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY WORKSHOPS, EUROS&PW, 2023, : 133 - 140
  • [49] Fair and Secure Multi-Party Computation with Cheater Detection
    Seo, Minhye
    CRYPTOGRAPHY, 2021, 5 (03)
  • [50] Recent Advances in Practical Secure Multi-Party Computation
    Ohata, Satsuya
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (10) : 1134 - 1141