Joan Feigenbaum
Orcid: 0000-0002-3735-6022Affiliations:
- Yale University, New Haven, Connecticut, USA
According to our database1,
Joan Feigenbaum
authored at least 140 papers
between 1983 and 2022.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2001, "For foundational and highly influential contributions to cryptographic complexity theory, authorization and trust management, massive-data-stream computation, and algorithmic mechanism design.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on acm.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2022
ACM Trans. Priv. Secur., 2022
From Data Leverage to Data Co-Ops: An Institutional Model for User Control over Information Access.
CoRR, 2022
Proceedings of the 2022 New Security Paradigms Workshop, 2022
A Gift that Keeps on Giving: The Impact of Public-Key Cryptography on Theoretical Computer Science.
Proceedings of the Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman, 2022
2020
Proc. Priv. Enhancing Technol., 2020
Found. Trends Priv. Secur., 2020
2019
Show me your friends, and I will tell you whom you vote for: predicting voting behavior in social networks.
Proceedings of the ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining, 2019
2018
On the Incommensurability of Laws and Technical Mechanisms: Or, What Cryptography Can't Do.
Proceedings of the Security Protocols XXVI, 2018
2017
Proceedings of the Security Protocols XXV, 2017
Proceedings of the Security Protocols XXV, 2017
Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017
2016
Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, 2016
PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication.
Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, 2016
Using Intel Software Guard Extensions for Efficient Two-Party Secure Function Evaluation.
Proceedings of the Financial Cryptography and Data Security, 2016
2015
20, 000 In League Under the Sea: Anonymous Communication, Trust, MLATs, and Undersea Cables.
Proc. Priv. Enhancing Technol., 2015
Proceedings of the Security Protocols XXIII - 23rd International Workshop, Cambridge, UK, March 31, 2015
On the Use of Security and Privacy Technology as a Plot Device (Transcript of Discussion).
Proceedings of the Security Protocols XXIII - 23rd International Workshop, Cambridge, UK, March 31, 2015
2014
CoRR, 2014
Catching Bandits and Only Bandits: Privacy-Preserving Intersection Warrants for Lawful Surveillance.
Proceedings of the 4th USENIX Workshop on Free and Open Communications on the Internet, 2014
On the Feasibility of a Technological Response to the Surveillance Morass (Transcript of Discussion).
Proceedings of the Security Protocols XXII, 2014
Proceedings of the Security Protocols XXII, 2014
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014
Proceedings of the 2014 Symposium and Bootcamp on the Science of Security, 2014
Proceedings of the Financial Cryptography and Data Security, 2014
Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014
2013
Proceedings of the CCSW'13, 2013
2012
ACM Trans. Inf. Syst. Secur., 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012
2011
Proceedings of the Web Science 2011, 2011
Proceedings of the 2011 New Security Paradigms Workshop, 2011
2010
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010
Proceedings of the Privacy Enhancing Technologies, 10th International Symposium, 2010
2009
2008
2007
Proceedings of the 2007 ACM Workshop on Privacy in the Electronic Society, 2007
Proceedings of the Financial Cryptography and Data Security, 2007
2006
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006
2005
Proceedings of the 4th Annual Workshop on the Economics of Information Security, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the 1st Annual ACM Workshop on Mining Network Data, 2005
2004
IEEE Data Eng. Bull., 2004
Proceedings of the Computer Security, 2004
2003
ACM Trans. Inf. Syst. Secur., 2003
Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column.
Bull. EATCS, 2003
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003
2002
SIAM J. Comput., 2002
Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), 2002
2001
Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001
Proceedings of the Financial Cryptography, 2001
Proceedings of the Security and Privacy in Digital Rights Management, 2001
Proceedings of the Security and Privacy in Digital Rights Management, 2001
2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the 2000 IEEE Symposium on Security and Privacy, 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Chic. J. Theor. Comput. Sci., 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
Fair Use, Intellectual Property, and the Information Economy (Panel Session Summary).
Proceedings of the Financial Cryptography, 1999
Proceedings of the Secure Internet Programming, 1999
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 1999
1998
Ann. Math. Artif. Intell., 1998
Proceedings of the STACS 98, 1998
Proceedings of the Security Protocols, 1998
Proceedings of the Security Protocols, 1998
Proceedings of the Security Protocols, 1998
Proceedings of the Financial Cryptography, 1998
1997
SIAM J. Comput., 1997
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
1996
Introduction to the special issue on codes and complexity.
IEEE Trans. Inf. Theory, 1996
Proceedings of the 1996 IEEE Symposium on Security and Privacy, 1996
1995
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions.
Chic. J. Theor. Comput. Sci., 1995
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995
1994
Comput. Complex., 1994
1993
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
1992
Discret. Math., 1992
1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Proceedings of the Advances in Cryptology, 1991
1990
Proceedings of the Advances In Computational Complexity Theory, 1990
Proceedings of the Advances in Cryptology, 1990
Proceedings of the Advances in Cryptology, 1990
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990
1989
Proceedings of the Distributed Computing And Cryptography, 1989
Proceedings of the Distributed Computing And Cryptography, 1989
1988
Proceedings of the Advances in Cryptology, 1988
1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
SIAM J. Comput., 1986
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time.
Discret. Appl. Math., 1986
Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986
1985
A polynomial time algorithm for finding the prime factors of cartesian-product graphs.
Discret. Appl. Math., 1985
Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?
Proceedings of the Advances in Cryptology, 1985
1984
ACM Trans. Database Syst., 1984
1983