Hovav Shacham
Hovav ShachamAssistant 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 CS&E
9500 Gilman Drive, MC 0404 La Jolla, CA 92093-0404 |
| Phone: | (858) 822-7921 |
On this page:
Elsewhere:
Member, program committees of CCS 2009, NDSS 2010, IEEE Security & Privacy (“Oakland”) 2010, and USENIX Security 2010.
Member, editorial board of the AIMS journal Advances in Mathematics of Communication.
I was program co-chair (with Brent Waters) of Pairing 2009, held at Stanford University August 12–14th.
I was a member of California Secretary of State Debra Bowen’s 2007 “Top-to-Bottom“ Review of the voting machines used in California.
Recent publications include:
R. Roemer, E. Buchanan, H. Shacham, and S. Savage. “Return-Oriented Programming: Systems, Languages, and Applications.” 2009. In review. (Details; PDF)
M. Bellare, Z. Brakerski, M. Naor, T. Ristenpart, G. Segev, H. Shacham, and S. Yilek. “Hedged Public-Key Encryption: How to Protect Against Bad Randomness.” In M. Matsui, ed., Proceedings of Asiacrypt 2009, LNCS. Springer-Verlag, Dec. 2009. (Details)
T. Ristenpart, E. Tromer, H. Shacham, and S. Savage. “Hey, You, Get Off of My Cloud! Exploring Information Leakage in Third-Party Compute Clouds.” In S. Jha and Angelos Keromytis, eds., Proceedings of CCS 2009. ACM Press, Nov. 2009. To appear. (Details; PDF)
S. Yilek, E. Rescorla, H. Shacham, B. Enright, and S. Savage. “When Private Keys are Public: Results from the 2008 Debian OpenSSL Vulnerability.” In A. Feldmann and L. Mathy, eds., Proceedings of IMC 2009. ACM Press, Nov. 2009. To appear. (Details; PDF)
N. Heninger and H. Shacham. “Reconstructing RSA Private Keys from Random Key Bits.” In S. Halevi, ed., Proceedings of Crypto 2009, vol. 5677 of LNCS, pages 1–17. Springer-Verlag, Aug. 2009. (Details; PDF)
M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya, and H. Shacham. “Randomizable Proofs and Delegatable Anonymous Credentials.” In S. Halevi, ed., Proceedings of Crypto 2009, vol. 5677 of LNCS, pages 108–25. Springer-Verlag, Aug. 2009. (Details; PDF)
S. Checkoway, A.J. Feldman, B. Kantor, J.A. Halderman, E.W. Felten, and H. Shacham. “Can DREs Provide Long-Lasting Security? The Case of Return-Oriented Programming and the AVC Advantage.” In D. Jefferson and J.L. Hall and T. Moran, eds., Proceedings of EVT 2009. USENIX/ACCURATE/IAVoSS, Aug. 2009. (Details; PDF)
H. Shacham and B. Waters. “Compact Proofs of Retrievability.” In J. Pieprzyk, ed., Proceedings of Asiacrypt 2008, vol. 5350 of LNCS, pages 90–107. Springer-Verlag, Dec. 2008. (Details; PDF)
E. Buchanan, R. Roemer, H. Shacham, and S. Savage. “When Good Instructions Go Bad: Generalizing Return-Oriented Programming to RISC.” In P. Syverson and S. Jha, eds., Proceedings of CCS 2008, pages 27–38. ACM Press, Oct. 2008. (Details; PDF)
All my publications are available online.
Fall 2009: CSE 105, Automata and Computability Theory.
Winter 2009: CSE 227, (Graduate) Computer Security.
Fall 2008: CSE 127, Computer Security.
Winter 2008: CSE 127, Computer Security.
In spring semester 2006, I taught a course on pairings in cryptography at the Weizmann.
Ph.D. students:
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” 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.