Publications by Topic

Collaborators

Papers

1. Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, and Joe-Kai Tsay, "Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos"
   • International Journal of Information Security, 10 (2), 2011, pp. 107-134. doi:10.1007/s10207-011-0125-6
   • Available as IACR ePrint report 2006/219 (revision of Jan. 2010).
2. Aaron D. Jaggard, Catherine Meadows, Michael Mislove, and Roberto Segala, "Reasoning About Probabilistic Security Using Task-PIOAs"
   • Proceedings of ARSPA-WITS'10 (March 2010).
   • Post-proceedings version to appear in ARSPA-WITS 2010, LNCS 6186, pp. 2–22 (November 2010). doi:10.1007/978-3-642-16074-5_2
3. Bruno Blanchet, Aaron D. Jaggard, Jesse Rao, Andre Scedrov, and Joe-Kai Tsay, "Refining Computationally Sound Mechanized Proofs for Kerberos"
   • Abstract presented at FCC'09
4. Aaron D. Jaggard, Cathy Meadows, Michael Mislove, and Roberto Segala, "Task Probabilistic Input/Ouput Automata as Domains",
   • Presented at FCC'08
   • Collection of all FCC'08 abstracts (16-page PDF)
5. B. Blanchet, A. D. Jaggard, A. Scedrov, and J.-K. Tsay, "Computationally Sound Mechanized Proofs for Basic and Public-key Kerberos,"
   • Proceedings of ASIACCS 2008, pp. 87--99 (2008). doi:10.1145/1368310.1368326
   This extends the work presented in:
   • Aaron D. Jaggard, Andre Scedrov, and Joe-Kai Tsay, "Computationally Sound Mechanized Proof of PKINIT for Kerberos,"
     • Presented at FCC'07. [PDF]
6. I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad, "Breaking and Fixing Public-Key Kerberos,"
   • Information and Computation 206, pp. 402--424 (2008). doi:10.1016/j.ic.2007.05.005
   • This work is related to Microsoft Security Bulletin MS05-042.
   This extends preliminary work presented in:
   • I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad, "Breaking and Fixing Public-Key Kerberos,"
     • Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues, LNCS 4435, pp. 167-181. doi:10.1007/978-3-540-77505-8_13
   • I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad, "Breaking and Fixing Public-Key Kerberos,"
     • Sixth Workshop on Issues in the Theory of Security - WITS'06 (Dieter Gollmann and Jan Juerjens, editors), pp. 55-70, Vienna, Austria, 25-26 March 2006.
7. M. Backes, I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, "Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos,"
   • ESORICS 2006
   • Expanded version on Cryptology ePrint Archive: Report 2006/219
8. F. Butler, I. Cervesato, A. D. Jaggard, A. Scedrov, and C. Walstad, "Formal Analysis of Kerberos 5,"
   
   • Theoretical Computer Science 367, pp. 57--87 (2006) doi:10.1016/j.tcs.2006.08.040
   This extends preliminary work presented in:
   • Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, and Chris Walstad, "Specifying Kerberos 5 Cross-Realm Authentication,"
     • Proceedings of WITS 05 (Long Beach, USA, January 2005).[PDF] doi:10.1145/1045405.1045408
   • Fred Butler, Iliano Cervesato, Aaron D. Jaggard, and Andre Scedrov, "A Formal Analysis of Some Properties of Kerberos 5 using MSR"
     • UPenn CIS Technical Report MS-CIS-04-04 (59 pages, April 2004).
       [PDF] [PS]
   • Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, and Andre Scedrov, "Verifying Confidentiality and Authentication in Kerberos 5,"
     • In Software Security - Theories and Systems --- ISSS 2003, Springer-Verlag LNCS 3233, K. Futatsugi, F. Mizoguchi, and N. Yonezaki, eds. doi:10.1007/b102118
   • Fred Butler, Iliano Cervesato, Aaron D. Jaggard, and Andre Scedrov, "A formal analysis of some properties of Kerberos 5 using MSR,"
     • 15th IEEE Computer Security Foundations Workshop, 2002. doi:10.1109/CSFW.2002.1021815
     • Preliminary version: [PDF] [PS] [GZipped PS]

Collaborators

Papers

1. Joan Feigenbaum, Aaron D. Jaggard, and Rebecca N. Wright, "Towards a Formal Model of Accountability"
   • To appear in the proceedings of NSPW 2011 (September 2011).
   • 11-page pdf (Copyright ACM 2011. This is the authors' version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in the Proceedings of NSPW'11.)
2. Joan Feigenbaum, James Hendler, Aaron D. Jaggard, Daniel Weitzner, and Rebecca N. Wright, "Accountability and Deterrence in Online Life (Extended Abstract)''
   • Proceedings of ACM Web Science 2011 [Seven-page pdf].
3. Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira, "Approximate Privacy: Foundations and Quantification (Extended Abstract)"
   • Proceedings of ACM EC'10 (June 2010). doi:10.1145/1807342.1807369
   • Full version split between (the arXiv versions are newer; the corresponding DIMACS TR versions have been submitted and should be online soon):
     • "Approximate Privacy: Foundations and Quantification," DIMACS Technical Report 2009-14 [abstract, 32-page pdf]; also available as arXiv:0910.5714 (33 pages).
     • "Approximate Privacy: PARs for Set Problems," DIMACS Technical Report 2010-01 [abstract, 32-page pdf]; also available as arXiv:1001.3388 (34 pages)

Collaborators

Papers

1. Aaron D. Jaggard, Michael Schapira, and Rebecca N. Wright, "Distributed Computing with Adaptive Heuristics"
   • Proceedings of ICS 2011, pp. 417-443 (January 2011) [28-page pdf].
   • Also: "Brief Announcement: Distributed Computing with Rules of Thumb," presented at PODC 2011 (June 2011) [two-page pdf]
