Department of Computer Science and Engineering
University of California, San Diego
|Office:||EBU 3B 3124|
|Address:||UCSD Dept. of CSE
9500 Gilman Drive, MC 0404
La Jolla, CA 92093-0404
On this page:
I am a member of the program committees of Usable Security (USEC) 2013, USENIX Security 2013, and Crypto 2013.
Recent publications include:
H. Shacham and B. Waters. “Compact Proofs of Retrievability.” J. Cryptology, 2013. To appear. (Details; PDF)
K. Mowery, M. Wei, D. Kohlbrenner, H. Shacham, and S. Swanson. “Welcome to the Entropics: Boot-Time Entropy in Embedded Devices.” In W. Lee, A. Perrig, and M. Backes, eds., Proceedings of IEEE Security and Privacy (“Oakland”) 2013. IEEE Computer Society, May 2013. To appear.
S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters. “Sequential Aggregate Signatures and Multisignatures without Random Oracles.” J. Cryptology 26(2):340–73, Apr. 2013. (Details; PDF)
S. Checkoway and H. Shacham. “Iago Attacks: Why the System Call API is a Bad Untrusted RPC Interface.” In R. Bodik, ed., Proceedings of ASPLOS 2013. ACM Press, Mar. 2013. To appear. (Details; PDF)
K. Benson, H. Shacham, and B. Waters. “The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions.” In E. Dawson, ed., Proceedings of CT-RSA 2013. LNCS. Springer-Verlag, Feb. 2013. To appear. (Details; PDF)
A. Sarwate, S. Checkoway and H. Shacham. “Risk-limiting Audits for Nonplurality Elections.” Statistics, Politics, and Policy, 3(3):29–64, Jan. 2013. (Details; PDF)
K. Mowery, S. Keelveedhi, and H. Shacham. “Are AES x86 Cache Timing Attacks Still Feasible?” (Short Paper). In S. Capkun and S. Kamara, eds., Proceedings of CCSW 2012. ACM Press, Oct. 2012. (Details; PDF)
K. Mowery and H. Shacham. “Pixel Perfect: Fingerprinting Canvas in HTML5.” In M. Fredrikson, ed., Proceedings of W2SP 2012. IEEE Computer Society, May 2012. (Details; PDF)
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)
All my publications are available online.
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.
Photo copyright 2010 by Nick Vossbrink. All rights reserved.
Portrait copyright 2011 by Natalie Bessell. All rights reserved.
BSD Daemon Copyright 1988 by Marshall Kirk McKusick.
All Rights Reserved.
Permission to use the daemon may be obtained from:
or via email at