Workshop Program

All sessions will be held in Grand AB unless otherwise noted.

August 6, 2012

8:45 a.m.–10:00 a.m. Monday
10:05 a.m.–10:35 a.m. Monday
10:35 a.m.–11:00 a.m. Monday

Break

Grand Ballroom Foyer

11:00 a.m.–12:30 p.m. Monday

Smartphone Insecurity

Abusing Notification Services on Smartphones for Phishing and Spamming

Zhi Xu and Sencun Zhu, Pennsylvania State University

Notification service is a popular functionality provided by almost all modern smartphone platforms. To facilitate customization for developers, many smartphone platforms support highly customizable notifications, which allow the third party applications to specify the trigger events, the notification views to be displayed, and the allowed user operations on the notification views.

In this paper, we show that notification customization may allow an installed trojan application to launch phishing attacks or anonymously post spam notifications. Through our studies on four major smartphone platforms, we show that both Android and BlackBerry OS are vulnerable under the phishing and spam notification attacks. iOS and Windows Phone allow little notification customization, thus launching the phishing and spam attacks will expose the identity of the trojan application. Attack demonstrations on all platforms are presented.

To prevent the phishing and spam notification attacks while still allowing notification customization, we propose a Semi-OS-Controlled notification view design principle and a Notification Logging service. Moreover, to protect applications from fraudulent views, we propose a view authentication framework, named SecureView, which enables the third party applications to add the authentication image and text to their sensitive views (e.g. the account login view). The implementation and demonstrations of proposed defense approaches on Android are also presented in the paper.

Available Media

Baseband Attacks: Remote Exploitation of Memory Corruptions in Cellular Protocol Stacks

Ralf-Philipp Weinmann, University of Luxembourg
 
  Awarded Best Paper! 

Available Media

Security Analysis of Smartphone Point-of-Sale Systems

WesLee Frisby, Benjamin Moench, Benjamin Recht, and Thomas Ristenpart, University of Wisconsin-Madison

We experimentally investigate the security of several smartphone point-of-sale (POS) systems that consist of a software application combined with an audio-jack magnetic stripe reader (AMSR). The latter is a small hardware dongle that reads magnetic stripes on payment cards, (sometimes) encrypts the sensitive card data, and transmits the result to the application. Our main technical result is a complete break of a feature-rich AMSR with encryption support. We show how an arbitrary application running on the phone can permanently disable the AMSR, extract the cryptographic keys it uses to protect cardholder data, or gain the privileged access needed to upload new rmware to it.

Available Media
12:30 p.m.–2:00 p.m. Monday

Workshop Luncheon

Grand EFGH

2:00 p.m.–3:30 p.m. Monday

Web Attack

WAFFle: Fingerprinting Filter Rules of Web Application Firewalls

 Isabell Schmitt and Sebastian Schinzel, University of Erlangen-Nuremberg

Web Application Firewalls (WAFs) are used to detect and block attacks against vulnerable web applications. They distinguish benign requests from rogue requests using a set of filter rules. We present a new timing side channel attack that an attacker can use to remotely distinguish passed requests from requests that the WAF blocked. The attack works also for transparent WAFs that do not leave any trace in responses. The attacker can either conduct our attack directly or indirectly by using Cross Site Request Forgeries (CSRF). The latter allows the attacker to get the results of the attack while hiding his identity and to circumvent any practical brute-force prevention mechanism in the WAF. By learning which requests the WAF blocks and which it passes to the application, the attacker can craft targeted attacks that use any existing loopholes in the WAF’s filter rule set. We implemented this attack in the WAFFle tool and ran tests over the Internet against ModSecurity and PHPIDS. The results show that WAFFle correctly distinguished passed requests from blocked requests in more than 95 % of all requests just by measuring a single request.

Available Media

Off-Path Attacking the Web

Yossi Gilad and Amir Herzberg, Bar Ilan University
    Awarded Best Student Paper! 

We show how an off-path (spoofing-only) attacker can perform cross-site scripting (XSS), cross-site request forgery (CSRF) and site spoofing/defacement attacks, without requiring vulnerabilities in either web-browser or server, and circumventing known defenses. The attacks are practical and require a puppet (malicious script in browser sandbox) running on a victim client machine, and an attacker capable of IP-spoofing on the Internet.

Our attacks are based on a technique that allows an offpath attacker to efficiently learn the sequence numbers of both the client and server in a TCP connection. This technique exploits the fact that many computers, in particular those running (any recent version of) Windows, use a global IP-ID counter, which provides a side channel allowing efficient exposure of the connection sequence numbers.

We present results of experiments evaluating the learning technique and the attacks that exploit it. We also present practical defenses that can be deployed at the firewall level, either at the client or server end; no changes to existing TCP/IP stacks are required.

