Co-Utile Peer-to-Peer Decentralized Computing

被引:10
作者
Domingo-Ferrer, Josep [1 ]
Blanco-Justicia, Alberto [1 ]
Sanchez, David [1 ]
Jebreel, Najeeb [1 ]
机构
[1] Univ Rovira & Virgili, CYBERCAT Ctr Cybersecur Res Catalonia, UNESCO Chair Data Privacy, Dept Comp Engn & Math, Av Paisos Catalans 26, E-43007 Tarragona, Catalonia, Spain
来源
2020 20TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND INTERNET COMPUTING (CCGRID 2020) | 2020年
基金
欧盟地平线“2020”;
关键词
P2P computing; Reputation; Self-enforcement; Co-utility; Edge computing; Federated learning; SELF-ENFORCING PROTOCOLS;
D O I
10.1109/CCGrid49817.2020.00-90
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Outsourcing computation allows wielding huge computational power. Even though cloud computing is the most usual type of outsourcing, resorting to idle edge devices for decentralized computation is an increasingly attractive alternative. We tackle the problem of making peer honesty and thus computation correctness self-enforcing in decentralized computing with untrusted peers. To do so, we leverage the co-utility property, which characterizes a situation in which honest co-operation is the best rational option to take even for purely selfish agents; in particular, if a protocol is co-utile, it is self-enforcing. Reputation is a powerful incentive that can make a P2P protocol co-utile. We present a co-utile P2P decentralized computing protocol that builds on a decentralized reputation calculation, which is itself co-utile and therefore self-enforcing. In this protocol, peers are given a computational task including code and data and they are incentivized to compute it correctly. Based also on co-utile reputation, we then present a protocol for federated learning, whereby peers compute on their local private data and have no incentive to randomly attack or poison the model. Our experiments show the viability of our co-utile approach to obtain correct results in both decentralized computation and federated learning.
引用
收藏
页码:31 / 40
页数:10
相关论文
共 34 条
[1]   Primitives towards verifiable computation: a survey [J].
Ahmad, Haseeb ;
Wang, Licheng ;
Hong, Haibo ;
Li, Jing ;
Dawood, Hassan ;
Ahmed, Manzoor ;
Yang, Yixian .
FRONTIERS OF COMPUTER SCIENCE, 2018, 12 (03) :451-478
[2]  
[Anonymous], 2008, Essentials of Game Theory: A Concise, Multidisciplinary Introduction
[3]  
[Anonymous], 2017, ADV NEURAL INF PROC
[4]  
[Anonymous], 2007, Trusted platform module main specification
[5]  
Canetti R, 2011, PROCEEDINGS OF THE 18TH ACM CONFERENCE ON COMPUTER & COMMUNICATIONS SECURITY (CCS 11), P445
[6]   Practical byzantine fault tolerance and proactive recovery [J].
Castro, M ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461
[7]  
Chung KM, 2010, LECT NOTES COMPUT SC, V6223, P483, DOI 10.1007/978-3-642-14623-7_26
[8]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[9]   Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges [J].
Domingo-Ferrer, Josep ;
Farras, Oriol ;
Ribes-Gonzalez, Jordi ;
Sanchez, David .
COMPUTER COMMUNICATIONS, 2019, 140 :38-60
[10]   Co-Utility: Self-Enforcing protocols for the mutual benefit of participants [J].
Domingo-Ferrer, Josep ;
Martinez, Sergio ;
Sanchez, David ;
Soria-Comas, Jordi .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2017, 59 :148-158