Sciweavers

CCS
2005
ACM
13 years 10 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov
CCS
2005
ACM
13 years 10 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
CCS
2005
ACM
13 years 10 months ago
Automatic placement of authorization hooks in the linux security modules framework
We present a technique for automatic placement of authorization hooks, and apply it to the Linux security modules (LSM) framework. LSM is a generic framework which allows diverse ...
Vinod Ganapathy, Trent Jaeger, Somesh Jha
CCS
2005
ACM
13 years 10 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
CCS
2005
ACM
13 years 10 months ago
Exploiting open functionality in SMS-capable cellular networks
Cellular networks are a critical component of the economic and social infrastructures in which we live. In addition to voice services, these networks deliver alphanumeric text mes...
William Enck, Patrick Traynor, Patrick McDaniel, T...
CCS
2005
ACM
13 years 10 months ago
On deriving unknown vulnerabilities from zero-day polymorphic and metamorphic worm exploits
Vulnerabilities that allow worms to hijack the control flow of each host that they spread to are typically discovered months before the worm outbreak, but are also typically disc...
Jedidiah R. Crandall, Zhendong Su, Shyhtsun Felix ...
CCS
2005
ACM
13 years 10 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
CCS
2005
ACM
13 years 10 months ago
Formal security analysis of basic network-attached storage
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
Avik Chaudhuri, Martín Abadi
CCS
2005
ACM
13 years 10 months ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi