Computer Sciences Dept.

Computer Security and Cryptography Reading Group
October 2005 List

Date &
Location
Reading
Thursday, October 6, 2005
3 PM - 4 PM
7331 CS

R. Sekar
Z. Liang, R. Sekar
SUNY Stonybrook
Fast and Automated Generation of Attack Signatures: A Basis for Building SelfProtecting Servers
CCS'05

URL: http://seclab.cs.sunysb.edu/seclab/pubs/papers/ccs05.pdf

Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simply unable to cope with the volume and speed with which new vulnerabilities are being discovered. In this paper, we develop a new approach that can provide effective protection against a vast majority of these attacks that exploit memory errors in C/C++ programs. Our approach, called COVERS, uses a forensic analysis of a victim server's memory to correlate attacks to inputs received over the network, and automatically develop a signature that characterizes inputs that carry attacks. The signatures tend to capture characteristics of the underlying vulnerability (e.g., a message field being too long) rather than the characteristics of an attack, which makes them effective against variants of attacks. Our approach introduces low overheads (under 10%), does not require access to source code of the protected server, and has successfully generated signatures for the attacks studied in our experiments, without producing false positives. Since the signatures are generated in tens of milliseconds, they can potentially be distributed quickly over the Internet to filter out (and thus stop) fastspreading worms. Another interesting aspect of our approach is that it can defeat guessing attacks reported against address-space randomization and instruction set randomization techniques. Finally, it increases the capacity of servers to withstand repeated attacks by a factor of 10 or more.

Thursday, October 13, 2005
3 PM - 4 PM
7331 CS

P. Traynor

P. McDaniel

T. La Porta
W. Enck, P. Traynor, P. McDaniel, T. La Porta
Pennsylvania State University
Exploiting Open Functionality in SMS-Capable Cellular Networks
CCS'05

URL: http://www.smsanalysis.org/smsanalysis.pdf

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 messages to the vast majority of wireless subscribers. To encourage the expansion of this new service, telecommunications companies offer connections between their networks and the Internet. The ramifications of such connections, however, have not been fully recognized. In this paper, we evaluate the security impact of the SMS interface on the availability of the cellular phone network. Specifically, we demonstrate the ability to deny voice service to cities the size of Washington D.C. and Manhattan with little more than a cable modem. Moreover, attacks targeting the entire United States are feasible with resources available to medium-sized zombie networks. This analysis begins with an exploration of the structure of cellular networks. We then characterize network behavior and explore a number of reconnaissance techniques aimed at effectively targeting attacks on these systems. We conclude by discussing countermeasures that mitigate or eliminate the threats introduced by these attacks.

Thursday, October 20, 2005
3 PM - 4 PM
7331 CS

J. D. Tygar
R. Dhamija, J. D. Tygar
Berkeley
The battle against phishing: Dynamic Security Skins
SOUPS'05

URL: http://cups.cs.cmu.edu/soups/2005/2005proceedings/p77-dhamija.pdf

Phishing is a model problem for illustrating usability concerns of privacy and security because both system designers and attackers battle using user interfaces to guide (or misguide) users.We propose a new scheme, Dynamic Security Skins, that allows a remote web server to prove its identity in a way that is easy for a human user to verify and hard for an attacker to spoof. We describe the design of an extension to the Mozilla Firefox browser that implements this scheme.We present two novel interaction techniques to prevent spoofing. First, our browser extension provides a trusted window in the browser dedicated to username and password entry. We use a photographic image to create a trusted path between the user and this window to prevent spoofing of the window and of the text entry fields.Second, our scheme allows the remote server to generate a unique abstract image for each user and each transaction. This image creates a "skin" that automatically customizes the browser window or the user interface elements in the content of a remote web page. Our extension allows the user's browser to independently compute the image that it expects to receive from the server. To authenticate content from the server, the user can visually verify that the images match.We contrast our work with existing anti-phishing proposals. In contrast to other proposals, our scheme places a very low burden on the user in terms of effort, memory and time. To authenticate himself, the user has to recognize only one image and remember one low entropy password, no matter how many servers he wishes to interact with. To authenticate content from an authenticated server, the user only needs to perform one visual matching operation to compare two images. Furthermore, it places a high burden of effort on an attacker to spoof customized security indicators.

Thursday, October 27, 2005
3 PM - 4 PM
7331 CS

M. Budiu

U. Erlingsson

J. Ligatti
Martin Abadi, Mihai Budiu, Ulfar Erlingsson, Jay Ligatti
UCSC / MSR / Princeton
A Theory of Secure Control Flow
ICFEM'05

URL: http://research.microsoft.com/users/mbudiu/icfem05.pdf

Control-Flow Integrity (CFI) means that the execution of a program dynamically follows only certain paths, in accordance with a static policy. CFI can prevent attacks that, by exploiting buffer overflows and other vulnerabilities, attempt to control program behavior. This paper develops the basic theory that underlies two practical techniques for CFI enforcement, with precise formulations of hypotheses and guarantees.


< Back to the Sec & Crypto reading group page
Created and maintained by Mihai Christodorescu (http://www.cs.wisc.edu/~mihai)
Created: Fri Feb 04 16:32:13 2005
Last modified: Fri Sep 30 13:59:39 Central Daylight Time 2005
 
Computer Science | UW Home