PAG: Private and Accountable Gossip

被引:3
作者
Decouchant, Jeremie [1 ]
Ben Mokhtar, Sonia [2 ]
Petit, Albin [3 ]
Quema, Vivien [4 ]
机构
[1] Univ Luxembourg, SnT, Luxembourg, Luxembourg
[2] CNRS LIRIS, Lyon, France
[3] INSA Lyon, Lyon, France
[4] Grenoble INP, Grenoble, France
来源
PROCEEDINGS 2016 IEEE 36TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS ICDCS 2016 | 2016年
关键词
D O I
10.1109/ICDCS.2016.34
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A large variety of content sharing applications rely, at least partially, on gossip-based dissemination protocols. However, these protocols are subject to various types of faults, among which selfish behaviours performed by nodes that benefit from the system without contributing their fair share to it. Accountability mechanisms (e.g., PeerReview, AVMs, FullReview), which require that nodes log their interactions with others and periodically inspect each others' logs are effective solutions to deter faults. However, these solutions require that nodes disclose the content of their logs, which may leak sensitive information about them. Building on a monitoring infrastructure and on homomorphic cryptographic procedures, we propose in this paper PAG, the first accountable and partially privacy-preserving gossip protocol. We assess PAG theoretically using the ProVerif cryptographic protocol verifier and evaluate it experimentally using both a real deployment on a cluster of 48 machines and simulations. The performance evaluation of PAG, performed using a video live streaming application, shows that it is compatible with the visualisation of live video content on commodity Internet connections. Furthermore, PAG's bandwidth consumption inherits the desirable scalability properties of gossip when the number of users in the system grows.
引用
收藏
页码:35 / 44
页数:10
相关论文
共 34 条
[1]  
Aditya P., 2012, NSDI
[2]  
[Anonymous], 2000, 1 MONDAY
[3]  
[Anonymous], 2009, WWW
[4]  
[Anonymous], 2012, OSDI
[5]  
BASHER N, 2008, WWW
[6]  
Belenkiy Mira, 2007, ACM WORKSH PRIV EL S
[7]  
Ben Mokhtar S., 2013, ICDCS
[8]  
Blanchet B., 2001, CSFW
[9]  
Bonald T., 2008, ACM SIGMETRICS
[10]  
CHAUM D, 1988, J CRYPTOLOGY