By category:
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)
H. Shacham. New Paradigms in Signature Schemes. Ph.D. thesis, Stanford University, 2005. (Details; official PDF; hyperref PDF)
H. Shacham, D. Boneh, and E. Rescorla. “Client-Side Caching for TLS.” ACM Trans. Info. & Sys. Security, 7(4):553–75, Nov. 2004. (Details; PDF)
D. Boneh, B. Lynn, and H. Shacham. “Short Signatures from the Weil Pairing.” J. Cryptology 17(4):297–319, Sep. 2004. (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)
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)
H. Shacham and B. Waters. “Efficient Ring Signatures Without Random Oracles.” In T. Okamoto and X. Wang, eds., Proceedings of PKC 2007, vol. 4450 of LNCS, pages 166–80. Springer-Verlag, Apr. 2007. (Details; PDF)
X. Boyen, H. Shacham, E. Shen, and B. Waters. “Forward-Secure Signatures with Untrusted Update.” In R. Wright, ed., Proceedings of CCS 2006, pages 191–200. ACM Press, Oct. 2006. (Details; PDF)
S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters. “Sequential Aggregate Signatures and Multisignatures without Random Oracles.” In S. Vaudenay, ed., Proceedings of Eurocrypt 2006, vol. 4004 of LNCS, pages 465–85. Springer-Verlag, May 2006. (Details; PDF)
D. Boneh and H. Shacham. “Group Signatures with Verifier-Local Revocation.” In B. Pfitzmann and Peng Liu, eds., Proceedings of CCS 2004, pages 168–77. ACM Press, Oct. 2004. (Details; PDF)
H. Shacham, M. Page, B. Pfaff, E.-J. Goh, N. Modadugu, and D. Boneh. “On the Effectiveness of Address-Space Randomization.” In B. Pfitzmann and Peng Liu, eds., Proceedings of CCS 2004, pages 298–307. ACM Press, Oct. 2004. (Details; PDF)
D. Boneh, X. Boyen, and H. Shacham. “Short Group Signatures.” In M. Franklin, ed., Proceedings of Crypto 2004, vol. 3152 of LNCS, pages 41–55. Springer-Verlag, Aug. 2004. (Details; PDF)
A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham. “Sequential Aggregate Signatures from Trapdoor Permutations.” In C. Cachin and J. Camenisch, eds., Proceedings of Eurocrypt 2004, vol. 3027 of LNCS, pages 74–90. Springer-Verlag, May 2004. (Details; PDF)
D. Boneh, C. Gentry, B. Lynn, and H. Shacham. “Aggregate and Verifiably Encrypted Signatures from Bilinear Maps.” In E. Biham, ed., Proceedings of Eurocrypt 2003, vol. 2656 of LNCS, pages 416–32. Springer-Verlag, May 2003. (Details; PDF)
E.-J. Goh, H. Shacham, N. Modadugu, D. Boneh. “SiRiUS: Securing Remote Untrusted Storage.” In M. Tripunitara, ed., Proceedings of NDSS 2003, pages 131–45. Internet Society, Feb. 2003. (Details; PDF)
H. Shacham and D. Boneh. “Fast-Track Session Establishment for TLS.” In M. Tripunitara, ed., Proceedings of NDSS 2002, pages 195–202. Internet Society, Feb. 2002. Extended abstract of [SBR04] journal paper above, with E. Rescorla. (Details)
D. Boneh, B. Lynn, and H. Shacham. “Short Signatures from the Weil Pairing.”. In C. Boyd, ed., Proceedings of Asiacrypt 2001, vol. 2248 of LNCS, pages 514–32. Springer-Verlag, Dec. 2001. Extended abstract of [BLS04] journal paper above. (Details)
H. Shacham and D. Boneh. “Improving SSL Handshake Performance via Batching.” In D. Naccache, ed., Proceedings of RSA 2001, vol. 2020 of LNCS, pages 28–43. Springer-Verlag, Apr. 2001. (Details; PDF)
R. Roemer, E. Buchanan, H. Shacham, and S. Savage. “Return-Oriented Programming: Systems, Languages, and Applications.” 2009. In review. (Details; PDF)
H. Shacham. “The BBG HIBE Has Limited Delegation.” Cryptology ePrint Archive, report 2007/201, May 2007. (Details; PDF)
H. Shacham. “A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants.” Cryptology ePrint Archive, report 2007/074, Feb. 2007. (Details; PDF)
D. Boneh, C. Gentry, B. Lynn, and H. Shacham. “A Survey of Two Signature Aggregation Techniques” (survey). RSA CryptoBytes, vol. 6, no. 2 (2003), pages 1–9. (Details; PDF)
D. Boneh and H. Shacham. “Fast Variants of RSA” (survey). RSA CryptoBytes, vol. 5, no. 1 (2002), pages 1–9. (Details; PDF)
“Return-Oriented Programming: Exploitation without Code Injection.” Joint work with E. Buchanan, R. Roemer, and S. Savage. Given at Black Hat USA 2008 Briefings. Aug. 2008. (Details; PDF slides)
H. Shacham and B. Waters, eds., Proceedings of Pairing 2009, vol. 5671 of LNCS, Springer-Verlag, Aug. 2009.