TY - GEN
T1 - P3LS: Plausible deniability for practical privacy-preserving live streaming
AU - Decouchant, Jeremie
AU - Boutet, Antoine
AU - Yu, Jiangshan
AU - Esteves-Verissimo, Paulo
N1 - Generated from Scopus record by KAUST IRTS on 2021-03-16
PY - 2019/10/1
Y1 - 2019/10/1
N2 - Video consumption is one of the most popular Internet activities worldwide. The emergence of sharing videos directly recorded with smartphones raises important privacy concerns. In this paper we propose P3LS, the first practical privacy-preserving peer-to-peer live streaming system. To protect the privacy of its users, P3LS relies on k-anonymity when users subscribe to streams, and on plausible deniability for the dissemination of video streams. Specifically, plausible deniability during the dissemination phase ensures that an adversary is never able to distinguish a user's stream of interest from the fake streams from a statistical analysis (i.e., using an analysis of variance). We exhaustively evaluate P3LS and show that adversaries are not able to identify the real stream of a user with very high confidence. Moreover, P3LS consumes 30% less bandwidth than the standard k-anonymity approach where nodes fully contribute to the dissemination of k streams.
AB - Video consumption is one of the most popular Internet activities worldwide. The emergence of sharing videos directly recorded with smartphones raises important privacy concerns. In this paper we propose P3LS, the first practical privacy-preserving peer-to-peer live streaming system. To protect the privacy of its users, P3LS relies on k-anonymity when users subscribe to streams, and on plausible deniability for the dissemination of video streams. Specifically, plausible deniability during the dissemination phase ensures that an adversary is never able to distinguish a user's stream of interest from the fake streams from a statistical analysis (i.e., using an analysis of variance). We exhaustively evaluate P3LS and show that adversaries are not able to identify the real stream of a user with very high confidence. Moreover, P3LS consumes 30% less bandwidth than the standard k-anonymity approach where nodes fully contribute to the dissemination of k streams.
UR - https://ieeexplore.ieee.org/document/9049639/
UR - http://www.scopus.com/inward/record.url?scp=85080487624&partnerID=8YFLogxK
U2 - 10.1109/SRDS47363.2019.00011
DO - 10.1109/SRDS47363.2019.00011
M3 - Conference contribution
SN - 0769567118
SP - 1
EP - 10
BT - Proceedings of the IEEE Symposium on Reliable Distributed Systems
PB - IEEE Computer [email protected]
ER -