Lujo Bauer

Lujo Bauer

Auto-generated profile, based on publicly available information

Lujo Bauer

Carnegie Mellon University

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 October 2016
Verified
Conference Paper
Open access
PDF file
MSMahmood Sharif
Mahmood Sharif
SBSruti Bhagavatula
Sruti Bhagavatula
LBLujo Bauer
Lujo Bauer
MRMichael K. Reiter
Michael K. Reiter
Machine learning is enabling a myriad innovations, including new algorithms for cancer diagnosis and self-driving cars. The broad use of machine learning makes it important to understand the extent to which machine-learning algorithms are subject to attack, particularly when used in applications where physical security or safety is at risk. In this paper, we focus on facial biometric systems, which are widely used in surveillance and access control. We define and investigate a novel class of attacks: attacks that are physically realizable and inconspicuous, and allow an attacker to evade recognition or impersonate another individual. We develop a systematic method to automatically generate such attacks, which are realized through printing a pair of eyeglass frames. When worn by the attacker whose image is supplied to a state-of-the-art face-recognition algorithm, the eyeglasses allow her to evade being recognized or to impersonate another individual. Our investigation focuses on white-box face-recognition systems, but we also demonstrate how similar techniques can be used in black-box scenarios, as well as to avoid face detection.

1 February 2005 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
JLJay Ligatti
Jay Ligatti
LBLujo Bauer
Lujo Bauer
DWDavid Walker
David Walker

10 June 2019 in ACM Transactions on Privacy and Security
Verified
Journal Article
Open access
PDF file
MSMahmood Sharif
Mahmood Sharif
SBSruti Bhagavatula
Sruti Bhagavatula
LBLujo Bauer
Lujo Bauer
MRMichael K. Reiter
Michael K. Reiter
Images perturbed subtly to be misclassified by neural networks, calledadversarial examples, have emerged as a technically deep challenge and an important concern for several application domains. Most research on adversarial examples takes as its only constraint that the perturbed images are similar to the originals. However, real-world application of these ideas often requires the examples to satisfy additional objectives, which are typically enforced through custom modifications of the perturbation process. In this article, we proposeadversarial generative nets(AGNs), a general methodology to train ageneratorneural network to emit adversarial examples satisfying desired objectives. We demonstrate the ability of AGNs to accommodate a wide range of objectives, including imprecise ones difficult to model, in two application domains. In particular, we demonstratephysicaladversarial examples—eyeglass frames designed to fool face recognition—with better robustness, inconspicuousness, and scalability than previous approaches, as well as a new attack to fool a handwritten-digit classifier.

7 May 2011
Verified
Conference Paper
Open access
PDF file
SKSaranga Komanduri
Saranga Komanduri
RSRichard Shay
Richard Shay
PKPatrick Gage Kelley
Patrick Gage Kelley
MMMichelle L. Mazurek
Michelle L. Mazurek
LBLujo Bauer
Lujo Bauer
SESerge Egelman
Serge Egelman

1 May 2012
Verified
Conference Paper
Open access
PKPatrick Gage Kelley
Patrick Gage Kelley
SKSaranga Komanduri
Saranga Komanduri
MMMichelle L. Mazurek
Michelle L. Mazurek
RSRichard Shay
Richard Shay
TVTimothy Vidas
Timothy Vidas
JLJulio Lopez
Julio Lopez
Text-based passwords remain the dominant authentication method in computer systems, despite significant advancement in attackers' capabilities to perform password cracking. In response to this threat, password composition policies have grown increasingly complex. However, there is insufficient research defining metrics to characterize password strength and using them to evaluate password-composition policies. In this paper, we analyze 12,000 passwords collected under seven composition policies via an online study. We develop an efficient distributed method for calculating how effectively several heuristic password-guessing algorithms guess passwords. Leveraging this method, we investigate (a) the resistance of passwords created under different conditions to guessing, (b) the performance of guessing algorithms under different training sets, (c) the relationship between passwords explicitly created under a given composition policy and other passwords that happen to meet the same requirements, and (d) the relationship between guess ability, as measured with password-cracking algorithms, and entropy estimates. Our findings advance understanding of both password-composition policies and metrics for quantifying password security.

14 July 2010
Verified
Conference Paper
Open access
PDF file
RSRichard Shay
Richard Shay
SKSaranga Komanduri
Saranga Komanduri
PKPatrick Gage Kelley
Patrick Gage Kelley
PLPedro Giovanni Leon
Pedro Giovanni Leon
MMMichelle L. Mazurek
Michelle L. Mazurek
LCLorrie Faith Cranor
Lorrie Faith Cranor