Name
Abstract | ||
|---|---|---|
While proper encryption can protect the confidentiality of messages in network protocols and distributed systems, private contents of messages may still leak from metadata, such as communication paths or message lengths. Many privacy strategies seal leakages by introducing noise into the system, e.g., by injecting dummy messages into the system. These solutions achieve a degree of privacy while introducing an overhead in operational cost, e.g., by transmitting information-less messages.In this paper, we show that randomization is never required for minimizing the operational cost of perfectly secure privacy strategies. While this result is surprising and counterintuitive, it allows for a simplification in the search for optimal solutions and in the analysis of the performance of the selected solutions. |
Year | Venue | Keywords |
|---|---|---|
2017 | 2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | Data privacy, information theory, mutual information, rate-distortion theory |
Field | DocType | ISSN |
Counterintuitive,Metadata,Confidentiality,Information leakage,Computer security,Computer science,Computer network,Encryption,Operational costs,Probabilistic logic,Communications protocol | Conference | 1550-3607 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Megumi Ando | 1 | 1 | 0.69 |
| Eli Upfal | 2 | 4310 | 743.13 |