Publications associées à Technologies améliorant la confidentialité

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Privacy-preserving distributed collaborative filtering

Rachid Guerraoui, Anne-Marie Kermarrec, Davide Frey

We propose a new mechanism to preserve privacy while leveraging user profiles in distributed recommender systems. Our mechanism relies on two contributions: (i) an original obfuscation scheme, and (ii) a randomized dissemination protocol. We show that our ...

Springer Wien2016

PriBots: Conversational Privacy with Chatbots

Karl Aberer, Hamza Harkous, Kassem Fawaz

Traditional mechanisms for delivering notice and enabling choice have so far failed to protect users’ privacy. Users are continuously frustrated by complex privacy policies, unreachable privacy settings, and a multitude of emerging standards. The miniaturi ...

2016

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Handan Kilinç Alper

Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. We examine MFE scenarios where every participant has some item, and at the end of the protocol, either ever ...

Springer International Publishing2015

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Touradj Ebrahimi, Lin Yuan, David Mc Nally

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the b ...

Spie-Int Soc Optical Engineering2015

Seeking Anonymity in an Internet Panopticon

Bryan Alexander Ford

Internet, users often need to assume, by default, that their every statement or action online is monitored and tracked. The Dissent project at Yale University takes a collective approach to online anonymity, based on different algorithmic foundations from ...

Assoc Computing Machinery2015

The Chaining Lemma and Its Application

Sebastian Faust

We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X-(0) with high min-entropy and a number (say, t in total) of arbitrary functions (T-1,.. ...

Springer-Verlag Berlin2015

Technologies améliorant la confidentialité

Graph Chatbot

Chattez avec Graph Search

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Privacy-preserving distributed collaborative filtering

PriBots: Conversational Privacy with Chatbots

The Limits of Composable Crypto with Transferable Setup Devices

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Leakage-resilient non-malleable codes

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Seeking Anonymity in an Internet Panopticon

The Chaining Lemma and Its Application

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Privacy-preserving distributed collaborative filtering

PriBots: Conversational Privacy with Chatbots

Leakage-resilient non-malleable codes

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Seeking Anonymity in an Internet Panopticon

The Limits of Composable Crypto with Transferable Setup Devices

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Secret Communication Over Broadcast Erasure Channels With State-Feedback

The Chaining Lemma and Its Application