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:
Co-program chair (with Brent Waters) of Pairing 2009.
Member, program committees of CCS 2008, NDSS 2009, PKC 2009, ACNS 2009, and USENIX Security 2009.
Member, editorial board of the AIMS journal Advances in Mathematics of Communication.
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:
H. Shacham and B. Waters. “Compact Proofs of Retrievability.” In J. Pieprzyk, ed., Proceedings of Asiacrypt 2008, LNCS. Springer-Verlag, Dec. 2008. To appear. (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. ACM Press, Oct. 2008. To appear. (Details; PDF)
J.A. Halderman, E. Rescorla, H. Shacham, and D. Wagner. “You Go to Elections with the Voting System You Have: Stop-Gap Mitigations for Deployed Voting Systems.” In D. Dill and T. Kohno, eds., Proceedings of EVT 2008. USENIX/ACCURATE, July 2008. (Details; PDF)
H. Shacham. “The Geometry of Innocent Flesh on the Bone: Return-into-libc without Function Calls (on the x86).” In S. De Capitani Di Vimercati and P. Syverson, eds., Proceedings of CCS 2007, pages 552–561. ACM Press, Oct. 2007. (Details; PDF)
S. Inguva, E. Rescorla, H. Shacham, and D. Wallach. Source Code Review of the Hart InterCivic Voting System. Part of California Secretary of State Debra Bowen’s “Top-to-Bottom” Review of the voting machines used in California, 2007. (Details)
All my publications are available online.
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.
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.