2. Alex Fabrikant, Aaron D. Jaggard, and Michael Schapira, "On the Structure of Weakly Acyclic Games"
   • Proceedings of SAGT 2010 (October 2010) [12-page pdf]
   • Revised and extended version available as arXiv:1108.2092
3. Aaron D. Jaggard, Vijay Ramachandran, and Rebecca N. Wright, "The Impact of Communication Models on Routing-Algorithm Convergence"
   • Proceedings of ICDCS 2009, pp. 58--67 (June 2009). doi:10.1109/ICDCS.2009.61
   • DIMACS Technical Report 2008-06 [Version of 2008-11-24: abstract, 29-page pdf]
4. Sharon Goldberg, Shai Halevi, Aaron D. Jaggard, Vijay Ramachandran, and Rebecca N. Wright, "Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP"
   • Proceedings of SIGCOMM 2008, pp. 267--278 (2008). doi:10.1145/1402946.1402989, [12-page pdf]
   • Princeton CS Technical Report TR-823-08.
5. Aaron D. Jaggard, Vijay Ramachandran, and Rebecca N. Wright, "Towards a Realistic Model of Incentives in Interdomain Routing: Decoupling Forwarding from Signaling"
   • DIMACS Technical Report 2008-02 [Version of 2008-04-27: abstract, 37-page pdf]
6. Aaron D. Jaggard and Vijay Ramachandran, "Robust Path-Vector Routing Despite Inconsistent Route Preferences"
   • Proceedings of IEEE ICNP 2006 (Santa Barbara, USA, November 2006)
   • (Extended preliminary version) Yale CS Technical Report 1314 [.pdf]
7. Aaron D. Jaggard and Vijay Ramachandran, "Towards the Design of Robust Inter-domain Routing Protocols," IEEE Network 19 (6), 35-41 (2005).
   
   • Preliminary version [.pdf]
8. Aaron D. Jaggard and Vijay Ramachandran, "Relating Two Formal Models of Path-Vector Routing,"
   
   • Proceedings of IEEE INFOCOM 2005 (Miami, USA, March 2005) [.pdf] [.ps]
   • (Extended version) Yale CS Technical Report 1301 (in preparation)
9. Aaron D. Jaggard and Vijay Ramachandran, "Robustness of Class-Based Path-Vector Systems,"
   
   • Proceedings of ICNP 2004 (Berlin, Germany, October 2004) [.pdf] [.ps]
   • (Extended version) Yale CS Technical Report 1296 (in preparation)
10. Timothy G. Griffin, Aaron D. Jaggard, and Vijay Ramachandran, "Design Principles of Policy Languages for Path Vector Protocols,"
    
    • Proceedings of SIGCOMM 2003 (.pdf) (Karlsruhe, Germany, August 2003)
    • (Extended version) Yale CS Technical Report 1250 (26 pages, April 2004) [.pdf] [.ps]

Collaborators

Papers

1. Andrew M. Baxter and Aaron D. Jaggard, "Pattern avoidance by even permutations''
   • Elec. J. Combin., 18(2) P28, 15 pages (electronic) (2011)
2. Aaron D. Jaggard and Joseph J. Marincel, "Generating-tree isomorphisms for pattern-avoiding involutions"
   • Annals of Combinatorics, 15 (3), 2011, pp. 437-448. doi:10.1007/s00026-011-0101-x
   • Authors' final copy (14-page pdf)
3. Aaron D. Jaggard, "An almost-bijective proof of an asymptotic property of partitions," Random Structures & Algorithms, 31 (2), 2007, pp. 247--250. doi:10.1002/rsa.20180
4. Aaron D. Jaggard, "Subsequence containment by involutions," Electronic Journal of Combinatorics 12 (1), 2005 #R14, 15 pages.
5. Aaron D. Jaggard, "Prefix exchanging and pattern avoidance by involutions," Electronic Journal of Combinatorics 9 (2), 2003 #R16, 24 pages.

Collaborators

Papers

1. Dwight L. Jaggard and Aaron D. Jaggard, "Fractal Ring Arrays," Wave Motion (Special Issue: Electrodynamics in Complex Environments). 34 281-299 (2001).
2. Aaron D. Jaggard and Dwight L. Jaggard, "Cantor Ring Diffractals," Optics Comm. 158, 141-148 (1998).
3. Dwight L. Jaggard and Aaron D. Jaggard, "Cantor Ring Arrays," Microwave and Optical Technology Letters 19, 121-125 (1998).
4. Aaron D. Jaggard and Dwight L. Jaggard, "Scattering from Fractal Superlattices with Variable Lacunarity," J. Opt. Soc. Am. A 15, 1626-1635 (1998)
5. Dwight L. Jaggard and Aaron D. Jaggard, "Polyadic Cantor Superlattices with Variable Lacunarity," Opt. Lett. 22, 145-147 (1997)

Book Chapters

1. Dwight L. Jaggard, Aaron D. Jaggard, and Panayiotis V. Frangos, "Fractal Electrodynamics: Surfaces and Superlattices," Chapter 1 (pages 1-47) in Frontiers in Electromagnetics, Douglas H. Werner and Raj Mittra, eds., IEEE Press (2000)
2. Douglas H. Werner, Pingjuan L. Werner, Dwight L. Jaggard, Aaron D. Jaggard, Carles Puente, and Randy L. Haupt "The Theory and Design of Fractal Antenna Arrays," Chapter 3 (pages 94-203) in Frontiers in Electromagnetics, Douglas H. Werner and Raj Mittra, eds., IEEE Press (2000)

Monday, June 6, 2011 at 02:33