World's Best Scientists 2026 revealed!
Joan Feigenbaum

Joan Feigenbaum

D-Index & Metrics

Computer Science

D-Index
62
Citations
18095
World Ranking
2864
National Ranking
1415

Research.com Recognitions

  • 2012 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 2001 - ACM Fellow For foundational and highly influential contributions to cryptographic complexity theory, authorization and trust management, massive-data-stream computation, and algorithmic mechanism design.

Overview

Joan Feigenbaum is affiliated with Yale University in the United States and has a research focus primarily in the field of Computer Science. Their work spans several subfields including Artificial Intelligence, Information Systems, Computer Networks and Communications, Sociology and Political Science, and Computational Theory and Mathematics.

Their research covers a range of topics within privacy and security, with a particular emphasis on:

  • Privacy-Preserving Technologies in Data
  • Cryptography and Data Security
  • Internet Traffic Analysis and Secure E-voting
  • Blockchain Technology Applications and Security
  • Network Security and Intrusion Detection
  • Cloud Data Security Solutions
  • Privacy, Security, and Data Protection

Frequent collaborators in their recent studies have included Ludovic Barman, Italo Dacosta, Mahdi Zamani, Ennan Zhai, and Apostolos Pyrgelis.

Some of Joan Feigenbaum's recent papers are:

  • "PriFi: Low-Latency Anonymity for Organizational Networks" (2020, DOAJ - Directory of Open Access Journals)
  • "Privacy-Preserving XGBoost Inference" (2020, arXiv - Cornell University)
  • "PRShare: A Framework for Privacy-preserving, Interorganizational Data Sharing" (2022, ACM Transactions on Privacy and Security)
  • "Accountability in Computing: Concepts and Mechanisms" (2020, Foundations and Trends® in Privacy and Security)
  • "From Data Leverage to Data Co-Ops: An Institutional Model for User Control over Information Access" (2022, arXiv - Cornell University)

Their work has been published frequently in venues such as:

  • arXiv (Cornell University)
  • DOAJ (DOAJ: Directory of Open Access Journals)
  • ACM Transactions on Privacy and Security
  • Foundations and Trends® in Privacy and Security
  • Proceedings on Privacy Enhancing Technologies

Joan Feigenbaum has received recognition through awards including being named a Fellow of the American Association for the Advancement of Science (AAAS) in 2012. Earlier, in 2001, they were named an ACM Fellow for contributions to cryptographic complexity theory, authorization and trust management, massive-data-stream computation, and algorithmic mechanism design.

Best Publications

  • Decentralized trust management

    Matt Blaze;Joan Feigenbaum;Jack Lacy

  • The role of trust management in distributed systems security

    Matt Blaze;Joan Feigenbaum;John Ioannidis;Angelos D. Keromytis

  • The KeyNote Trust-Management System Version 2

    M. Blaze;J. Feigenbaum;J. Ioannidis;A. Keromytis

  • Sharing the Cost of Multicast Transmissions

    Joan Feigenbaum;Christos H. Papadimitriou;Scott Shenker

  • Delegation logic: A logic-based approach to distributed authorization

    Ninghui Li;Benjamin N. Grosof;Joan Feigenbaum

  • Information accountability

    Daniel J. Weitzner;Harold Abelson;Tim Berners-Lee;Joan Feigenbaum

  • Distributed algorithmic mechanism design: recent results and future directions

    Joan Feigenbaum;Scott Shenker

  • Referee: trust management for Web applications

    Yang-Hua Chu;Joan Feigenbaum;Brian LaMacchia;Paul Resnick

  • The KeyNote trust management system version2, IETF RFC 2704

    Matt Blaze;Joan Feigenbaum;John Ioannidis;Angelos D. Keromytis

  • A BGP-based mechanism for lowest-cost routing

    Joan Feigenbaum;Christos Papadimitriou;Rahul Sami;Scott Shenker

  • On graph problems in a semi-streaming model

    Joan Feigenbaum;Sampath Kannan;Andrew McGregor;Siddharth Suri

  • Compliance Checking in the PolicyMaker Trust Management System

    Matt Blaze;Joan Feigenbaum;Martin Strauss

  • KeyNote: Trust Management for Public-Key Infrastructures (Position Paper)

    Matt Blaze;Joan Feigenbaum;Angelos D. Keromytis

  • On hiding information form an oracle

    M. Abadi;J. Feigenbaum;J Kilian

  • An Approximate L 1 -Difference Algorithm for Massive Data Streams

    Joan Feigenbaum;Sampath Kannan;Martin J. Strauss;Mahesh Viswanathan

  • Hiding instances in multioracle queries

    Donald Beaver;Joan Feigenbaum

  • A BGP-based mechanism for lowest-cost routing

    Joan Feigenbaum;Christos Papadimitriou;Rahul Sami;Scott Shenker

  • An approximate L/sup 1/-difference algorithm for massive data streams

    J. Feigenbaum;S. Kannan;M. Strauss;M. Viswanathan

  • The KeyNote Trust-Management System

    Angelos Keromytis;John Ioannidis;Matt Blaze;Joan Feigenbaum

  • Random-self-reducibility of complete sets

    Joan Feigenbaum;Lance Fortnow

  • A new approach to interdomain routing based on secure multi-party computation

    Debayan Gupta;Aaron Segal;Aurojit Panda;Gil Segev

  • KeyNote : Trust management for public-key infrastructures. Discussion

    M. Blaze;J. Feigenbaum;A. D. Keromytis;V. Gligor

Frequent Co-Authors

Scott Shenker
Scott Shenker University of California, Berkeley
Sampath Kannan
Sampath Kannan University of Pennsylvania
Martin J. Strauss
Martin J. Strauss University of Michigan–Ann Arbor
Rebecca N. Wright
Rebecca N. Wright Barnard College
Bryan Ford
Bryan Ford École Polytechnique Fédérale de Lausanne
Paul Syverson
Paul Syverson United States Naval Research Laboratory
Mahesh Viswanathan
Mahesh Viswanathan University of Illinois at Urbana-Champaign
Michael Schapira
Michael Schapira Hebrew University of Jerusalem
Lance Fortnow
Lance Fortnow Illinois Institute of Technology
Angelos D. Keromytis
Angelos D. Keromytis Georgia Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA unlocks various related degree options and career pathways, particularly with the growing accessibility of online programs. For students interested in engineering, exploring the mechanical engineering cost of education can help you discover affordable paths in a field closely tied to technology and design.

If you’re inclined toward the physical sciences, the cheapest online physics degree programs offer a solid technical foundation at a lower cost, opening doors to research, teaching, or technology development roles.

For those intrigued by big data and analytics, a data science degree online can provide in-demand skills for positions in artificial intelligence, business intelligence, and analytics.

Additionally, pursuing an online bachelor’s in electrical engineering may pave the way for careers developing hardware, embedded systems, or smart technology.

By considering related online degrees, students can align their education with specific interests and career goals while potentially saving money and gaining flexibility.

Best Scientists Citing Joan Feigenbaum

Trending Scientists

Recently Published Articles