default search action
Aaron D. Jaggard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Aaron D. Jaggard, Paul Syverson, Catherine Meadows:
A Logic of Sattestation. CSF 2024: 356-371 - [i12]Aaron D. Jaggard, Paul Syverson, Catherine Meadows:
A Logic of Sattestation. CoRR abs/2405.01809 (2024) - 2023
- [j14]Aaron Johnson, Aaron D. Jaggard, Paul Syverson:
Throwing Your Weight Around: Fixing Tor's Positional Weighting. Proc. Priv. Enhancing Technol. 2023(4): 593-612 (2023) - 2020
- [j13]Joan Feigenbaum, Aaron D. Jaggard, Rebecca N. Wright:
Accountability in Computing: Concepts and Mechanisms. Found. Trends Priv. Secur. 2(4): 247-399 (2020) - [c26]Olga Chen
, Aaron D. Jaggard, Catherine Meadows, Michael C. Shlanta:
NExtSteP: An Extensible Testbed for Network Covert Channels. CNS 2020: 1-9
2010 – 2019
- 2017
- [j12]Aaron D. Jaggard
Dynamics at the Boundary of Game Theory and Distributed Computing. ACM Trans. Economics and Comput. 5(3): 15:1-15:20 (2017) - [c25]Aaron Johnson, Rob Jansen, Aaron D. Jaggard, Joan Feigenbaum, Paul Syverson:
Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection. NDSS 2017 - [c24]Aaron D. Jaggard
Onions in the Crosshairs: When The Man really is out to get you. WPES@CCS 2017: 141-151 - [i11]Aaron D. Jaggard, Paul Syverson:
Onions in the Crosshairs: When The Man really is out to get you. CoRR abs/1706.10292 (2017) - 2015
- [j11]Aaron D. Jaggard
20, 000 In League Under the Sea: Anonymous Communication, Trust, MLATs, and Undersea Cables. Proc. Priv. Enhancing Technol. 2015(1): 4-24 (2015) - [i10]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Dynamics at the Boundary of Game Theory and Distributed Computing. CoRR abs/1509.02955 (2015) - [i9]Aaron Johnson, Rob Jansen, Aaron D. Jaggard, Joan Feigenbaum, Paul F. Syverson:
Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection. CoRR abs/1511.05453 (2015) - 2014
- [j10]Joan Feigenbaum, Aaron D. Jaggard
Approximate Privacy: Foundations and Quantification. ACM Trans. Algorithms 10(3): 11:1-11:38 (2014) - [c23]Joan Feigenbaum, Aaron D. Jaggard
Open vs. closed systems for accountability. HotSoS 2014: 4 - [c22]Aaron D. Jaggard
Self-stabilizing Uncoupled Dynamics. SAGT 2014: 74-85 - [c21]Aaron D. Jaggard
Strange Bedfellows: How and When to Work with Your Enemy. Security Protocols Workshop 2014: 263-267 - [i8]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Self-stabilizing uncoupled dynamics. CoRR abs/1403.5791 (2014) - [i7]Aaron D. Jaggard, Aaron Johnson, Paul F. Syverson, Joan Feigenbaum:
Representing Network Trust and Using It to Improve Anonymous Communication. CoRR abs/1406.3583 (2014) - 2013
- [j9]Alex Fabrikant, Aaron D. Jaggard
On the Structure of Weakly Acyclic Games. Theory Comput. Syst. 53(1): 107-122 (2013) - [c20]Aaron D. Jaggard
The design space of probing algorithms for network-performance measurement. SIGMETRICS 2013: 105-116 - 2011
- [j8]Andrew Baxter, Aaron D. Jaggard:
Pattern Avoidance by Even Permutations. Electron. J. Comb. 18(2) (2011) - [j7]Michael Backes, Iliano Cervesato
Cryptographically sound security proofs for basic and public-key Kerberos. Int. J. Inf. Sec. 10(2): 107-134 (2011) - [c19]Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright:
Distributed Computing with Adaptive Heuristics. ICS 2011: 417-443 - [c18]Joan Feigenbaum, Aaron D. Jaggard
Towards a formal model of accountability. NSPW 2011: 45-56 - [c17]Aaron D. Jaggard
Distributed computing with rules of thumb. PODC 2011: 333-334 - [c16]Joan Feigenbaum, James A. Hendler
Accountability and deterrence in online life. WebSci 2011: 7:1-7:7 - [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
Reasoning about Probabilistic Security Using Task-PIOAs. ARSPA-WITS 2010: 2-22 - [c14]Alex Fabrikant, Aaron D. Jaggard
On the Structure of Weakly Acyclic Games. SAGT 2010: 126-137 - [c13]Joan Feigenbaum, Aaron D. Jaggard
Approximate privacy: foundations and quantification (extended abstract). EC 2010: 167-178 - [i5]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: PARs for Set Problems. CoRR abs/1001.3388 (2010)
2000 – 2009
- 2009
- [c12]Aaron D. Jaggard
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
Breaking and fixing public-key Kerberos. Inf. Comput. 206(2-4): 402-424 (2008) - [c11]Bruno Blanchet, Aaron D. Jaggard
Computationally sound mechanized proofs for basic and public-key Kerberos. AsiaCCS 2008: 87-99 - [c10]Sharon Goldberg, Shai Halevi, Aaron D. Jaggard
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
Formal analysis of Kerberos 5. Theor. Comput. Sci. 367(1-2): 57-87 (2006) - [c9]Iliano Cervesato
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
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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2006: 219 (2006) - 2005
- [j3]Aaron D. Jaggard:
Subsequence Containment by Involutions. Electron. J. Comb. 12 (2005) - [j2]Aaron D. Jaggard
Toward the design of robust interdomain routing protocols. IEEE Netw. 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
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. Electron. J. Comb. 9(2) (2002) - [c1]Frederick Butler, Iliano Cervesato, Aaron D. Jaggard
A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175-
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-02 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: