| 2011 | ||
|---|---|---|
| j8 | Andrew Baxter, Aaron D. Jaggard: Pattern Avoidance by Even Permutations. Electr. J. Comb. 18(2) (2011) | |
| j7 | Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically sound security proofs for basic and public-key Kerberos. Int. J. Inf. Sec. 10(2): 107-134 (2011) | |
| c18 | Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright: Distributed Computing with Adaptive Heuristics. ICS 2011: 417-443 | |
| c17 | Joan Feigenbaum, Aaron D. Jaggard, Rebecca N. Wright: Towards a formal model of accountability. NSPW 2011: 45-56 | |
| c16 | Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright: Distributed computing with rules of thumb. PODC 2011: 333-334 | |
| i6 | Alex Fabrikant, Aaron D. Jaggard, Michael Schapira: On the Structure of Weakly Acyclic Games. CoRR abs/1108.2092 (2011) | |
| 2010 | ||
| c15 | Aaron D. Jaggard, Catherine Meadows, Michael W. Mislove, Roberto Segala: Reasoning about Probabilistic Security Using Task-PIOAs. ARSPA-WITS 2010: 2-22 | |
| c14 | Alex Fabrikant, Aaron D. Jaggard, Michael Schapira: On the Structure of Weakly Acyclic Games. SAGT 2010: 126-137 | |
| c13 | Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira: Approximate privacy: foundations and quantification (extended abstract). ACM Conference on Electronic Commerce 2010: 167-178 | |
| i5 | Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira: Approximate Privacy: PARs for Set Problems. CoRR abs/1001.3388 (2010) | |
| 2009 | ||
| c12 | Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. Wright: The Impact of Communication Models on Routing-Algorithm Convergence. ICDCS 2009: 58-67 | |
| i4 | Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright: Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond. CoRR abs/0910.1585 (2009) | |
| i3 | Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira: Approximate Privacy: Foundations and Quantification. CoRR abs/0910.5714 (2009) | |
| 2008 | ||
| j6 | Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and fixing public-key Kerberos. Inf. Comput. 206(2-4): 402-424 (2008) | |
| c11 | Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Computationally sound mechanized proofs for basic and public-key Kerberos. ASIACCS 2008: 87-99 | |
| c10 | Sharon Goldberg, Shai Halevi, Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. Wright: Rationality and traffic attraction: incentives for honest path announcements in bgp. SIGCOMM 2008: 267-278 | |
| 2007 | ||
| j5 | Aaron D. Jaggard: An almost-bijective proof of an asymptotic property of partitions. Random Struct. Algorithms 31(2): 247-250 (2007) | |
| 2006 | ||
| j4 | Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Formal analysis of Kerberos 5. Theor. Comput. Sci. 367(1-2): 57-87 (2006) | |
| c9 | Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. ASIAN 2006: 167-181 | |
| c8 | Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. ESORICS 2006: 362-383 | |
| c7 | Aaron D. Jaggard, Vijay Ramachandran: Robust Path-Vector Routing Despite Inconsistent Route Preferences. ICNP 2006: 270-279 | |
| i2 | Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. IACR Cryptology ePrint Archive 2006: 9 (2006) | |
| i1 | Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. IACR Cryptology ePrint Archive 2006: 219 (2006) | |
| 2005 | ||
| j3 | ||
| j2 | Aaron D. Jaggard, Vijay Ramachandran: Toward the design of robust interdomain routing protocols. IEEE Network 19(6): 35-41 (2005) | |
| c6 | Aaron D. Jaggard, Vijay Ramachandran: Relating two formal models of path-vector routing. INFOCOM 2005: 619-630 | |
| c5 | Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Specifying Kerberos 5 cross-realm authentication. WITS 2005: 12-26 | |
| 2004 | ||
| c4 | Aaron D. Jaggard, Vijay Ramachandran: Robustness of Class-Based Path-Vector Systems. ICNP 2004: 84-93 | |
| 2003 | ||
| c3 | Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: Verifying Confidentiality and Authentication in Kerberos 5. ISSS 2003: 1-24 | |
| c2 | Timothy Griffin, Aaron D. Jaggard, Vijay Ramachandran: Design principles of policy languages for path vector protocols. SIGCOMM 2003: 61-72 | |
| 2002 | ||
| j1 | Aaron D. Jaggard: Prefix Exchanging and Pattern Avoidance by Involutions. Electr. J. Comb. on(2) (2002) | |
| c1 | Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175- | |
Colors in the list of coauthors
Last update Sun May 26 09:51:45 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page