Publications

Survey

• J. Feigenbaum, J.Y. Halpern, P.D. Lincoln, J.C. Mitchell, A. Scedrov, J.M. Smith, and P. Syverson.
  "Software Quality and Infrastructure Protection for Diffuse Computing". [.pdf]

Protocol Analysis

• J. Y. Halpern and R. Pucella.
  Probabilistic algorithmic knowledge, 
  Logical Methods in Computer Science 1:3, 2005.
• J. Y. Halpern and R. van der Meyden.
  A logical reconstruction of SPKI,
  Journal of Computer Security 11:4, 2003, pp. 581--614.
• K. O'Neill, M. Clarkson, and S. Chong,
  Information-flow security for interactive program. 
  To appear, CSFW 2006.
  
• M. Backes, I. Cervesato, A.D. Jaggard, A. Scedrov, and J.-K. Tsay.
  Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos.
  In: D. Gollmann and A. Sabelfeld, eds., "11-th European Symposium On Research In Computer Security (ESORICS 2006)", Hamburg, Germany, September 2006. Springer LNCS, to appear.
• I. Cervesato, A.D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad.
  "Breaking and fixing public-key Kerberos".
  Revised version in: D. Gollmann and J. Juerjens, eds., International Workshop on Issues in the Theory of Security (WITS '06), Vienna, Austria, March 2006. [.pdf]
• M. Backes, B. Pfitzmann, and A. Scedrov.
  "Key-dependent Message Security under Active Attacks".
  Cryptology ePrint Archive: Report 2005/421.
• A. Datta, A. Derek, J.C. Mitchell, A. Ramanathan, and A. Scedrov.
  "Games and the Impossibility of Realizable Ideal Functionality".
  In: S. Halevi and T. Rabin, eds., " 3-rd Theory of Cryptography Conference (TCC 2006)", New York, NY, March 2006. Springer LNCS Volume 3876, Springer-Verlag, 2006, pp. 360-379. Revised version in Cryptology ePrint Archive: Report 2005/211.
• J.C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague.
  "A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols".
  Theoretical Computer Science, 353, 2006, pp. 118-164. [.pdf] [.ps] [.ps.gz]
• P. Adão, G. Bana, J. Herzog, and A. Scedrov.
  "Soundness of formal encryption in the presence of key-cycles".
  In: S. De Capitani di Vimercati and P. Syverson, eds., "10-th European Symposium on Research in Computer Security (ESORICS 2005)", Milan, Italy, September 2005. Springer LNCS, to appear. [.pdf] [.ps] [.ps.gz]
• P. Adão, G. Bana, and A. Scedrov.
  "Computational and information-theoretic soundness and completeness of formal encryption".
  In: J. Guttman, ed., "18-th IEEE Computer Security Foundations Workshop (CSFW)", Aix-en-Provence, France, June 2005. IEEE Computer Society Press, 2005. [.pdf] [.ps] [.ps.gz]
• I. Cervesato, A. Jaggard, A. Scedrov, and C. Walstad.
  "Specifying Kerberos 5 cross-realm authentication".
  In: C. Meadows, ed., "Proceedings of the 2005 workshop on Issues in the theory of security (WITS'05)", Long Beach, California, January 2005, ACM Digital Library, ACM Press, New York, 2005, pp. 12-26. [.pdf]
• I. Cervesato, N.A. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov.
  "A revised comparison between strand spaces and multiset rewriting for security protocol analysis".
  Journal of Computer Security 13(2) (2005) 265-316. [.pdf]
• R. Chadha, S. Kremer, and A. Scedrov.
  "Formal analysis of multi-party contract signing".
  Journal of Automated Reasoning, Special Issue on Automated Reasoning for Security Protocol Analysis, accepted for publication. [.pdf] [.ps] [.ps.gz]
  Preliminary report in: R. Focardi, ed., " 17-th IEEE Computer Security Foundations Workshop (CSFW)", Pacific Grove, California, June 2004. IEEE Computer Society Press, 2004, pp. 266-279. [.pdf] [.ps] [.ps.gz]
• F. Butler, I. Cervesato, A. Jaggard, and A. Scedrov.
  "Verifying Confidentiality and Authentication in Kerberos 5".
  In: K. Futatsugi, F. Mizoguchi, N. Yonezaki, eds., "Software Security - Theories and Systems Second Mext-NSF-JSPS International Symposium, ISSS 2003, Tokyo, Japan, November 4-6, 2003", Springer LNCS Volume 3233, Springer-Verlag, 2004, pp. 1-24.
• F. Butler, I. Cervesato, A. Jaggard, and A. Scedrov.
  "A formal analysis of some properties of Kerberos 5 using MSR". Technical report, April 2004, 59 pages. [.pdf] [.ps] [.ps.gz]
• J. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague.
  "A probabilistic polynomial-time calculus for the analysis of cryptographic protocols". Technical report, April 2004, 72 pages. [.pdf] [.ps] [.ps.gz]
• A. Ramanathan, J. Mitchell, A. Scedrov, and V. Teague.
  "Probabilistic bisimulation and equivalence for security analysis of network protocols''.
  In: I. Walukiewicz, ed., "Foundations of Software Science and Computation Structures, 7-th International Conference, FOSSACS 2004", Springer LNCS Volume 2987, Springer-Verlag, 2004, pp. 468-483. [.pdf] [.ps] [.ps.gz]
• A. Datta, R. Kuesters, J.C. Mitchell, A. Ramanathan, V. Shmatikov,
  "Unifying Equivalence-Based Definitions of Protocol Security, ''
  Workshop on Issues in the Theory of Security (WITS'04), Barcelona, April, 2004.
• J.C. Mitchell and V. Teague,
  "Autonomous Nodes and Distributed Mechanisms. ''
  In M. Okada, B. Pierce, A. Scedrov, H. Tokuda, and A. Yonezawa, eds., Software Security - Theories and Systems. Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Springer LNCS Volume 2609, Springer-Verlag, 2003, pp. 58-83.
• A. Datta and A. Derek and J. C. Mitchell and D. Pavlovic,
  "Abstraction and Refinement in Protocol Derivation, ''
  IEEE Computer Security Foundations Workshop, Pacific Grove, California, June 2004, to appear.
• A. Datta and A. Derek and J. C. Mitchell and D. Pavlovic,
  "Secure protocol composition, ''
  Proc. of Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, vol 83, 2003.
• A. Datta, A. Derek, J. C. Mitchell, D. Pavlovic,
  "Secure protocol composition (Extended abstract), ''
  Proc. ACM Workshop on Formal Methods in Security Engineering, 2003, pages 11-23.
• H. Comon-Lundh and V. Shmatikov,
  "Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. ''
  in Proc. of 18th Annual IEEE Symposium on Logic in Computer Science, Ottawa, Canada, June 2003. [pdf]
• J. Y. Halpern, R. Pucella,
  "Modeling Adversaries in a Logic for Security".
  Protocol Analysis. Proceedings of Formal Aspects of Security (FASec'02), December 2002. [pdf]
• J. Y. Halpern, R. Pucella,
  "Probabilistic Algorithmic Knowledge.".
  Proceedings of the Ninth conference on Theoretical Aspects of Rationality and Knowledge (TARK'03), June 2003. [pdf]
• J. Y. Halpern, R. Pucella,
  "A Logic for Reasoning about Evidence.".
  Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03), August 2003. [pdf]
• P. Mateus, J. Mitchell, and A. Scedrov,
  "Composition of cryptographic protocols in a probabilistic polynomial-time process calculus".
  In: R. Amadio and D. Lugiez, eds., "CONCUR 2003 - Concurrency Theory, 14-th International Conference, Marseille, France, September 2003", Springer LNCS Volume 2761, Springer-Verlag, 2003, pp. 327-349. [pdf] [ps] [ps.gz]
• R. Chadha, J. Mitchell, A. Scedrov, and V. Shmatikov,
  "Contract signing, optimism, and advantage".
  In: R. Amadio and D. Lugiez, eds., "CONCUR 2003 - Concurrency Theory, 14-th International Conference, Marseille, France, September 2003", Springer LNCS Volume 2761, Springer-Verlag, 2003, pp. 366-382. [pdf] [ps] [ps.gz]
• I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov,
  "A comparison between strand spaces and multiset rewriting for security protocol analysis".
  In: M. Okada, B. Pierce, A. Scedrov, H. Tokuda, and A. Yonezawa, eds. "Software Security -- Theories and Systems. Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers", Springer LNCS Volume 2609, Springer-Verlag, 2003, pp. 356-383. [pdf] [ps] [ps.gz]
• N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov,
  "Multiset Rewriting and the Complexity of Bounded Security Protocols",
  Journal of Computer Security, vol 12, 2004, pages 247-311. [ps] [ps.gz] [pdf]
• N. Durgin, J. Mitchell, and D. Pavlovic,
  "A Compositional Logic for Proving Security Properties of Protocols",
  Journal of Computer Security, vol 11, 2004, pages 677-722.
• F. Butler, I. Cervesato, A. Jaggard, and A. Scedrov
  "A formal analysis of some properties of Kerberos 5 using MSR",
  In: S. Schneider, ed., 15-th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, June, 2002, IEEE Computer Society Press, pp. 175-190. [ps] [ps.gz][pdf]
• J. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague
  "A probabilistic polynomial-time calculus for analysis of cryptographic protocols",
  In: S. Brookes, M. Mislove, eds., 17-th Annual Conference on the Mathematical Foundations of Programming Semantics, Arhus, Denmark, May, 2001, Electronic Notes in Theoretical Computer Science, Volume 45 (2001) [ps][pdf]
• J. Millen and V. Shmatikov,
  "Symbolic Protocol Analysis with Products and Diffie-Hellman Exponentiation. ''
  in Proc. of 16th IEEE Computer Security Foundations Workshop, Pacific Grove, CA, June 2003. [pdf]
• A. Datta, A. Derek, J.C. Mitchell, and D. Pavlovic,
  "A Derivation System for Security Protocols and its Logical Formalization.''
  IEEE Computer Security Foundations Workshop, Pacific Grove, California, June 2003, pages 109-125.
• G. Norman and V. Shmatikov,
  "Analysis of Probabilistic Contract Signing. ''
  In Proc. of BCS-FACS Formal Aspects of Security, Royal Holloway, University of London, U.K., December 2002. [pdf]
• J. Y. Halpern, R. Pucella,
  "On the relationship between strand spaces and multi-agent systems",
  in Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pp. 106-115, 2001. [pdf]
• Joseph Halpern and Kevin O'Neill,
  "Secrecy in Multiagent Systems",
  in the Proceedings of the Computer Security Foundations Workshop (CSFW'02), June 2002. [.pdf][[ps][pdf]

Economics and computation

• J. Y. Halpern and L. C. Rego.
  Extensive games with possibly unaware players, 
  Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, May, 2006.
• L. Blume, D. Easley, and J. Y. Halpern.
  Redoing the foundations of decision theory, 
  Proceedings of the Tenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), June 2006. (Winner of best paper award!)
• J. Y. Halpern and L. C. Rego.  
  Reasoning about knowledge of unawareness,
  Proceedings of the Tenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), 2006 (Nominated for best paper award)
• E. Friedman, J. Y. Halpern, and L.C. Rego.
  Efficiency and Nash equilibria in a scrip system for P2P networks,
  Proceedings of the Seventh ACM Conference on Electronic Commerce, June, 2006.
• F. Chu and J.Y. Halpern.  
  Great expectations. Part II: Generalized expected utility as a universal decision rule,
  Artificial Intelligence 159:1,2, 2004.
• F. Chu and J.Y. Halpern.  
  Great expectations. Part I: On the customizability of generalized expected utility,
  To appear, Theory and Decision.
• M. M. Halldorsson, J. Y. Halpern, L. Li, and V. Mirrokni,
  On spectrum sharing games, 
  Procedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004, pp. 107-114.
• J. Y. Halpern and L. C. Rego,
  Interactive unawareness revisited,
  Tenth Conference on Theoretcal Aspects of Rationality and Knowledge, 2005, pp. 78-91.
• I. Abraham, D. Dolev, R. Gonen, and J. Y. Halpern,
  Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation,
  To appear, ACM Conference on Principles of Distributed Computing, 2006.
  
• Joan Feigenbaum, Vijay Ramachandran, and Michael Schapira,
  "Incentive-Compatible Interdomain Routing",
  in Proceedings of ACM Conference on Electronic Commerce, Ann Arbor MI, June 2006, pp. 130-139. [pdf]
• J. Feigenbaum, D. Karger, V. Mirrokni, and R. Sami,
  "Subjective-Cost Policy Routing",
  in Proceedings of the Workshop on Internet and Network Economics, Hong Kong, December 2005, pages 174-183. [pdf]
• J. Halpern,
  "A computer scientist looks at game theory",
  Games and Economic Behavior 45:1, 2003, pp. 114-131
• Joan Feigenbaum, Rahul Sami, and Scott Shenker,
  "Mechanism Design for Policy Routing",
  Distributed Computing 18 (2006), pp. 293-305. (Special issue of selected papers from ACM PODC'04.) [pdf]
• Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami
  "Computation in a Distributed Information Market",
  Theoretical Computer Science, 343(2005), pp.114-132. [.pdf]
• Joan Feigenbaum and Scott Shenker,
  "Distributed Algorithmic Mechanism Design: Recent Results and Future Directions",
  in Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication, ACM Press, New York, 2002, pp. 1-13. [ps] [.pdf]
• Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker,
  "Hardness Results for Multicast Cost Sharing",
  Theoretical Computer Science. 304 (2003), pp. 215-236. [ps] [pdf]
• Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, and Scott Shenker,
  "A BGP-based Mechanism for Lowest-Cost Routing",
  Distributed Computing 18 (2005), pages 61-72. (Special Issue of Selected Papers from ACM PODC'02.) [ps] [pdf]
• Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker,
  "Approximation and Collusion in Multicast Cost Sharing",
  Games and Economic Behavior, 47 (2004), pp. 36-71. [ps] [.pdf]
• Joan Feigenbaum, Christos Papadimitriou and Scott Shenker,
  "Sharing the Cost of Multicast Transmissions"
  Journal of Computer and System Sciences 63 (2001), pp. 21-41. (Special issue on Internet Algorithms.) [ps] [pdf]

Trust Management and Access Control

• Riccardo Pucella, Vicky Weissman,
  "Reasoning about Dynamic Policies'',
  FOSSACS-04 (Proceedings of the Sixth International Conference on Foundations of Software Science and Computation Structure), 2004, pp. 453-467 [pdf]
• Carl Lagoze, Vicky Weissman,
  "Towards a policy language for humans and computers''
  ECDL-04 (Proceedings of the Eighth European Conference on Digital Libraries), 2004, pp. 513-525 [pdf]
• Ninghui Li, William H. Winsborough, and John C. Mitchell,
  "Distributed Credential Chain Discovery in Trust Management. ''
  Journal of Computer Security, volume 11, number 1, pp. 35-86, February 2003.
• Ninghui Li, Benjamin N. Grosof, and Joan Feigenbaum,
  "Delegation Logic: A Logic-based Approach to Distributed Authorization. ''
  ACM Transactions on Information and System Security (TISSEC), volume 6, number 1, pp. 128-171, February 2003.
• Ninghui Li and John C. Mitchell.
  "Understanding SPKI/SDSI Using First-Order Logic. ''
  in IEEE Computer Security Foundations Workshop, Pacific Grove, California, June 2003
• Ninghui Li, William H. Winsborough, and John C. Mitchell.
  "Beyond Proof-of-compliance: Safety and Availability Analysis in Trust Management. ''
  In IEEE Symposium on Security and Privacy, Berkeley, California, May 2003
• Ninghui Li, John C. Mitchell, William H. Winsborough
  "Design of a Role-based Trust-management Framework. ''
  IEEE Symp. on Security and Privacy, Oakland, May 2002.
• Ninghui Li and John C. Mitchell.
  "RT: A Role-based Trust-management Framework. ''
  The Third DARPA Information Survivability Conference and Exposition (DISCEX III), Washington, D.C., April 2003.
• Ninghui Li and John C. Mitchell.
  "Datalog with Constraints: A Foundation for Trust-management Languages. ''
  In Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL 2003), New Orleans, Louisiana, January 2003. LNCS 2562, Springer, Berlin, pp. 58-73
• A. Chander, D. Dean, J.C. Mitchell,
  "Deconstructing Trust Management, ''
  ACM SIGPLAN and IFIP WG 1.7 Workshop on Issues in the Theory of Security (WITS'02) Portland, Oregon, USA, January 14-15, 2002
• Chander, A.. Dean, D, and Mitchell, J.C.,
  "A state-transition model of trust management and access control, ''
  14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, June 11-13, 2001.
• William H. Winsborough and Ninghui Li.
  "Protecting Sensitive Attributes in Automated Trust Negotiation. ''
  In Proceedings of ACM Workshop on Privacy in the Electronic Society, Washington, DC, November 2002.
• J. Y. Halpern and V. Weissman,
  "Using first-order logic to reason about policies.''
  Proceedings of the 16th IEEE Computer Security Foundations Workshop, 2003, pp.~187-201. [pdf]

Digital Rights Management

• D. Bergemann, T. Eisenbach, J. Feigenbaum, S. Shenker.
  "Flexibility as an Instrument in Digital Rights Management".
  4th Annual Workshop on Economics of Information Security, Cambridge MA, June 2005. [pdf]
• J. Halpern, V. Weissman,
  "A formal foundation for XrML".
  in Proceedings of the 16th IEEE Computer Security Foundations Workshop, 2004, pp. 251-263 [pdf]
• Ernest Miller and Joan Feigenbaum,
  "Taking the Copy Out of Copyright",
  in Proceedings of the 2001 ACM Workshop on Security and Privacy in Digital Rights Management. vol. 2320, Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 233-244. [.pdf]
• Joan Feigenbaum, Michael J. Freedman, Tomas Sander, and Adam Shostack,
  "Privacy Engineering for Digital Rights Management",
  in Proceedings of the 2001 ACM Workshop on Security and Privacy in Digital Rights Management. vol. 2320, Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 76-105. [ps][.pdf]
• R. Pucella, V. Weissman,
  "A logic for reasoning about digital rights",
  in the Proceedings of the Computer Security Foundations Workshop (CSFW'02), June 2002. [pdf]

Privacy and Anonymity

• Aaron Johnson,
  "A Model of Onion Routing with Provable Anonymity",
  Technical Report, YALEU/DCS/TR-1368, Yale University, New Haven CT, Sept 2006. [pdf]
  
• J. Y. Halpern and K. O'Neill.
  Anonymity and information hiding in multiagent systems,
  Journal of Computer Security 13:3, 2005, pp. 483-514
• Onur Kardes, Raphael S. Ryger and Rebecca N. Wright
  "Implementing Privacy-Preserving Bayesian-Net Discovery for Vertically Partitioned Data",
  to appear in Proceedings of the ICDM Workshop on Privacy and Security Aspects of Data Mining, Houston TX, Nov 2005. [pdf]
• Roger Dingledine, Nick Mathewson, and Paul Syverson
  "Tor: The Second-Generation Onion Router",
  in 13th USENIX Security Symposium (Security '04). [pdf]
• Roger Dingledine, Vitaly Shmatikov, and Paul Syverson
  "Synchronous Batching: From Cascades to Free Routes",
  in Privacy Enhancing Technologies, 4th International Workshop PET 2004. (Final version forthcoming from Springer-Verlag.) [pdf]
• Paul Syverson,
  "The Paradoxical Value of Privacy",
  in 2nd Annual Workshop on Economics and Information Security (WEIS 2003). [pdf]
• Andrei Serjantov, Roger Dingledine, Paul Syverson,
  "From a Trickle to a Flood: Active Attacks on Several Mix Types.''
  in Information Hiding, 5th International Workshop, IH 2002 Fabien A.P. Petitcolas (Ed.) Springer-Velag LNCS 2578 2003. [pdf]
• Richard E. Newman, Ira S. Moskowitz, Paul Syverson, and Andrei Serjantov
  "Metrics for Traffic Analysis Prevention.''
  in Privacy Enhancing Technologies, 3rd International Workshop PET 2003 Roger Dingledine (Ed.) Springer-Verlag LNCS 2003. [pdf]
• Philippe Golle, Markus Jakobsson, Ari Juels, and Paul Syverson
  "Universal Re-encryption for Mixnets.''
  in Topics in Cryptology - CT-RSA 2004: The Cryptographer's Track at the RSA Conference 2004 Tatsuaki Okamoto (Ed.) Springer-Verlag LNCS 2004. [pdf]
• D.Hughes and V. Shmatikov,
  "Information Hiding, Anonymity and Privacy: A Modular Approach. ''
  in Journal of Computer Security, special issue on WITS '02 (ed. Joshua Guttman), 2003. [pdf]
• J. Y. Halpern and K. O'Neill,
  "Anonymity and information hiding in multiagent systems, ''
  Proceedings of the 16th IEEE Computer Security Foundations Workshop, 2003 pp. 75-88.[pdf]
• Alessandro Acquisti, Roger Dingledine, and Paul Syverson
  "On the Economics of Anonymity.''
  in Financial Cryptography, 7th International Conference, FC2003 L. Jean Camp and Rebecca N. Wright (Eds.) Springer-Verlag LNCS 2742 August 2003. [pdf]
• Roger Dingledine and Paul Syverson
  "Reliable MIX Cascade Networks through Reputation.''
  in Financial Cryptography, 6th International Conference, FC 2002 Matt Blaze (Ed.) Springer-Verlag LNCS 2357 2003. [pdf]
• Roger Dingledine, Nick Mathewson, and Paul Syverson
  "Reputation in P2P Anonymity Systems.''
  in Workshop on Economics of Peer-to-Peer Systems UC Berkeley June 2003. [pdf]
• C. Dwork, A. Goldberg, and M. Naor.
  "On Memory-Bound Functions for Fighting Spam,''
  CRYPTO 2003.

Networking

• J. Y. Halpern and L. Li.
  A minimum-energy path-preserving topology-control algorithm, 
  IEEE Transactions on Wireless Communications 3:3, 2004, pp. 910-921.
• L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhoffer, 
  A cone-based distributed topology-control algorithm for wireless multi-hop networks,
  IEEE/ACM Transactions on Networking, 13:1, 2005, pp. 147-159.
• Jian Zhang, Jennifer Rexford, and Joan Feigenbaum,
  "Learning-Based Anomaly Detection in BGP Updates",
  Yale University Technical Report YALEU/DCS/TR-1318, April 2005. [pdf]
• Yun Mao, Björn Knutsson, Honghui Lu, Jonathan M. Smith
  "DHARMA: Distributed Home Agent for Robust Mobile Access'',
  To appear in Proceedings of the 24rd Conference of the IEEE Communications Society (INFOCOM'2005). [pdf]
• Zygmunt Haas, Joseph Y. Halpern, and Li Li,
  "Gossip-based ad hoc routing'',
  Proceedings of Infocom, 2002, pp. 1707-1716 [pdf]
• Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, and Roger Wattenhofer
  "A cone-based distributed topology-control algorithm for wireless multi-hop networks'',
  to appear, IEEE/ACM Transactions on Networks [pdf]
• Li Li and Joseph Y. Halpern
  "A minimum-energy path-preserving topology-control algorithm'',
  IEEE Transactions on Wireless Communications 3:3, 2004, pp. 910--921 [pdf]
• Aaron D. Jaggard and Vijay Ramachandran,
  "Robustness of Class-Based Path-Vector Systems''
  to appear in the Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004).
• Yun Mao, Willem deBruijn, Bjorn Knutsson, Honghui Lu, Jonathan M. Smith.
  "DHARMA: Distributed Home Agent for Robust Mobile Access''
  SOSP 2003 WIP Session.
• B. Knutsson, H. Lu, J. Mogul, B. Hopkins,
  "Architecture and performance of server-directed transcoding''
  published in ACM Transactions on Internet Technology (TOIT), volume 3, issue 4 (November 2003), pages 392 - 424. [available through the ACM Digital Library]
• Björn Knutsson, Honghui Lu, Wei Xu and Bryan Hopkins,
  "Peer-to-Peer Support for Massively Multiplayer Games''
  in Proceedings of the 23rd Conference of the IEEE Communications Society (INFOCOM'2004).
• Timothy G. Griffin, Aaron D. Jaggard, and Vijay Ramachandran,
  "Design Principles of Policy Languages for Path Vector Protocols''
  in SIGCOMM 2003 [.pdf]
• K. G. Anagnostakis, M. B. Greenwald, S. Ioannidis, A. D. Keromytis, D. Li,
  "A Cooperative Immunization System for an Untrusting Internet''
  in Proceedings of IEEE ICON 2003, September/October 2003 [pdf]
• S. Zhong, J. Chen, Y. R. Yang,
  "Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks''
  in Proceedings of INFOCOM 2003, April 2003 [.pdf]
• K. G. Anagnostakis, M. B. Greenwald, R. S. Ryger,
  "cing: Measuring Network-Internal Delays using only Existing Infrastructure''
  in Proceedings of INFOCOM 2003, April 2003 [pdf]
• K. G. Anagnostakis, S. Antonatos, M. Polychronakis, E. P. Markatos,
  "E2xB: A Domain-Specific String Matching Algorithm for Intrusion Detection''
  in Proceedings of the 18th IFIP International Information Security Conference (SEC2003), May 2003 [pdf of draft]
• S. Antonatos, K. G. Anagnostakis, M. Polychronakis, E. P. Markatos
  "Performance Analysis of Content Matching Intrusion Detection Systems''
  to appear in Proceedings of IEEE SAINT 2004, January 2004
• H. Bos, B. Samwel, M. Cristea, K. G. Anagnostakis,
  "Safe Execution of Untrusted Code on Embedded Network Processors''
  to appear in Domain-Specific Processors: Systems, Architectures, Modeling, and Simulation (Ed Deprettere, Shuvra Bhattacharyya, and Juergen Teich; Eds) M. Dekker Publishing, 2003 [pdf of draft]
• E. P. Markatos, S. Antonatos, M. Polychronakis, K. G. Anagnostakis,
  "Exclusion-based Signature Matching for Intrusion Detection''
  in Proceedings of the IASTED Conference on Communications and Computer Networks, pp. 146-152, Cambridge, USA, November 2002. [ps.gz ] [pdf ]
• K. G. Anagnostakis, S. Ioannidis, S. Miltchev, M. B. Greenwald,
  "Open Packet Monitoring on FLAME: Safety, Performance and Applications''
  in Proceedings of the 4th IFIP International Working Conference on Active Networks (IWAN), Zurich, Switzerland, December 2002 [ps.gz of draft] [pdf]
• K. G. Anagnostakis, R. S. Ryger, M. B. Greenwald,
  "On the Sensitivity of Network Simulation to Topology''
  in Proceedings of the 10th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2002), October 2002 [ps] [pdf]
• K. G. Anagnostakis, M. B. Greenwald,
  "Direct Measurement versus Indirect Inference for Determining Network Internal Delays''
  in Proceedings of the 22nd IFIP International Symposium on Computer Performance Modeling, Measurement and Evaluation (Performance 2002), Rome, Italy, September 2002 [ps.gz] [pdf]
• B. Knutsson, H. Lu and Jeffrey Mogul,
  "Architecture and pragmatics of server-directed transcoding''
  in Proceedings of the 7th International Workshop on Web Content Caching and Distribution, August 2002. [pdf]
• E. Jeannot, B. Knutsson and M. Björkman,
  "Adaptive Online Data Compression''
  in the Proceedings of the 11th IEEE International Symposium on High-Performance Distributed Computing, July 2002. [pdf.gz]
• S. Ioannidis, K. G. Anagnostakis, J. Ioannidis, A. D. Keromytis
  "xPF: Packet Filtering for Low-Cost Network Monitoring''
  In Proceedings of the 3rd IEEE Workshop on High Performance Switching and Routing (HPSR), May 2002 [ps] [pdf]
• K. G. Anagnostakis, S. Ioannidis, S. Miltchev, J. Ioannidis, M. B. Greenwald, and J. M. Smith,
  "Efficient Packet Monitoring for Network Management"
  in Proceedings of the 8th IEEE/IFIP Network Operations and Management Symposium (NOMS) 2002, Florence, Italy, April 2002  [ps.gz] [pdf]
• J. Ioannidis, S. Ioannidis, A. D. Keromytis, V. Prevelakis
  "Fileteller: Paying and Getting Paid for File Storage"
  In Proceedings of Financial Cryptography (FC) 2002. March 2002 [ps]
• K. G. Anagnostakis and J. M. Smith,
  "BOP: A Bourse of Packets Approach to Internetwork Resource Control"
  Abstract in Proceedings of the INFORMS 2001 Annual Meeting, Session on Pricing and Economic Analysis of Telecommunications, November 2001
• K. G. Anagnostakis, S. Ioannidis, S. Miltchev and J. M. Smith,
  "Practical Network Applications on a Lightweight Active Management Environment''
  in Proceedings of the 3rd International Conference on Active Networks (IWAN), pp. 101-115. Philadelphia, USA, October 2001  [ps.gz] [pdf]
   

Other

• Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Straussk and Rebecca N. Wright,
  Secure Multiparty Computation of Approximations,
  in ACM Transactions on Algorithms, 2 (2006), pp. 435-472. [pdf]
  
• Jian Zhang and Joan Feigenbaum,
  Finding Highly Correlated Pairs Efficiently with Powerful Pruning,
  in Proceedings of the 2006 ACM Conference on Information and Knowledge Management. [pdf]
  
• J. Y. Halpern and J. Pearl.
  Causes and explanations: A structural-model approach---Part I: Causes,
  British Journal for the Philosophy of Science 56:4, 2005, pp. 843--887.
• J. Y. Halpern and J. Pearl.
  Causes and explanations: A structural-model approach---Part II: Explanation,
  British Journal for the Philosophy of Science 56:4, 2005, pp. 889-911.
• J. Y. Halpern.
  Sleeping Beauty reconsidered: Conditioning and reflection in asynchronous systems,
  in Oxford Studies in Epistemology, Vol. 1 (T. S. Gendler and J. Hawthorne, eds.), 2005, pp. 111--142.
• J. Y. Halpern and R. Pucella.
  Evidence with uncertain likelihoods,
  Proceedings of the Twenty-First Conference on Uncertainty in AI, July, 2005, pp. 243--250.
• J. Y. Halpern and R. Shore.
  Reasoning about common knowledge with infinitely many agents, 
  Information and Computation 191:1, 2004, pp. 1-40.
• J. Y. Halpern, R. van der Meyden, and M. Y. Vardi. 
  Complete axiomatizations for reasoning about knowledge and time,
  SIAM Journal on Computing 33:2, 2004, pp. 674-703.
• J. Y. Halpern and Y. Moses. 
  Using counterfactuals in knowledge-based programming, 
  Distributed Computing 17:2, 2004, pp. 91-106.
• J. Y. Halpern and H. Chockler.
  Responsibility and blame: A structural-model approach,
  Journal of AI Research 22, 2004, pp. 93-115.
  
• J. Y. Halpern and A. Ricciardi.
  A knowledge-theoretic analysis of uniform distributed coordination and failure detectors,
  Distributed Computing 17:3, 2005, pp. 223-236.
• P.D. Grunwald and J. Y. Halpern,
  When ignorance is bliss,
  Proceedings of the Twenthieth Conference on Uncertainty in AI, 2004, pp. 226-234.
• M. Bickford, R. L. Constable, J. Y. Halpern, and S. Petride,
  Knowledge-based synthesis of distributed systems using event structures,
  Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), 2005 (Lecture Notes in Computer Science, vol. 3452), pp. 449-465.
• J. Y. Halpern.
  Reasoning About Uncertainty,
  MIT Press, 2003.
• M. DeLap, B. Knutsson, H. Lu, O. Sokolsky, U. Sammapun, I. Lee and C. Tsarouchis
  "Is Runtime Verification Applicable to Cheat Detection?''
  in Proceedings of the ACM SIGCOMM workshop on Network and System Support for Games 2004 (NetGames'2004), August 2004, Portland, OR, USA. [pdf]
• D. Coppersmith and M. Elkin,
  " Sparse Distance Preservers and Additive Spanners'',
  to appear in Proc. of ACM-SIAM Symposium on Discrete Algorithms, Vancouver, British Columbia, Canada, 2005. [ps]
• M. Elkin,
  "A Faster Distributed Protocol for Constructing a Minimum Spanning Tree'',
  In Proc. of ACM-SIAM Symposium on Discrete Algorithms, pp. 359-368, New Orleans, LA, 2004. [ps]
• M. Elkin and G. Kortsarz,
  "Polylogarithmic Inapproximability of the Radio Broadcast Problem'',
  In Proc. of 7th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 105-114, Cambridge, MA, 2004. [ps]
• Joan Feigenbaum, Benny Pinkas, Raphael Ryger, and Felipe Saint-Jean.
  "Secure Computation of Surveys''.
  EU Workshop on Secure Multiparty Protocols, Amsterdam, The Netherlands, October 2004. [pdf]
• J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang.
  "Graph Distances in the Streaming Model: The Value of Space''.
  in Proceedings of the 16th Symposium on Discrete Algorithms (SODA'05), ACM/SIAM, New York/Philadelphia, 2005, pp. 745-754. [pdf]
• James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong
  "Towards a Theory of Data Entanglement''.
  in Proceedings of the 9th ESORICS, Springer LNCS 3193, 2004, pp. 177-192. [pdf]
• M. Elkin, J. Zhang,
  "Efficient Algorithms for Constructing (1+epsilon,beta)-Spanners in the Distributed and Streaming Models.''
  in Proceedings of the 2004 ACM Symposium on Principles of Distributed Computing (PODC'04). pages 160-168. [pdf]
• M. L. Elkin,
  "Unconditional Lower Bounds on the Time-Approximation Tradeoff of the Distributed Minimum Spanning Tree Problem.''
  in Proc. 36th Annual ACM Symp. on Theory of Computing, STOC'04 [ps]
• Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang,
  "On Graph Problems in a Semi-Streaming Model.''
  Theoretical Computer Science 348 (2005), pp. 207-216. (Special issue of selected papers from ICALP'04.) [ps]
• Ninghui Li, Wenliang Du, and Dan Boneh ,
  "Oblivious Signature-Based Envelope. ''
  in ACM Symposium on Principles of Distributed Computing (PODC 2003), Boston, Massachusetts, July 2003.
• Sheng Zhong and Yang Richard Yang,
  "Verifiable Distributed Oblivious Transfer and Mobile Agent Security",
  DialM-POMC 2003. [.pdf]
• Tugkan Batu, Funda Ergun, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, and Rahul Sami,
  "A Sublinear Algorithm for Weakly Approximating Edit Distance",
  in the Proceedings of the 2003 Symposium on the Theory of Computation, pages 316--324.
• Joan Feigenbaum, Sampath Kannan, and Jian Zhang
  "Computing Diameter in the Streaming and Sliding-Window Models",
  Algorithmica 41 (2005), pp. 25-41. [ps] [.pdf]
• James Aspnes, Zoe Diamadi, Gauri Shah,
  "Fault-tolerant Routing in Peer-to-peer Systems",
  in Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing, pages 223-233. [ps] [pdf]
• Gabriel H. Loh, Rahul Sami, Daniel H. Friendly,
  "Memory Bypassing: Not Worth the Effort ",
  in the Proceedings of the Workshop on Duplicating, Deconstructing, and Debunking, May 26, 2002, Anchorage, Alaska. (Held in conjunction with the 29th International Symposium on Computer Architecture). [.pdf]
• Aaron D. Jaggard,
  " Prefix exchanging and pattern avoidance by involutions",
  Electronic Journal of Combinatorics, 9 (2), 2003 [link to abstract and paper]