Hovav Shacham

Assistant Professor
Department of Computer Science and Engineering
University of California, San Diego

Office:	EBU 3B 3124
E-mail:	hovav@cs.ucsd.edu
Address:	UCSD Dept. of CSE 9500 Gilman Drive, MC 0404 La Jolla, CA 92093-0404
Phone:	(858) 822-7921
Fax:	(858) 534-7029

On this page:

Professional Activities
Recent Publications (and all publications)
Teaching
Students
Brief Biography

Elsewhere:

Professional Activities

Member, program committees of SIGCOMM 2012 and EVT/WOTE 2012.

Member, editorial board of the AIMS journal Advances in Mathematics of Communication.

I am program co-chair (with Vanessa Teague) of EVT/WOTE 2011, held together with USENIX Security 2011.

Publications

Recent publications include:

R. Roemer, E. Buchanan, H. Shacham, and S. Savage. “Return-Oriented Programming: Systems, Languages, and Applications.” ACM Trans. Info. & Sys. Security 15(1):2, Mar. 2012. (Details; PDF)

K. Benson, R. Dowsley, and H. Shacham. “Do You Know Where Your Cloud Files Are?” In T. Ristenpart and C. Cachin, eds., Proceedings of CCSW 2011. ACM Press, Oct. 2011. (Details; PDF)

B. Vattikonda, S. Das, and H. Shacham. “Eliminating Fine Grained Timers in Xen” (Short Paper). In T. Ristenpart and C. Cachin, eds., Proceedings of CCSW 2011. ACM Press, Oct. 2011. (Details; PDF)

G. Wang, H. Liu, S. Becerra, K. Wang, S. Belongie, H. Shacham, and S. Savage. “Verilogo: Proactive Phishing Detection via Logo Recognition.” Aug. 2011. UCSD Technical Report CS2011-0969. (Details; PDF)

S. Checkoway, D. McCoy, B. Kantor, D. Anderson, H. Shacham, S. Savage, K. Koscher, A. Czeskis, F. Roesner, and T. Kohno. “Comprehensive Experimental Analyses of Automotive Attack Surfaces.” In D. Wagner, ed., Proceedings of USENIX Security 2011. USENIX, Aug. 2011. (Details)

S. Meiklejohn, K. Mowery, S. Checkoway, and H. Shacham. “The Phantom Tollbooth: Privacy-Preserving Electronic Toll Collection in the Presence of Driver Collusion.” In D. Wagner, ed., Proceedings of USENIX Security 2011. USENIX, Aug. 2011. (Details; PDF)

A. Sarwate, S. Checkoway and H. Shacham. “Risk-limiting Audits for Nonplurality Elections.” Jun. 2011. UCSD Technical Report CS2011-0967. (Details; PDF)

K. Mowery, D. Bogenreif, S. Yilek, and H. Shacham. “Fingerprinting Information in JavaScript Implementations.” In H. Wang, ed., Proceedings of W2SP 2011. IEEE Computer Society, May 2011. (Details; PDF)

D. Jang, A. Venkataraman, G.M. Sawka, and H. Shacham. “Analyzing the Crossdomain Policies of Flash Applications.” In H. Wang, ed., Proceedings of W2SP 2011. IEEE Computer Society, May 2011. (Details; PDF)

T. Ristenpart, H. Shacham, and T. Shrimpton, “Careful with Composition: Limitations of the Indifferentiability Framework.” In K. Paterson, ed., Proceedings of Eurocrypt 2011, vol. 6632 of LNCS, pages 487–506. Springer-Verlag, May 2011. (Details)

All my publications are available online.

Teaching

CSE 105, Automata and Computability Theory: Winter 2012; Winter 2011; Fall 2009.
CSE 127, Computer Security: Fall 2011; Spring 2011; Spring 2010; Fall 2008; Winter 2008.
CSE 227, (Graduate) Computer Security: Winter 2011; Winter 2009.
CSE 208, Pairings in Cryptography: Winter 2010; Weizmann Institute, Spring 2006.

Current Students

Ph.D. students:

Former Students

Grace Wang (M.S. 2010) → Qualcomm

Brief Biography

Hovav Shacham joined UC San Diego’s Department of Computer Science and Engineering in Fall 2007.

Shacham received his Ph.D. in computer science in 2005 from Stanford University, where he had also earned, in 2000, an A.B. in English. His Ph.D. advisor was Dan Boneh. In 2006 and 2007, he was a Koshland Scholars Program postdoctoral fellow at the Weizmann Institute of Science, hosted by Moni Naor.

Shacham’s research interests are in applied cryptography, systems security, and tech policy.

He is one of the pioneers in using pairings—computable bilinear maps over certain elliptic curves—to construct cryptographic systems. His thesis, “New Paradigms in Signature Schemes,” was runner up for the Stanford Department of Computer Science’s Arthur L. Samuel Thesis Award, and was nominated for the ACM Doctoral Dissertation Competition. At the Weizmann, Shacham taught a survey on pairings in cryptography, one of the first such courses to be offered.

In 2007, Shacham participated in California Secretary of State Debra Bowen’s “Top-to-Bottom” review of the voting machines certified for use in California. He was a member of the team reviewing Hart InterCivic source code; the report he co-authored was cited by the Secretary in her decision to withdraw approval from Hart voting machines.