A Formal Analysis of Some Properties of Kerberos 5 Using MSR. - Frederick Butler; Iliano Cervesato; Aaron D. Jaggard; Andre Scedrov (CSFW, 2002)

Prefix Exchanging and Pattern Avoidance by Involutions. - Aaron D. Jaggard (Electron. J. Comb., 2002)

Verifying Confidentiality and Authentication in Kerberos 5. - Frederick Butler; Iliano Cervesato; Aaron D. Jaggard; Andre Scedrov (ISSS, 2003)

Design principles of policy languages for path vector protocols. - Timothy Griffin; Aaron D. Jaggard; Vijay Ramachandran (SIGCOMM, 2003)

Robustness of Class-Based Path-Vector Systems. - Aaron D. Jaggard; Vijay Ramachandran (ICNP, 2004)

Relating two formal models of path-vector routing. - Aaron D. Jaggard; Vijay Ramachandran (INFOCOM, 2005)

Specifying Kerberos 5 cross-realm authentication. - Iliano Cervesato; Aaron D. Jaggard; Andre Scedrov; Christopher Walstad (WITS, 2005)

Subsequence Containment by Involutions. - Aaron D. Jaggard (Electron. J. Comb., 2005)

Toward the design of robust interdomain routing protocols. - Aaron D. Jaggard; Vijay Ramachandran (IEEE Netw., 2005)

Robust Path-Vector Routing Despite Inconsistent Route Preferences. - Aaron D. Jaggard; Vijay Ramachandran (ICNP, 2006)

Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. - Michael Backes 001; Iliano Cervesato; Aaron D. Jaggard; Andre Scedrov; Joe-Kai Tsay (IACR Cryptol. ePrint Arch., 2006)

Breaking and Fixing Public-Key Kerberos. - Iliano Cervesato; Aaron D. Jaggard; Andre Scedrov; Joe-Kai Tsay; Christopher Walstad (IACR Cryptol. ePrint Arch., 2006)

Formal analysis of Kerberos 5. - Frederick Butler; Iliano Cervesato; Aaron D. Jaggard; Andre Scedrov; Christopher Walstad (Theor. Comput. Sci., 2006)

An almost-bijective proof of an asymptotic property of partitions. - Aaron D. Jaggard (Random Struct. Algorithms, 2007)

Computationally sound mechanized proofs for basic and public-key Kerberos. - Bruno Blanchet; Aaron D. Jaggard; Andre Scedrov; Joe-Kai Tsay (AsiaCCS, 2008)

Rationality and traffic attraction: incentives for honest path announcements in bgp. - Sharon Goldberg; Shai Halevi; Aaron D. Jaggard; Vijay Ramachandran; Rebecca N. Wright (SIGCOMM, 2008)

The Impact of Communication Models on Routing-Algorithm Convergence. - Aaron D. Jaggard; Vijay Ramachandran; Rebecca N. Wright (ICDCS, 2009)

Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond - Aaron D. Jaggard; Michael Schapira; Rebecca N. Wright (CoRR, 2009)

Reasoning about Probabilistic Security Using Task-PIOAs. - Aaron D. Jaggard; Catherine Meadows 001; Michael W. Mislove; Roberto Segala (ARSPA-WITS, 2010)

Approximate privacy: foundations and quantification (extended abstract). - Joan Feigenbaum; Aaron D. Jaggard; Michael Schapira (EC, 2010)

Approximate Privacy: PARs for Set Problems - Joan Feigenbaum; Aaron D. Jaggard; Michael Schapira (CoRR, 2010)

Distributed Computing with Adaptive Heuristics. - Aaron D. Jaggard; Michael Schapira; Rebecca N. Wright (ICS, 2011)

Towards a formal model of accountability. - Joan Feigenbaum; Aaron D. Jaggard; Rebecca N. Wright (NSPW, 2011)

Distributed computing with rules of thumb. - Aaron D. Jaggard; Michael Schapira; Rebecca N. Wright (PODC, 2011)

Accountability and deterrence in online life. - Joan Feigenbaum; James A. Hendler; Aaron D. Jaggard; Daniel J. Weitzner; Rebecca N. Wright (WebSci, 2011)

Pattern Avoidance by Even Permutations. - Andrew Baxter; Aaron D. Jaggard (Electron. J. Comb., 2011)

The design space of probing algorithms for network-performance measurement. - Aaron D. Jaggard; Swara Kopparty; Vijay Ramachandran; Rebecca N. Wright (SIGMETRICS, 2013)

On the Structure of Weakly Acyclic Games. - Alex Fabrikant; Aaron D. Jaggard; Michael Schapira (Theory Comput. Syst., 2013)

Open vs. closed systems for accountability. - Joan Feigenbaum; Aaron D. Jaggard; Rebecca N. Wright (HotSoS, 2014)

Self-stabilizing Uncoupled Dynamics. - Aaron D. Jaggard; Neil Lutz; Michael Schapira; Rebecca N. Wright (SAGT, 2014)

Strange Bedfellows: How and When to Work with Your Enemy. - Aaron D. Jaggard; Rebecca N. Wright (Security Protocols Workshop, 2014)

Representing Network Trust and Using It to Improve Anonymous Communication. - Aaron D. Jaggard; Aaron Johnson 001; Paul F. Syverson; Joan Feigenbaum (CoRR, 2014)

Approximate Privacy: Foundations and Quantification. - Joan Feigenbaum; Aaron D. Jaggard; Michael Schapira (ACM Trans. Algorithms, 2014)

20, 000 In League Under the Sea: Anonymous Communication, Trust, MLATs, and Undersea Cables. - Aaron D. Jaggard; Aaron Johnson 001; Sarah Cortes; Paul Syverson; Joan Feigenbaum (Proc. Priv. Enhancing Technol., 2015)

Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection. - Aaron Johnson 001; Rob Jansen; Aaron D. Jaggard; Joan Feigenbaum; Paul Syverson (NDSS, 2017)

Onions in the Crosshairs: When The Man really is out to get you. - Aaron D. Jaggard; Paul Syverson (WPES@CCS, 2017)

Onions in the Crosshairs: When The Man really is out to get you. - Aaron D. Jaggard; Paul Syverson (CoRR, 2017)

Dynamics at the Boundary of Game Theory and Distributed Computing. - Aaron D. Jaggard; Neil Lutz; Michael Schapira; Rebecca N. Wright (ACM Trans. Economics and Comput., 2017)

NExtSteP: An Extensible Testbed for Network Covert Channels. - Olga Chen; Aaron D. Jaggard; Catherine Meadows 001; Michael C. Shlanta (CNS, 2020)

Accountability in Computing: Concepts and Mechanisms. - Joan Feigenbaum; Aaron D. Jaggard; Rebecca N. Wright (Found. Trends Priv. Secur., 2020)

Throwing Your Weight Around: Fixing Tor's Positional Weighting. - Aaron Johnson 001; Aaron D. Jaggard; Paul Syverson (Proc. Priv. Enhancing Technol., 2023)

A Logic of Sattestation. - Aaron D. Jaggard; Paul Syverson; Catherine Meadows 001 (CSF, 2024)