Sciweavers

CCS
2005
ACM
14 years 1 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
14 years 1 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
14 years 1 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
14 years 1 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
14 years 1 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
14 years 1 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
CCS
2005
ACM
14 years 1 months ago
Risk assessment in distributed authorization
Peter C. Chapin, Christian Skalka, Xiaoyang Sean W...
CCS
2005
ACM
14 years 1 months ago
On fairness in simulatability-based cryptographic systems
Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simula...
Michael Backes, Dennis Hofheinz, Jörn Mü...
CCS
2005
ACM
14 years 1 months ago
Untraceable RFID tags via insubvertible encryption
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
Giuseppe Ateniese, Jan Camenisch, Breno de Medeiro...