|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
A Framework for the Analysis of Mix-Based Steganographic File Systems
If you have a question about this talk, please contact Mateja Jamnik.
The goal of Steganographic File Systems (SFSs) is to protect users from coercion attacks by providing plausible deniability on the existence of hidden files. We consider an adversary who can monitor changes in the file store and use this information to look for hidden files when coercing the user. We outline a high-level SFS architecture that uses a local mix to relocate files in the remote store, and thus prevent known attacks that rely on low-entropy relocations. We define probabilistic metrics for unobservability and (plausible) deniability, present an analytical framework to extract evidence of hidden files from the adversary’s observation (before and after coercion,) and show in an experimental setup how this evidence can be used to reduce deniability. This work is a first step towards understanding and addressing the security requirements of SFSs operating under the considered threat model, of relevance in scenarios such as remote stores managed by semi-trusted parties, or distributed peer-to-peer SFSs.
This talk is part of the Computer Laboratory Wednesday Seminars series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsHomerton CIG Series 2015 - 2016 Cambridge Finance Seminar Series Graham Storey Lecture
Other talksRicci-flat manifolds and a spinorial flow G2-instantons and Seiberg-Witten monopoles Efficiency=Geometry? Decoding the DNA of prediction in gauge, gravity, and effective field theories. Tutorial 1: Data Linkage – Introduction, Recent Advances, and Privacy Issues FESTIVAL of WELLBEING 2016 On-Shell Diagrams for N = 8 Supergravity Amplitudes