Reference : Collusions and Privacy in Rational-Resilient Gossip
Dissertations and theses : Doctoral thesis
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/28425
Collusions and Privacy in Rational-Resilient Gossip
English
Decouchant, Jérémie mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
9-Nov-2015
Grenoble University, ​Grenoble, ​​France
PhD
164
Quéma, Vivien
Ben Mokhtar, Sonia
de Palma, Noël
Réveillère, Laurent
Tixeuil, Sébastien
Rivière, Étienne
[en] Accountability ; Peer-to-peer ; Privacy
[en] Gossip-based content dissemination protocols are a scalable and cheap alternative to
centralized content sharing systems. However, it is well known that these protocols
suffer from rational nodes, i.e., nodes that aim at downloading the content without
contributing their fair share to the system. While the problem of rational nodes that act
individually has been well addressed in the literature, colluding rational nodes is still
an open issue. In addition, previous rational-resilient gossip-based solutions require
nodes to log their interactions with others, and disclose the content of their logs, which
may disclose sensitive information. Nowadays, a consensus exists on the necessity
of reinforcing the control of users on their personal information. Nonetheless, to the
best of our knowledge no privacy-preserving rational-resilient gossip-based content
dissemination system exists.
The contributions of this thesis are twofold.
First, we present AcTinG, a protocol that prevents rational collusions in gossip-based
content dissemination protocols, while guaranteeing zero false positive accusations.
AcTing makes nodes maintain secure logs and mutually check each others’ correctness
thanks to verifiable but non predictable audits. As a consequence of its design, it is
shown to be a Nash-equilibrium. A performance evaluation shows that AcTinG is able
to deliver all messages despite the presence of colluders, and exhibits similar scalability
properties as standard gossip-based dissemination protocols.
Second, we describe P AG, the first accountable and privacy-preserving gossip pro-
tocol. P AG builds on a monitoring infrastructure, and homomorphic cryptographic
procedures to provide privacy to nodes while making sure that nodes forward the
content they receive. The theoretical evaluation of P AG shows that breaking the
privacy of interactions is difficult, even in presence of a global and active opponent.
We assess this protocol both in terms of privacy and performance using a deployment
performed on a cluster of machines, simulations involving up to a million of nodes, and
theoretical proofs. The bandwidth overhead is much lower than existing anonymous
communication protocols, while still being practical in terms of CPU usage.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/28425
Updated version - September 2016

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
thesis_JDecouchant_092016.pdfPublisher postprint2.39 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.