Available Media

On the Fragility and Limitations of Current Browser-Provided Clickjacking Protection Schemes

Sebastian Lekies, SAP Research; Mario Heiderich, Ruhr University; Dennis Appelt, SAP Research; Thorsten Holz, Ruhr University; Martin Johns, SAP Research

An important and timely attack technique on the Web is Clickjacking (also called UI redressing), in which an attacker tricks the unsuspicious victim into clicking on a specific element without his explicit knowledge about where he is actually clicking. In order to protect their websites from being exploitable, many web masters deployed different countermeasures to this kind of attack.

In this paper, we explore the limitations and shortcomings of current anti-clickjacking approaches and present several bypasses of state-of-the-art tools, including an attack we call Nested Clickjacking that enables us to perform Clickjacking against the social network Google+. Furthermore, we present the results of a large scale empirical study on the usage of current anti-clickjacking mechanisms on about 2 million web pages. The results of our analysis show that about 15% of the analyzed web sites protect themselves against Clickjacking.

Available Media
3:30 p.m.–4:00 p.m. Monday

Break

Grand Ballroom Foyer

4:00 p.m.–6:00 p.m. Monday

Panel

The Future of HTTPS

Speakers:
Nicolas Lidzborski, Google, 15 years of Attack on SSL
Sid Stamm, Mozilla, Certified Lies: Interception Attacks Against SSL

Available Media

August 7, 2012

8:45 a.m.–10:00 a.m. Tuesday
10:05 a.m.–10:35 a.m. Tuesday

Improving Malicious Code

Microgadgets: Size Does Matter in Turing-Complete Return-Oriented Programming

Andrei Homescu, Michael Stewart, Per Larsen, Stefan Brunthaler, and Michael Franz, University of California Irvine

Return-oriented programming (ROP) has gained a lot of popularity lately, as an attack against currently implemented defenses in modern operating systems. Several kinds of ROP-based attacks and anti-ROP defenses have been proposed in recent years. The original attack technique depends on the existence of a hand-picked set of byte sequences (called gadgets) in the program, while subsequent approaches use complex scanners, which perform semantic analysis on the code to locate gadgets. The latter ones are efficient at finding gadgets and building an attack, but incur a significant cost in time.

We propose a ROP attack technique, based on a handpicked but flexible and Turing-complete set of gadgets. One novelty in this approach is the use of microgadgets, which are gadgets restricted to 2 or 3 bytes in length. Our approach splits gadgets into several classes of varying sizes (from 1 to more than 800). Only a single gadget from each class is required for Turing-completeness. The short length of the gadgets, as well as the large size of the classes, increase the likelihood of finding all required gadgets. We also describe an efficient scanner which locates these gadgets in a given program. We then use this scanner on the /usr/bin directories from several Linux distributions, to show that many programs indeed contain a Turing-complete set of microgadgets, which attackers can use to perform arbitrary computations.

Available Media

Frankenstein: Stitching Malware from Benign Binaries

Vishwath Mohan and Kevin W. Hamlen, University of Texas at Dallas

This paper proposes a new self-camouflaging malware propagation system, Frankenstein, that overcomes shortcomings in the current generation of metamorphic malware. Specifically, although mutants produced by current state-of-theart metamorphic engines are diverse, they still contain many characteristic binary features that reliably distinguish them from benign software.

Frankenstein forgoes the concept of a metamorphic engine and instead creates mutants by stitching together instructions from non-malicious programs that have been classified as benign by local defenses. This makes it more difficult for featurebased malware detectors to reliably use those byte sequences as a signature to detect the malware. The instruction sequence harvesting process leverages recent advances in gadget discovery for return-oriented programming. Preliminary tests show that mining just a few local programs is sufficient to provide enough gadgets to implement arbitrary functionality.

Available Media
10:35 a.m.–11:00 a.m. Tuesday

Break

Grand Ballroom Foyer

11:00 a.m.–12:30 p.m. Tuesday

Bypassing System Security

SMT Solvers in Software Security

Julien Vanegue, Microsoft Security Science; Sean Heelan, Immunity Inc.; Rolf Rolles

Computational capacity of modern hardware and algorithmic advances have allowed SAT solving to become a tractable technique to rely on for the decision of properties in industrial software. In this article, we present three practical applications of SAT to software security in static vulnerability checking, exploit generation, and the study of copy protections. These areas are some of the most active in terms of both theoretical research and practical solutions. Investigating the successes and failures of approaches to these problems is instructive in providing guidance for future work on the problems themselves as well as other SMT-based systems.

Available Media

Web-based Attacks on Host-Proof Encrypted Storage

