Skip to content

Joan Feigenbaum

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

46

Venues

21

Active years

1985–2022

Best venue rank

A*

Where they publish

Papers

46 indexed papers, newest first.

YearVenueTitleAuthors
2022NSPWToward User Control over Information Access: A Sociotechnical Approach.Caleb Malchik, Joan Feigenbaum
2017NDSSAvoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection.Aaron Johnson, Rob Jansen, Aaron D. Jaggard, Joan Feigenbaum, Paul Syverson
2016FCUsing Intel Software Guard Extensions for Efficient Two-Party Secure Function Evaluation.Debayan Gupta, Benjamin Mood, Joan Feigenbaum, Kevin R. B. Butler, Patrick Traynor
2014CCSReuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values.Benjamin Mood, Debayan Gupta, Kevin R. B. Butler, Joan Feigenbaum
2014FCPractical and Privacy-Preserving Policy Compliance for Outsourced Data.Giovanni Di Crescenzo, Joan Feigenbaum, Debayan Gupta, Euthimios Panagos, Jason Perry, Rebecca N. Wright
2014SCNSystematizing Secure Computation for Research and Decision Support.Jason Perry, Debayan Gupta, Joan Feigenbaum, Rebecca N. Wright
2013CCSStructural cloud audits that protect private information.Hongda Xiao, Bryan Ford, Joan Feigenbaum
2012HOTNETSA new approach to interdomain routing based on secure multi-party computation.Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford, Scott Shenker
2012LICSPrivacy, Anonymity, and Accountability in Ad-Supported Services.Joan Feigenbaum
2012PODCBrief announcement: on the resilience of routing tables.Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla
2011NSPWTowards a formal model of accountability.Joan Feigenbaum, Aaron D. Jaggard, Rebecca N. Wright
2007FCA Model of Onion Routing with Provable Anonymity.Joan Feigenbaum, Aaron Johnson, Paul F. Syverson
2006CIKMFinding highly correlated pairs efficiently with powerful pruning.Jian Zhang, Joan Feigenbaum
2005SODAGraph distances in the streaming model: the value of space.Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
2004ESORICSTowards a Theory of Data Entanglement: (Extended Abstract).James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong
2004ICALPOn Graph Problems in a Semi-streaming Model.Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
2004PODCMechanism design for policy routing.Joan Feigenbaum, Rahul Sami, Scott Shenker
2002PODCA BGP-based mechanism for lowest-cost routing.Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker
2001CCSPrivacy Engineering for Digital Rights Management Systems.Joan Feigenbaum, Michael J. Freedman, Tomas Sander, Adam Shostack
2001CCSTaking the Copy Out of Copyright.Ernest Miller, Joan Feigenbaum
2001FCNonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation.Ninghui Li, Joan Feigenbaum
2001ICALPSecure Multiparty Computation of Approximations.Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright
2000SODATesting and spot-checking of data streams (extended abstract).Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan
2000STOCSharing the cost of muliticast transmissions (preliminary version).Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
2000SPA Practically Implementable and Tractable Delegation Logic.Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum
1999FCFair Use, Intellectual Property, and the Information Economy (Panel Session Summary).Jon Callas, Joan Feigenbaum, David M. Goldschlag, Erin Sawyer
1999FOCSAn Approximate LJoan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan
1999SODAA Formal Treatment of Remotely Keyed Encryption.Matt Blaze, Joan Feigenbaum, Moni Naor
1998EuroCryptA Formal Treatment of Remotely Keyed Encryption.Matt Blaze, Joan Feigenbaum, Moni Naor
1998FCCompliance Checking in the PolicyMaker Trust Management System.Matt Blaze, Joan Feigenbaum, Martin Strauss
1998STACSComplexity of Problems on Graphs Represented as OBDDs (Extended Abstract).Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan
1997STACSAn Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract).Joan Feigenbaum, Martin Strauss
1996ICALPA Formal Framework for Evaluating Heuristic Programs.Lenore Cowen, Joan Feigenbaum, Sampath Kannan
1996SPDecentralized Trust Management.Matt Blaze, Joan Feigenbaum, Jack Lacy
1993STOCProbabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
1991ASIACRYPTA Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems.Joan Feigenbaum, Rafail Ostrovsky
1991CAVComplexity Results for POMSET Languages.Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund
1991FOCSLanguages that Are Easier than their ProofsRichard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser
1990CRYPTOSecurity with Low Communication Overhead.Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway
1990CRYPTOHiding Instances in Zero-Knowledge Proof Systems (Extended Abstract).Donald Beaver, Joan Feigenbaum, Victor Shoup
1990STACSHiding Instances in Multioracle Queries.Donald Beaver, Joan Feigenbaum
1988CRYPTOOn Generating Solved Instances of Computational Problems.Martn Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra
1988STACSA Simple Protocol for Secure Circuit Evaluation.Martn Abadi, Joan Feigenbaum
1987STOCOn Hiding Information from an Oracle (Extended Abstract)Martn Abadi, Joan Feigenbaum, Joe Kilian
1986AAAIFactorization in Experiment Generation.Devika Subramanian, Joan Feigenbaum
1985CRYPTOEncrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?Joan Feigenbaum