Sciweavers

PET
2012
Springer
12 years 2 months ago
Understanding Statistical Disclosure: A Least Squares Approach
It is widely accepted that Disclosure Attacks are effective against high-latency anonymous communication systems. A number of Disclosure Attack variants can be found in the litera...
Fernando Pérez-González, Carmela Tro...
PET
2012
Springer
12 years 2 months ago
Evading Censorship with Browser-Based Proxies
While Internet access to certain sites is blocked in some parts of the world, these restrictions are often circumvented using proxies outside the censored region. Often these proxi...
David Fifield, Nate Hardison, Jonathan Ellithorpe,...
CSFW
2012
IEEE
12 years 2 months ago
Discovering Concrete Attacks on Website Authorization by Formal Analysis
—Social sign-on and social sharing are becoming an ever more popular feature of web applications. This success is largely due to the APIs and support offered by prominent social ...
Chetan Bansal, Karthikeyan Bhargavan, Sergio Maffe...
CSFW
2012
IEEE
12 years 2 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
CSFW
2012
IEEE
12 years 2 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
CSFW
2012
IEEE
12 years 2 months ago
Securing Interactive Programs
Abstract—This paper studies the foundations of informationflow security for interactive programs. Previous research assumes that the environment is total, that is, it must alway...
Willard Rafnsson, Daniel Hedin, Andrei Sabelfeld
CSFW
2012
IEEE
12 years 2 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli
CSFW
2012
IEEE
12 years 2 months ago
Secure Compilation to Modern Processors
—We present a secure (fully abstract) compilation scheme to compile an object-based high-level language to lowchine code. Full abstraction is achieved by relying on a fine-grain...
Pieter Agten, Raoul Strackx, Bart Jacobs, Frank Pi...
CSFW
2012
IEEE
12 years 2 months ago
Measuring Information Leakage Using Generalized Gain Functions
Abstract—This paper introduces g-leakage, a rich generalization of the min-entropy model of quantitative information flow. In g-leakage, the benefit that an adversary derives f...
Mário S. Alvim, Konstantinos Chatzikokolaki...
CSFW
2012
IEEE
12 years 2 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...