Sciweavers

CSFW
2010
IEEE
13 years 8 months ago
Towards a Formal Foundation of Web Security
—We propose a formal model of web security based straction of the web platform and use this model to analyze the security of several sample web mechanisms and applications. We id...
Devdatta Akhawe, Adam Barth, Peifung E. Lam, John ...
CSFW
2010
IEEE
13 years 8 months ago
Information Flow in Credential Systems
—This paper proposes a systematic study of information flow in credential-based declarative authorization policies. It argues that a treatment in terms of information flow is n...
Moritz Y. Becker
CSFW
2010
IEEE
13 years 8 months ago
Modeling and Verifying Ad Hoc Routing Protocols
Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
CSFW
2010
IEEE
13 years 8 months ago
Quantification of Integrity
Michael R. Clarkson, Fred B. Schneider
CSFW
2010
IEEE
13 years 8 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
CSFW
2010
IEEE
13 years 8 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
CSFW
2010
IEEE
13 years 8 months ago
On Protection by Layout Randomization
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...
Martín Abadi, Gordon D. Plotkin
CSFW
2010
IEEE
13 years 8 months ago
Robustness Guarantees for Anonymity
—Anonymous communication protocols must achieve two seemingly contradictory goals: privacy (informally, they must guarantee the anonymity of the parties that send/receive informa...
Gilles Barthe, Alejandro Hevia, Zhengqin Luo, Tama...
CSFW
2010
IEEE
13 years 8 months ago
Analysing Unlinkability and Anonymity Using the Applied Pi Calculus
—An attacker that can identify messages as coming from the same source, can use this information to build up a picture of targets’ behaviour, and so, threaten their privacy. In...
Myrto Arapinis, Tom Chothia, Eike Ritter, Mark Rya...
CSFW
2010
IEEE
13 years 8 months ago
Dynamic vs. Static Flow-Sensitive Security Analysis
—This paper seeks to answer fundamental questions about trade-offs between static and dynamic security analysis. It has been previously shown that flow-sensitive static informat...
Alejandro Russo, Andrei Sabelfeld