]> 2012-05-29T10:09:11-04:00 Joan Feigenbaum Joan Joan Feigenbaum Feigenbaum Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism Taking the Copy Out of Copyright Factorization in Experiment Generation Distributed algorithmic mechanism design: recent results and future directions Finding highly correlated pairs efficiently with powerful pruning The Complexity of Problems on Graphs Represented as OBDDs REFEREE: Trust Management for Web Applications The Power of Adaptiveness and Additional Queries in Random-Self-Reductions Finding the prime factors of strong direct product graphs in polynomial time Approximation and collusion in multicast cost sharing (extended abstract) KeyNote: Trust Management for Public-Key Infrastructures (Position Paper) Computational challenges in e-commerce A Model of Onion Routing with Provable Anonymity Probabilistic analysis of onion routing in a black-box model Private web search Subjective-cost policy routing Towards a theory of data entanglement Incentive-compatible interdomain routing Secure multiparty computation of approximations Mechanism design for policy routing Towards a theory of networked computation Learning-based anomaly detection in BGP updates Graph distances in the streaming model: the value of space Subjective-Cost Policy Routing A BGP-based mechanism for lowest-cost routing Computation in a distributed information market On graph problems in a semi-streaming model Towards a Theory of Data Entanglement: (Extended Abstract) On Graph Problems in a Semi-streaming Model Computing Diameter in the Streaming and Sliding-Window Models PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment Approximation and collusion in multicast cost sharing Delegation logic: A logic-based approach to distributed authorization Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column Hardness results for multicast cost sharing Hardness Results for Multicast Cost Sharing Testing and Spot-Checking of Data Streams An Approximate L1-Difference Algorithm for Massive Data Streams Privacy Engineering for Digital Rights Management Systems Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation Secure Multiparty Computation of Approximations Sharing the Cost of Multicast Transmissions A Practically Implementable and Tractable Delegation Logic Testing and spot-checking of data streams (extended abstract) Sharing the cost of muliticast transmissions (preliminary version) A Logic-based Knowledge Representation for Authorization with Delegation Fair Use, Intellectual Property, and the Information Economy (Panel Session Summary) A Formal Treatment of Remotely Keyed Encryption The Role of Trust Management in Distributed Systems Security Compliance Checking in the PolicyMaker Trust Management System Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract) Panel Session - Future Directions A Formal Framework for Evaluating Heuristic Programs On Coherence, Random-Self-Reducibility, and Self-Correction An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract) Locally Random Reductions: Improvements and Applications Random Debaters and the Hardness of Approximating Stochastic Functions On Coherence, Random-self-reducibility, and Self-correction Decentralized Trust Management Introduction to the special issue on codes and complexity A Game-Theoretic Classification of Interactive Complexity Classes Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions Random-Self-Reducibility of Complete Sets Complexity Results for Pomset Languages On Being Incoherent Without Being Very Hard A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems Complexity Results for POMSET Languages Languages that Are Easier than their Proofs On the Random-Self-Reducibility of Complete Sets Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract) Security with Low Communication Overhead Hiding Instances in Multioracle Queries Lower Bounds on Random-Self-Reducibility Equipartitions of graphs Secure Circuit Evaluation On Hiding Information from an Oracle On Factorable Extensions and Subgraphs of Prime Graphs On Generating Solved Instances of Computational Problems A Simple Protocol for Secure Circuit Evaluation On Hiding Information from an Oracle (Extended Abstract) Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? System/U: A Database System Based on the Universal Relation Assumption Information Accountability (TR) Information Accountability Information accountability Has author Has identifier Foaf:surname Foaf:name Foaf:firstName Anonymous.png Foaf:depiction Person