- AN APPROXIMATE L 1 DIFFERENCE ALGORITHM FOR MASSIVE DATA STREAMS #
- Distributed Computing manuscript No. (will be inserted by the editor)
- Towards an Infrastructure for Authorization Position Paper \Lambda
- Sensor networks Opportunities for theory
- 70 communications of thE acm | jAnuARY 2009 | voL. 52 | no. 1 review articles
- ON THE RANDOMSELFREDUCIBILITY OF COMPLETE SETS \Lambda JOAN FEIGENBAUM y AND LANCE FORTNOW z
- Delegation Logic: A Logic-based Approach to Distributed Authorization
- Finding Highly Correlated Pairs Efficiently with Powerful Computer Science Department
- Privacy Engineering for Digital Rights Management Systems
- RANDOM DEBATERS AND THE HARDNESS OF APPROXIMATING STOCHASTIC FUNCTIONS \Lambda
- RANDOM DEBATERS AND THE HARDNESS OF APPROXIMATING STOCHASTIC FUNCTIONS
- Sensitive Information in a Wired World
- Incentives and Internet Algorithms
- Approximation and Collusion in Multicast Cost Sharing1 Aaron Archer2
- On Graph Problems in a Semi-Streaming Joan Feigenbaum 1;6
- Towards Better Definitions and Measures of Internet Security (Position Paper)
- Distributed Computing manuscript No. (will be inserted by the editor)
- Privacy Engineering for Digital Rights Management Systems
- Subjective-Cost Policy Routing Joan Feigenbaum a,1
- 82 June 2008/Vol. 51, No. 6 COMMUNICATIONS OF THE ACM With access control and encryption no longer
- Yale University Department of Computer Science
- A BGP-based Mechanism for Lowest-Cost Routing Joan Feigenbaum
- Distributed Algorithmic Mechanism Design: Recent Results and Future Directions #
- Theory and Application of Extractable Functions
- Computing Diameter in the Streaming and SlidingWindow Models 1
- Yale University Department of Computer Science
- Hardness Results for Multicast Cost Sharing # Joan Feigenbaum + Arvind Krishnamurthy # Rahul Sami Scott Shenker
- NSF SBE/CISE Workshop on Cyberinfrastructure and the Social Sciences SESSION: 3: Malevolence
- PUBLICATIONS Joan Feigenbaum
- Privacy, Integrity, and Incentive Compatibility in Computations with
- "Control of Personal Information: A Dialogue Between a
- Computation in a Distributed Information Market
- Massive Data Streams in Graph Theory and Computational Geometry Streaming is an important paradigm for handling data sets that are too large to fit
- A Language for Configuring Routing Networks Andreas Voellmy and Paul Hudak
- LANGUAGE FOR CONFIGURING
- OpenFlow Languages for OpenFlow Networks Next Steps Functional Reactive Openflow Network Control
- Probabilistic Analysis of Onion Routing in a Black-box [Extended Abstract]
- Distributed Computing manuscript No. (will be inserted by the editor)
- Distributed Computing manuscript No. (will be inserted by the editor)
- Hardness Results for Multicast Cost Sharing Joan Feigenbaum
- Distributed Algorithmic Mechanism Design: Recent Results and Future Directions
- Sharing the Cost of Multicast Transmissions Joan Feigenbaum
- Secure Multiparty Computation of Approximations Joan Feigenbaum
- DOI: 10.1007/s00453-002-0959-4 Algorithmica (2002) 34: 6780
- The Role of Trust Management in Distributed Systems Security
- Compliance Checking in the PolicyMaker Trust Management System
- Doc. Math.J.DMV 1 Games, Complexity Classes, and Approximation Algorithms
- A Formal Treatment of Remotely Keyed Encryption?
- Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx P. Rogaway{
- !"#%$'&)('$0&1"234#657&1$8 #"9A@B$C9D) E FGIHQPRHSFT6E UWVYX`Ra
- Towards Realistic Assumptions, Models, and Goals for Security Research (White Paper for NSF Workshop)
- Agents' Privacy in Distributed Algorithmic Mechanisms (Position Paper)
- Towards a Theory of Networked Computation Joan Feigenbaum Michael Mitzenmacher
- Cleared for public release, distribution unlimited
- Approximate Privacy: Foundations and Quantification (Extended Abstract)
- Computation in a Distributed Information Joan Feigenbaum a,2
- Flexibility as an Instrument in Digital Rights Management Dirk Bergemanny
- Implementation and Evaluation of Privacy-Preserving Protocols Felipe Saint-Jean Antonijevic
- Private Web Search Felipe Saint-Jean
- Approximation and Collusion in Multicast Cost Sharing 1 Aaron Archer 2
- Design and Analysis of Efficient AnonymousCommunication
- Towards a Theory of Networked Computation Joan Feigenbaum Michael Mitzenmacher
- Design and Analysis of Efficient Anonymous-Communication Aaron Johnson
- Privacy, Integrity, and Incentive-Compatibility in Computations with Untrusted Parties
- Implementation and Evaluation of Privacy-Preserving Protocols
- Sharing the Cost of Multicast Transmissions # Joan Feigenbaum +
- Doc. Math. J. DMV 1 Games, Complexity Classes, and Approximation Algorithms
- NOX: Towards an Operating System for Networks Natasha Gude Teemu Koponen Justin Pettit Ben Pfaff Martn Casado
- Learning-Based Anomaly Detection in BGP Updates Computer Science Dept.
- Distributed Algorithmic Mechanism Design A Dissertation
- Taking the Copy Out of Copyright Ernest Miller1
- Delegation Logic: A Logic-based Approach to Distributed Authorization
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2008 Society for Industrial and Applied Mathematics
- Yale University Department of Computer Science
- Locally Random Reductions: Improvements and Applications \Lambda D. Beaver y J. Feigenbaum z J. Kilian x P. Rogaway --
- The Role of Trust Management in Distributed Systems Security
- Economic Barriers to the Deployment of Existing Privacy Technologies
- Learning (and reliability) Matti Kriinen (ICSI)
- Workshop on Scalable Cyber-Security Challenges in Large-Scale Networks: Deployment Obstacles
- Distributed Algorithmic Mechanism Design for Network Problems
- Computation in a Distributed Information Joan Feigenbaum a,2
- Computing Diameter in the Streaming and Sliding-Window Models1
- A Formal Treatment of Remotely Keyed Encryption ?
- Distributed Computing manuscript No. (will be inserted by the editor)
- Accountability and Deterrence in Online Life (Extended Abstract)
- A Model of Onion Routing with Provable Joan Feigenbaum1
- AN APPROXIMATE L1 -DIFFERENCE ALGORITHM FOR
- Foundations of Inter-Domain Routing Vijay Ramachandran
- Preventing Active Timing Attacks in Low-Latency Anonymous Communication
- Towards a Theory of Networked Computation Joan Feigenbaum Michael Mitzenmacher
- Accountability as a Driver of Innovative Privacy Solutions Joan Feigenbaum1
- Towards a Formal Model of Accountability Joan Feigenbaum
