Name
Abstract | ||
|---|---|---|
Resource sharing while preserving privacy is an increasingly important problem due to a wide-scale adoption of cloud computing. Under multitenancy, it is common to have multiple mutually distrustful “processes” (e.g. cores, threads, etc.) running on the same system simultaneously. This paper explores a new approach for automatically identifying and quantifying the information leakage in protocols that arbitrate utilization of shared resources between processes. Our approach is based on symbolic execution of arbiter protocols to extract constraints relating adversary observations to victim requests, then using model counting constraint solvers to quantify the information leaked. We present enumerative and optimized methods of exact model counting, and apply our methods to a set of nine different arbiter protocols, quantifying their leakage under different scenarios and allowing for informed comparison. |
Year | Venue | Field |
|---|---|---|
2018 | ATVA | Arbiter,Information leakage,Computer science,Multitenancy,Theoretical computer science,Thread (computing),Symbolic execution,Adversary,Shared resource,Distributed computing,Cloud computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nestan Tsiskaridze | 1 | 1 | 0.71 |
| Lucas Bang | 2 | 45 | 5.43 |
| Joseph McMahan | 3 | 0 | 1.69 |
| Tevfik Bultan | 4 | 2481 | 157.95 |
| Timothy Sherwood | 5 | 1921 | 123.28 |