| 2011 | ||
|---|---|---|
| 31 | Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright: Distributed Computing with Adaptive Heuristics. ICS 2011: 417-443 | |
| 30 | Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright: Distributed computing with rules of thumb. PODC 2011: 333-334 | |
| 29 | Alex Fabrikant, Aaron D. Jaggard, Michael Schapira: On the Structure of Weakly Acyclic Games CoRR abs/1108.2092: (2011) | |
| 28 | Andrew Baxter, Aaron D. Jaggard: Pattern Avoidance by Even Permutations. Electr. J. Comb. 18(2): (2011) | |
| 27 | 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) | |
| 2010 | ||
| 26 | Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira: Approximate privacy: foundations and quantification (extended abstract). ACM Conference on Electronic Commerce 2010: 167-178 | |
| 25 | Aaron D. Jaggard, Catherine Meadows, Michael Mislove, Roberto Segala: Reasoning about Probabilistic Security Using Task-PIOAs. ARSPA-WITS 2010: 2-22 | |
| 24 | Alex Fabrikant, Aaron D. Jaggard, Michael Schapira: On the Structure of Weakly Acyclic Games. SAGT 2010: 126-137 | |
| 23 | Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira: Approximate Privacy: PARs for Set Problems CoRR abs/1001.3388: (2010) | |
| 2009 | ||
| 22 | Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. Wright: The Impact of Communication Models on Routing-Algorithm Convergence. ICDCS 2009: 58-67 | |
| 21 | 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) | |
| 20 | Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira: Approximate Privacy: Foundations and Quantification CoRR abs/0910.5714: (2009) | |
| 2008 | ||
| 19 | Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Computationally sound mechanized proofs for basic and public-key Kerberos. ASIACCS 2008: 87-99 | |
| 18 | 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 | |
| 17 | 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) | |
| 2007 | ||
| 16 | Aaron D. Jaggard: An almost-bijective proof of an asymptotic property of partitions. Random Struct. Algorithms 31(2): 247-250 (2007) | |
| 2006 | ||
| 15 | Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. ASIAN 2006: 167-181 | |
| 14 | 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 | |
| 13 | Aaron D. Jaggard, Vijay Ramachandran: Robust Path-Vector Routing Despite Inconsistent Route Preferences. ICNP 2006: 270-279 | |
| 12 | 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) | |
| 11 | 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) | |
| 10 | 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) | |
| 2005 | ||
| 9 | Aaron D. Jaggard, Vijay Ramachandran: Relating two formal models of path-vector routing. INFOCOM 2005: 619-630 | |
| 8 | Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Specifying Kerberos 5 cross-realm authentication. WITS 2005: 12-26 | |
| 7 | Aaron D. Jaggard: Subsequence Containment by Involutions. Electr. J. Comb. 12: (2005) | |
| 6 | Aaron D. Jaggard, Vijay Ramachandran: Toward the design of robust interdomain routing protocols. IEEE Network 19(6): 35-41 (2005) | |
| 2004 | ||
| 5 | Aaron D. Jaggard, Vijay Ramachandran: Robustness of Class-Based Path-Vector Systems. ICNP 2004: 84-93 | |
| 2003 | ||
| 4 | Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: Verifying Confidentiality and Authentication in Kerberos 5. ISSS 2003: 1-24 | |
| 3 | Timothy Griffin, Aaron D. Jaggard, Vijay Ramachandran: Design principles of policy languages for path vector protocols. SIGCOMM 2003: 61-72 | |
| 2002 | ||
| 2 | Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175- | |
| 1 | Aaron D. Jaggard: Prefix Exchanging and Pattern Avoidance by Involutions. Electr. J. Comb. on(2): (2002) | |
| 1 | Michael Backes | [12] [14] [27] |
| 2 | Andrew Baxter | [28] |
| 3 | Bruno Blanchet | [19] |
| 4 | Frederick Butler | [2] [4] [10] |
| 5 | Iliano Cervesato | [2] [4] [8] [10] [11] [12] [14] [15] [17] [27] |
| 6 | Alex Fabrikant | [24] [29] |
| 7 | Joan Feigenbaum | [20] [23] [26] |
| 8 | Sharon Goldberg | [18] |
| 9 | Timothy G. Griffin (Timothy Griffin) | [3] |
| 10 | Shai Halevi | [18] |
| 11 | Catherine Meadows | [25] |
| 12 | Michael Mislove | [25] |
| 13 | Vijay Ramachandran | [3] [5] [6] [9] [13] [18] [22] |
| 14 | Andre Scedrov | [2] [4] [8] [10] [11] [12] [14] [15] [17] [19] [27] |
| 15 | Michael Schapira | [20] [21] [23] [24] [26] [29] [30] [31] |
| 16 | Roberto Segala | [25] |
| 17 | Joe-Kai Tsay | [11] [12] [14] [15] [17] [19] [27] |
| 18 | Christopher Walstad | [8] [10] [11] [15] [17] |
| 19 | Rebecca N. Wright | [18] [21] [22] [30] [31] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page