Karthikeyan Bhargavan, INRIA; Antoine Delignat-Lavaud, ENS Cachan

Cloud-based storage services, such as Wuala, and password managers, such as LastPass, are examples of socalled host-proof web applications that aim to protect users from attacks on the servers that host their data. To this end, user data is encrypted on the client and the server is used only as a backup data store. Authorized users may access their data through client-side software, but for ease of use, many commercial applications also offer browser-based interfaces that enable features such as remote access, form-filling, and secure sharing.

We describe a series of web-based attacks on popular host-proof applications that completely circumvent their cryptographic protections. Our attacks exploit standard web application vulnerabilities to expose flaws in the encryption mechanisms, authorization policies, and key management implemented by these applications. Our analysis suggests that host-proofing by itself is not enough to protect users from web attackers, who will simply shift their focus to flaws in client-side interfaces.

Available Media

Read It Twice! A Mass-Storage-Based TOCTTOU Attack

Collin Mulliner and Benjamin Michéle, Technische Universität Berlin and Telekom Innovation Laboratories
    Awarded Best Paper!

Consumer electronics and embedded devices often allow the installation of applications and firmware upgrades from user-provided mass-storage devices. To protect the integrity of these devices and the associated electronic markets, the software packages are protected by cryptographic signatures. The software installation code assumes that files on attached mass-storage devices cannot change while the storage device is connected. The software installation is therefore not bound to the file integrity check, thus laying the foundations for a time-of-check-to-time-of-use (TOCTTOU) attack. This work presents a TOCTTOU attack via externally attached mass-storage devices. The attack is based on emulating a mass-storage device to observe and alter file access from the consumer device. The TOCTTOU attack is executed by providing different file content to the check and installation code of the target device, respectively. The presented attack effectively bypasses the file content inspection, resulting in the execution of rogue code on the device.

Available Media
12:30 p.m.–2:00 p.m. Tuesday

Workshop Luncheon

Grand EFGH

2:00 p.m.–3:30 p.m. Tuesday

Keynote Address

Everything You Know About Password-Stealing Is Wrong

Cormac Herley, Microsoft

The popular and trade presses are full of stories of the easy billions being made in cybercrime. Cybercriminals extract money effortlessly from consumers and small businesses. Trillion dollar estimates are tossed around, the NSA director refers to cybercrime as "the greatest transfer of wealth in history," and so on. We argue that this is all wrong. Emptying compromised accounts is extremely hard. Passwords are not the bottleneck in the cybercrime pipeline. Underground markets are not thriving. Credential-stealing, far from being a recession-proof gold-mine, is a terrible business opportunity. Widely circulated cybercrime estimates are based on absurdly bad statistical methods and are wholly unreliable.

Cormac Herley is a Principal Researcher with Microsoft Research. His interests include economics, authentication, and data-driven security. He's been with MSR since 1999, and has a PhD from Columbia University.

 

 

The popular and trade presses are full of stories of the easy billions being made in cybercrime. Cybercriminals extract money effortlessly from consumers and small businesses. Trillion dollar estimates are tossed around, the NSA director refers to cybercrime as "the greatest transfer of wealth in history," and so on. We argue that this is all wrong. Emptying compromised accounts is extremely hard. Passwords are not the bottleneck in the cybercrime pipeline. Underground markets are not thriving. Credential-stealing, far from being a recession-proof gold-mine, is a terrible business opportunity. Widely circulated cybercrime estimates are based on absurdly bad statistical methods and are wholly unreliable.

Cormac Herley is a Principal Researcher with Microsoft Research. His interests include economics, authentication, and data-driven security. He's been with MSR since 1999, and has a PhD from Columbia University.

 

 

Available Media
3:30 p.m.–4:00 p.m. Tuesday

Break

Grand Ballroom Foyer

4:00 p.m.–4:30 p.m. Tuesday

Network Attack

Under New Management: Practical Attacks on SNMPv3

Nigel Lawrence and Patrick Traynor, Georgia Institute of Technology

Network monitoring is a necessity for both reducing downtime and ensuring rapid response in the case of software or hardware failure. Unfortunately, one of the most widely used protocols for monitoring networks, the Simple Network Management Protocol (SNMPv3), does not offer an acceptable level of confidentiality or integrity for these services. In this paper, we demonstrate two attacks against the most current and secure version of the protocol with authentication and encryption enabled. In particular, we demonstrate that under reasonable conditions, we can read encrypted requests and forge messages between the network monitor and the hosts it observes. Such attacks are made possible by an insecure discovery mechanism, which allows an adversary capable of compromising a single network host to set the keys used by the security functions. Our attacks show that SNMPv3 places too much trust on the underlying network, and that this misplaced trust introduces vulnerabilities that can be exploited.

Available Media