Joan Feigenbaum | Academic Influence

Joan Feigenbaum's AcademicInfluence.com Rankings

Joan Feigenbaum

Computer Science

#1740

World Rank

#1803

Historical Rank

#829

USA Rank

Distributed Computing

#15

World Rank

#16

Historical Rank

#6

USA Rank

Algorithms

#295

World Rank

#299

Historical Rank

#33

USA Rank

Database

#4818

World Rank

#5005

Historical Rank

#728

USA Rank

computer-science Degrees

Download Badge

Computer Science

Joan Feigenbaum's Degrees

PhD Computer Science Stanford University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Joan Feigenbaum Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Joan Feigenbaum is a theoretical computer scientist with a background in mathematics. She is the Grace Murray Hopper Professor of Computer Science at Yale University. At Yale she also holds a courtesy appointment in the Department of Economics. Feigenbaum co-invented the computer-security research area of trust management.

(See a Problem?)

Joan Feigenbaum's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Decentralized trust management (1996) (2395)
The KeyNote Trust-Management System Version 2 (1999) (782)
The Role of Trust Management in Distributed Systems Security (2001) (584)
Advances in Cryptology-Crypto 91 (1992) (542)
Delegation logic: A logic-based approach to distributed authorization (2003) (492)
Sharing the Cost of Multicast Transmissions (2001) (451)
Distributed algorithmic mechanism design: recent results and future directions (2002) (444)
Information accountability (2008) (443)
A BGP-based mechanism for lowest-cost routing (2002) (439)
The KeyNote trust management system version2, IETF RFC 2704 (1999) (381)
REFEREE: Trust Management for Web Applications (1997) (365)
KeyNote: Trust Management for Public-Key Infrastructures (Position Paper) (1998) (357)
On hiding information from an oracle (1987) (313)
Compliance Checking in the PolicyMaker Trust Management System (1998) (293)
Hiding Instances in Multioracle Queries (1990) (255)
Secure multiparty computation of approximations (2001) (199)
On the random-self-reducibility of complete sets (1991) (195)
The KeyNote Trust-Management System (1998) (186)
On graph problems in a semi-streaming model (2005) (183)
Graph distances in the streaming model: the value of space (2005) (147)
A practically implementable and tractable delegation logic (2000) (123)
Graph Distances in the Data-Stream Model (2008) (120)
A logic-based knowledge representation for authorization with delegation (1999) (120)
Secure circuit evaluation (1990) (112)
Approximation and collusion in multicast cost sharing (2003) (107)
Privacy Engineering for Digital Rights Management Systems (2001) (105)
Security with Low Communication Overhead (1990) (99)
Hardness Results for Multicast Cost Sharing (2002) (97)
Towards a formal model of accountability (2011) (85)
Distributed algorithmic mechanism design (2003) (83)
Mechanism design for policy routing (2004) (77)
Private web search (2007) (76)
Advances in cryptology--CRYPTO '91 : proceedings (1992) (76)
KeyNote : Trust management for public-key infrastructures. Discussion (1999) (75)
Random debaters and the hardness of approximating stochastic functions (1994) (74)
Computing Diameter in the Streaming and Sliding-Window Models (2002) (73)
Sharing the cost of muliticast transmissions (preliminary version) (2000) (71)
Learning-based anomaly detection in BGP updates (2005) (69)
Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? (1985) (68)
A Model of Onion Routing with Provable Anonymity (2007) (64)
Incentive-compatible interdomain routing (2006) (59)
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (1993) (59)
A polynomial time algorithm for finding the prime factors of cartesian-product graphs (1985) (57)
Factorization in Experiment Generation (1986) (56)
Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values (2014) (54)
A new approach to interdomain routing based on secure multi-party computation (2012) (54)
Computation in a distributed information market (2003) (53)
A formal treatment of remotely keyed encryption (1998) (53)
Locally random reductions: Improvements and applications (1997) (52)
Secure computation of surveys (2004) (51)
Using Intel Software Guard Extensions for Efficient Two-Party Secure Function Evaluation (2016) (50)
Probabilistic analysis of onion routing in a black-box model (2011) (48)
Finding the prime factors of strong direct product graphs in polynomial time (1992) (48)
A game-theoretic classification of interactive complexity classes (1995) (47)
Testing and Spot-Checking of Data Streams (2000) (47)
The Complexity of Problems on Graphs Represented as OBDDs (1998) (44)
Proceedings of the forty-fifth annual ACM symposium on Theory of computing (2013) (43)
Computational challenges in e-commerce (2009) (36)
Managing trust in an information-labeling system (1997) (35)
Open Questions, Talk Abstracts, and Summary of Discussions (1989) (34)
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions (1995) (34)
Probabilistic analysis of onion routing in a black-box model (2007) (34)
Accountability and deterrence in online life (2011) (33)
Subjective-cost policy routing (2007) (33)
Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation (2002) (31)
Locally Random Reductions in Interactive Complexity Theory (1990) (31)
Lower bounds on random-self-reducibility (1990) (31)
Brief announcement: on the resilience of routing tables (2012) (30)
Preventing Active Timing Attacks in Low-Latency Anonymous Communication (2010) (29)
Approximate privacy: foundations and quantification (extended abstract) (2010) (29)
Cryptographic Protection of Databases and Software (1989) (28)
On the Resilience of Routing Tables (2012) (27)
On Generating Solved Instances of Computational Problems (1988) (27)
Economics and Computation (2008) (27)
Information Structures (1999) (26)
On being incoherent without being very hard (2005) (26)
Languages that are easier than their proofs (1991) (26)
Towards a theory of data entanglement (2007) (25)
Trust Management and Proof-Carrying Code in Secure Mobile-Code Applications (1997) (25)
Finding highly correlated pairs efficiently with powerful pruning (2006) (25)
Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection (2015) (24)
An approximate L/sup 1/-difference algorithm for massive data streams (1999) (24)
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time (1986) (23)
Testing and spot-checking of data streams (extended abstract) (2000) (23)
Two new kinds of biased search trees (1983) (22)
Distributed Computing and Cryptography (1991) (22)
Catching Bandits and Only Bandits: Privacy-Preserving Intersection Warrants for Lawful Surveillance (2014) (21)
On Factorable Extensions and Subgraphs of Prime Graphs (1989) (20)
Systematizing “ Accountability ” in Computer Science (2012) (19)
The power of adaptiveness and additional queries in random-self-reductions (1992) (18)
Systematizing Secure Computation for Research and Decision Support (2014) (18)
Complexity Results for Pomset Languages (1991) (18)
Approximate Privacy: Foundations and Quantification (2009) (18)
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract) (1990) (18)
On coherence, random-self-reducibility, and self-correction (1996) (17)
Economic Barriers to the Deployment of Existing Privacy Technologies (2002) (16)
Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism (1986) (15)
Proceedings of the 5th ACM conference on Electronic commerce (2004) (15)
Overview of the AT&T Labs Trust-Management Project (Position Paper) (1998) (14)
Seeking anonymity in an internet panopticon (2013) (14)
Taking the Copy Out of Copyright (2001) (12)
Structural cloud audits that protect private information (2013) (12)
Approximation and collusion in multicast cost sharing (extended abstract) (2001) (12)
Accountability and Deterrence in Online Life (Extended Abstract) (2011) (11)
Incrementally-Deployable Security for Interdomain Routing (2009) (11)
Flexibility as an Instrument in Digital Rights Management (2005) (11)
Practical and Privacy-Preserving Policy Compliance for Outsourced Data (2014) (11)
Implementing Privacy-Preserving Bayesian-Net Discovery for Vertically Partitioned Data (2005) (11)
Agents' Privacy in Distributed Algorithmic Mechanisms (2002) (10)
20,000 In League Under the Sea: Anonymous Communication, Trust, MLATs, and Undersea Cables (2015) (10)
A Simple Protocol for Secure Circuit Evaluation (1988) (10)
Proceedings of the 4th ACM workshop on Digital rights management (2004) (10)
Graph Distances in the DataStream Model (2015) (10)
PriFi: Low-Latency Anonymity for Organizational Networks (2017) (9)
Show me your friends, and I will tell you whom you vote for: Predicting voting behavior in social networks (2019) (9)
Multiple Objectives of Lawful-Surveillance Protocols (Transcript of Discussion) (2017) (8)
A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems (1991) (8)
Product graphs: some algorithmic and combinatorial results (graph isomorphism) (1986) (8)
On Hiding Information from an Oracle (Extended Abstract) (1987) (8)
On the Incommensurability of Laws and Technical Mechanisms: Or, What Cryptography Can't Do (2018) (8)
Privacy-Preserving Lawful Contact Chaining: [Preliminary Report] (2016) (8)
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract) (1998) (8)
Privacy-Preserving XGBoost Inference (2020) (7)
PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication (2016) (7)
Proceedings of the 3rd international workshop on Economics of networked systems (2008) (7)
Instance-Hiding Proof Systems (1999) (7)
PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment (2004) (7)
Open vs. closed systems for accountability (2014) (7)
Distributed computing and cryptography : proceedings of a DIMACS workshop held at the Nassau Inn in Princeton, New Jersey, October 4-6, 1989 (1991) (7)
Hardness Results for Multicast Cost Sharing (Extended Abstract) (2002) (7)
Representing Network Trust and Using It to Improve Anonymous Communication (2014) (6)
The Use of Coding Theory in Computational Complexity (2007) (6)
Introduction to the special issue on codes and complexity (1996) (6)
Master-Key Cryptosystems (1996) (6)
Open, privacy-preserving protocols for lawful surveillance (2016) (5)
Towards an Economic Analysis of Trusted Systems ( Position Paper ) (2004) (5)
Games, Complexity Classes, and Approximation Algorithms (1998) (5)
The future of computational complexity theory: part II (1996) (5)
Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology (1991) (4)
On the Feasibility of a Technological Response to the Surveillance Morass (2014) (4)
A Formal Treatment of Remotely KeyedEncryption ( Extended Abstract ) ? (2007) (4)
Privacy, integrity, and incentive-compatibility in computations with untrusted parties (2004) (4)
PriFi: A Low-Latency Local-Area Anonymous Communication Network (2017) (4)
Product Graphs: some algorithmic and combinatorial results (1986) (4)
Pricing Under the Threat of Piracy: Flexibility and Platforms for Digital Goods (2011) (4)
Massive data streams in graph theory and computational geometry (2005) (4)
A Nonmonotonic Delegation Logic with Prioritized Conflict Handling (2000) (4)
Foundations of inter-domain routing (2005) (4)
Approximate Privacy: PARs for Set Problems (2010) (3)
Inductive analysis of the internet protocol TLS. Discussion. Authors' reply (1999) (3)
An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract) (1997) (3)
Probabilistic Algorithms for Speedup (1993) (3)
Universal traversal sequences (1994) (3)
Proceedings of the 3rd ACM workshop on Digital rights management (2003) (3)
An Economic Analysis of User-Privacy Options in Ad-Supported Services (2012) (3)
Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Proceedings (1992) (3)
Economic and social sciences will drive Internet protocols and services into the future (2)
Accountability in Computing: Concepts and Mechanisms (2020) (2)
Towards a Theory of Data Entanglement: (Extended Abstract) (2004) (2)
Towards a theory of networked computation (2006) (2)
Secure Multiparty Computation of Approximations (Extended Abstract) (2001) (2)
Security and Privacy in Digital Rights Management (2002) (2)
On Heuristic Models, Assumptions, and Parameters (2022) (2)
Overview of the AT&T Labs Trust-Management Project (Transcript of Discussion) (1998) (2)
Equipartitions of graphs (1991) (2)
PRShare: A Framework for Privacy-preserving, Interorganizational Data Sharing (2022) (2)
Systemization of Secure Computation (2015) (2)
A Ga,me-Theoretic Classification of Interactive Complexity Classes (Est ended Abstract ) (1995) (2)
Usability of Browser-Based Tools for Web-Search Privacy (2010) (2)
PRShare: A Framework for Privacy-Preserving, Interorganizational Data Sharing (2020) (2)
Towards Better Definitions and Measures of Internet Security (2011) (2)
Analysis of Onion Routing in the Universally Composable Framework (2012) (1)
Security and Privacy in Digital Rights Management, ACM CCS-9 Workshop, DRM 2002, Washington, DC, USA, November 18, 2002, Revised Papers (2003) (1)
Two Remarks on Self-Correctability versus Random-Self-Reducibility (1994) (1)
Workshop Summary: Computational and Complexity Issues in Automated Verification (1996) (1)
Probabilistic Algorithms for Defeating Adversaries (1993) (1)
Security and privacy in the information economy. (1997) (1)
Agents ’ Privacy in Distributed Algorithmic Mechanisms ( Position Paper ) (2002) (1)
PriFi: Low-Latency Metadata Protection for Organizational Network (2017) (1)
Encryption and surveillance (2019) (1)
Session details: Invited talk (2008) (0)
Defining “Anonymity” in Networked Communication (2011) (0)
A Necessity of Shared Randomness 5 Final Remarks (1997) (0)
Report on DIMACS seminar series (1989) (0)
2001 annual meeting of the association for symbolic logic (2001) (0)
Overview of the AT&T labs trust-management project. Discussion. Authors' reply (1999) (0)
Session details: 8B (2008) (0)
Implementing PriFi ’ s Equivocation Protection Protocol Using the SDA Framework (2016) (0)
Fair Use, Intellectual Property, and the Information Economy (Panel Session Summary) (1999) (0)
Yale University Department of Computer Science Towards a Theory of Data Entanglement (2004) (0)
Selected papers of the 23rd annual ACM symposium on Theory of computing (1995) (0)
Insider fraud. Discussion. Authors' reply (1999) (0)
Theory of Networked Computation? (FuDiCo 2007 Position Paper) (2007) (0)
Graph Distances in the Data-Stream Model Graph Distances in the Data-Stream Model (2021) (0)
Making the Cut : Accounting for heterogeneous consumer behavior when developing copyright enforcement regimes that include internet disconnection Fall 2014 (0)
On the Use of Security and Privacy Technology as a Plot Device (Transcript of Discussion) (2015) (0)
Session details: Key management, key exchange, & pseudo-random generation (2005) (0)
Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006 (2006) (0)
Program Committee (2018) (0)
Privacy : in the context of past , present , and emerging technologies (2004) (0)
The trust shell game. Discussion. Authors' reply (1999) (0)
Report on DIMACS seminar series (1989) (0)
The Effects of-Differential Privacy on Machine Learning Accuracy (2019) (0)
Third party certification of HTTP service access statistics. Discussion. Authors' reply (1999) (0)
Privacy, Anonymity, and Accountability in Ad-Supported Services (2012) (0)
PRShare (2020) (0)
Delegation and not-so smart cards. Discussion. Authors' reply (1999) (0)
A Gift that Keeps on Giving: The Impact of Public-Key Cryptography on Theoretical Computer Science (2022) (0)
A new concept in protocols : Verifiable computational delegation. Discussion. Authors' reply (1999) (0)
Digital Rights Management (2002) (0)
Decentralized Thst Management (1999) (0)
Optimizing MPC for robust and scalable integer and floating-point arithmetic 36 (2016) (0)
Session details: Session 5 (2008) (0)
Multiple Objectives of Lawful-Surveillance Protocols (2017) (0)
Privacy-Preserving Discovery of Consensus Signatures (2010) (0)
A.2 Linear Summation Queries with 1-bit Answers a Lower Bounds A.1 the Single Database Case 7 Privacy with Respect to Coalitions (1996) (0)
Delegating trust. Discussion. Authors' reply (1999) (0)
Workshop report: NetEcon'08 (2008) (0)
Session details: Session 1 (2004) (0)
Defining 'Anonymity' in Networked Communication, Version 1 (2011) (0)
Secure fingerprinting using public-key cryptography. Discussion. Authors' reply (1999) (0)
Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, May 17-20, 2004 (2004) (0)
A formal framework for evaluating heuristic programs (1995) (0)
On the Feasibility of a Technological Response to the Surveillance Morass (Transcript of Discussion) (2014) (0)
PriFi: A Traffic-Analysis Resistant, Low-Latency Anonymous Communication Protocol for Local Area Networks (2018) (0)
The Private Database Ashley Green and Raghava Vellanki Independent Project – Spring 2004 (2005) (0)
PRiFi Networking for Tracking-Resistant Mobile Computing (2017) (0)
Optimistic Trust with realistic eNvestigators. Discussion. Authors' reply (1999) (0)
Software Quality and Infrastructure Protection for Diffuse Computing (2003) (0)
Proceedings of the ACM SIGCOMM 2008 Workshop on Economics of Networked Systems, NetEcon 2008, Seattle, WA, USA, August 22, 2008 (2008) (0)
Panel Session - Future Directions (1998) (0)
2 . There Exist Np Machines N 1 and N 2 Such That C = L(n (c) F Simulates N 1 on X by Substituting Query R of N 1 to L(n L 1 2 ) with Query (1993) (0)
On the Use of Security and Privacy Technology as a Plot Device (2015) (0)
Interaction Modelling using Trust and Recommendation in Cloud Computing Environment (2016) (0)
WWW 2009 Refereed Track: Internet Monetization (2009) (0)
Network Propagation : The Legal and Technical Dangers of Justifying Active Countermeasures as Retribution for Cyber Attacks (2015) (0)
From Data Leverage to Data Co-Ops: An Institutional Model for User Control over Information Access (2022) (0)
A Business Model for Napster-like File Sharing and File Backup (2002) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
DIMACS Research and Education Institute (DREI ''97) Cryptography and Network Security(July 28 - August 15, 1997) Abstracts of Talks Presented (1997) (0)

This paper list is powered by the following services:

Other Resources About Joan Feigenbaum

en.wikipedia.org

What Schools Are Affiliated With Joan Feigenbaum?

Joan Feigenbaum is affiliated with the following schools: