Data exploitation and privacy protection in the era of data sharing [.pptx]
Lihi Idan, Thesis Defense, August 27, 2021
Suitable for a general Computer Science audience

Accountability in Computing [.pdf]
Joan Feigenbaum, Talk at the Northwestern IDEAL Workshop on Evaluation and Accountability, April 30, 2021
Suitable for a general audience

Privacy-Preserving Machine Learning [video]
Joan Feigenbaum, Amazon Re:invent talk, December 10, 2020
Suitable for a Security and Crypto audience

Computer Science and Law: Opportunities and Research Directions [video] [.pdf slides]
Joan Feigenbaum, Distinguished Lecture, Columbia University Computer Science Department, November 4, 2020
Suitable for a general audience

Show me your friends, and I will tell you whom you vote for: Predicting voting behavior in social networks [.pptx]
Lihi Idan, Talk at the 2019 IEEE/ACM International Conference on Advances in Social-Network Analysis and Mining, August 29, 2019
Suitable for a data-mining audience

Encryption and Surveillance: Why the "Exceptional-Access" Question Won't Just Go Away [.pdf]
Joan Feigenbaum, Talk to the Boston University CS and Law Group, October 10, 2018
Suitable for a general audience

Privacy-Preserving Surveillance [.pdf]
Joan Feigenbaum, Talk at the SUNY Security and Privacy Day, October 13, 2017
Suitable for a Security and Crypto audience

Multiple Objectives of Lawful-Surveillance Protocols [.pdf]
Joan Feigenbaum, Talk at 25th Cambridge Security Protocols Workshop, March 20, 2017
Suitable for a Crypto audience

Practical and Deployable Secure Multi-Party Computation [.pptx]
Debayan Gupta, Thesis Defense, May 11, 2016
Suitable for a general Computer Science audience

Design and Implementation of Privacy-Preserving Surveillance [.pptx] [.pdf]
Aaron Segal, Thesis Defense, May 11, 2016
Suitable for a general Computer Science audience

On the use of security and privacy technology as a plot device [.pptx]
Joan Feigenbaum, Talk at 23rd Cambridge Security Protocols Workshop, April 1, 2015
Suitable for a general Computer Science audience

Accountability in Cloud Computing and Distributed Computer Systems [.pdf]
Hongda Xiao, Thesis Defense, September 17, 2014
Suitable for a general Computer Science audience

Dissent: Accountable, Anonymous Communication [.ppt]
Joan Feigenbaum, Distinguished Lecture at Univ. of Illinois at Chicago, April 27, 2011
Earlier version given at Penn State in December 2010.
Suitable for a general Computer Science audience

Implementation and Evaluation of Privacy-Preserving Protocols [.pdf]
Felipe Saint-Jean, Thesis Defense, July 21, 2010
Suitable for a general Computer Science audience

Accountability in International Data Exchange [.ppt]
Joan Feigenbaum, Keynote talk at Inco-Trust Workshop, May 4, 2010
Suitable for a general Computer Science audience or a Technology and Policy audience

Theory and Applications of Extractable Functions [.ppt]
Ramzi Ronny Dakdouk, Thesis Defense, July 2, 2009
Suitable for a Theoretical Computer Science audience

Design and Analysis of Efficient Anonymous-Communication Protocols [.pdf]
Aaron Johnson, Thesis Defense, July 1, 2009
Suitable for a general Computer Science audience

Approximate Privacy: Foundations and Quantification [.ppt]
Joan Feigenbaum, Distinguished Lecture at Boston University, UMass Amherst, and Northwestern University, May 2009
Suitable for a general Computer Science audience

Modeling and Analysis of Anonymous-Communications Systems [.ppt]
Joan Feigenbaum, Invited talk at the 2008 Women in Theory Symposium (mentoring workshop), June 2008
Suitable for a Theoretical Computer Science audience

Theory of Networked Computing? [.ppt]
Joan Feigenbaum, Invited talk at the final workshop for the DELIS project, February 27, 2008
Earlier versions given at FuDiDo III and at DIMACS in 2007.
Suitable for a Theoretical Computer Science audience

Incentive-Compatible Interdomain Routing [.ppt]
Vijay Ramachandran, Talk at 2006 Conference on Electronic Commerce, June 13, 2006
Suitable for a Theoretical Computer Science audience or a Networking audience

Progress on the PORTIA Project [.ppt]
Joan Feigenbaum, Colloquium given at Google on June 5, 2006
Earlier versions given at Stevens, Rutgers, NYU, and University of Michigan in 2004 and 2005.
Suitable for a general Computer Science audience

Massive Data Streams in Graph Theory and Computational Geometry [.ppt]
Jian Zhang, Thesis defense, June 15, 2005
Suitable for a Theoretical Computer Science audience

Foundations of Inter-Domain Routing [.ppt]
Vijay Ramachandran, Thesis defense, April 20, 2005
Suitable for a general Computer Science audience

Are "Trusted Platforms" Useful for Privacy Protection? [.ppt]
Joan Feigenbaum, PORTIA Workshop at Stanford, July 7-8, 2004.
Suitable for a Computer Science audience or a Law-and-Technology audience.

Privacy, Integrity, and Incentive Compatibility in Computations with Untrusted Parties [.ppt], [.pdf]
Sheng Zhong, Thesis defense, June 29, 2004
Suitable for a general Computer Science audience

Incentives and Internet Algorithms [.ppt], [.pdf]
Joan Feigenbaum and Scott Shenker, Tutorial at 2004 Conf. on Integer Programming and Combinatorial Optimization, June 7, 2004
Suitable for a Theoretical Computer Science audience
(Supercedes earlier survey talks given at Stanford, Columbia, NEC, Microsoft, DIALM'02, and PODC'03.)

Control of Personal Information [.ppt], [.pdf]
Joan Feigenbaum and Peter Swire, Dialogue between a Technologist and a Lawyer given at Harvard on April 23, 2004
Suitable for a general audience.

Sensitive Information in a Wired World [.ppt], [.pdf]
Joan Feigenbaum, Overview of the PORTIA project given at Univ. of Michigan on April 8, 2004
Suitable for a "law and technology" audience.
(Supercedes earlier versions of this talk given at Yale Law School and NYU Law School.)

Computation in a Distributed Information Market [.ppt], [.pdf]
Rahul Sami, Talk at 2003 Conference on Electronic Commerce, June 12, 2003
Suitable for a Theoretical Computer Science audience

Distributed Algorithmic Mechanism Design for Network Problems [.ppt], [.pdf]
Rahul Sami, Thesis defense, May 7, 2003
Suitable for a general Computer Science audience

Computing Diameter in the Streaming and Sliding-Window Models [.ppt]
Jian Zhang, Talk at a DIMACS MDS Working-Group meeting, March 25, 2003
Suitable for a Theoretical Computer Science audience

A BGP-based Mechanism for Lowest-Cost Routing [.ppt], [.pdf]
Rahul Sami, Talk at 2002 Symp. on Principles of Distributed Computing, July 23, 2002
Suitable for a general Computer Science audience

Fundamental Open Questions in Distributed Mechanism Design [.ps], [.pdf]
Scott Shenker, Workshop Talk at DIMACS, October 31, 2001
DAMD Overview suitable for an Economics audience