Search
Results
-
Restricted cuts for bisections in solid grids
(2011)Technical reportThe graph bisection problem asks to partition the n vertices of a graph into two sets of equal size so that the number of edges across the cut is minimum. We study nite, connected subgraphs of the innite twodimensional grid that do not have holes. Since bisection is an intricate problem, our interest is in the tradeo between runtime and solution quality that we get by limiting ourselves to a special type of cut, namely cuts with at most ...Report -
Application Collusion Attack on the Permission-Based Security Model and its Implications for Modern Smartphone Systems
(2011)We show that the way in which permissionbased mechanisms are used on today’s mobile platforms enables attacks by colluding applications that communicate over overt and covert communication channels. These attacks allow applications to indirectly execute operations that those applications, based on their declared permissions, should not be able to execute. Example operations include disclosure of users private data (e.g., phone book and ...Report -
PSI Electrochemistry Laboratory - Annual Report
(2011)PSI Electrochemistry Laboratory - Annual ReportReport -
-
Implications of radio fingerprinting on the security of sensor networks
(2011)Technical Report / ETH Zurich, Department of Computer ScienceReport -
-
Distance hijacking attacks on distance bounding protocols
(2011)Distance bounding protocols are typically analyzed with respect to three types of attacks: Distance Fraud, Mafia Fraud, and Terrorist Fraud. We define and analyze a fourth main type of attack on distance bounding protocols, called Distance Hijacking. We show that many proposed distance bounding protocols are vulnerable to this type of attack, and we propose solutions to make these protocols resilient to Distance Hijacking. We further show ...Report -
Distance hijacking attacks on distance bounding protocols
(2011)Distance bounding protocols are typically analyzed with respect to three types of attacks: Distance Fraud, Mafia Fraud, and Terrorist Fraud. We define a fourth main type of attacks on distance bounding protocols, called Distance Hijacking attacks. We show that many proposed distance bounding protocols are vulnerable to these attacks, and we propose solutions to make these protocols resilient to Distance Hijacking. Additionally, we generalize ...Report -
-
Multi-level Monte Carlo finite volume methods for nonlinear systems of conservation laws in multi-dimensions
(2011)SAM Research ReportWe extend the Multi-Level Monte Carlo (MLMC) algorithm of [19] in order to quantify uncertainty in the solutions of multi-dimensional hyperbolic systems of conservation laws with uncertain initial data. The algorithm is presented and several issues arising in the massively parallel numerical implementation are addressed. In particular, we present a novel load balancing procedure that ensures scalability of the MLMC algorithm on massively ...Report