Aaron D. Jaggard

Paul Syverson

Proc. Priv. Enhancing Technol., October, 2023

2020

Accountability in Computing: Concepts and Mechanisms.

[BibT_eX]

[DOI]

Found. Trends Priv. Secur., 2020

NExtSteP: An Extensible Testbed for Network Covert Channels.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE Conference on Communications and Network Security, 2020

2017

Dynamics at the Boundary of Game Theory and Distributed Computing.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2017

Onions in the Crosshairs: When The Man really is out to get you.

[BibT_eX]

[DOI]

Paul Syverson

CoRR, 2017

Onions in the Crosshairs: When The Man really <i>is</i> out to get you.

[BibT_eX]

[DOI]

Paul Syverson

Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, Dallas, TX, USA, October 30, 2017

Avoiding The Man on the Wire: Improving Tor's Security with Trust-Aware Path Selection.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

2015

20, 000 In League Under the Sea: Anonymous Communication, Trust, MLATs, and Undersea Cables.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2015

2014

Approximate Privacy: Foundations and Quantification.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Representing Network Trust and Using It to Improve Anonymous Communication.

[BibT_eX]

[DOI]

CoRR, 2014

Strange Bedfellows: How and When to Work with Your Enemy.

[BibT_eX]

[DOI]

Proceedings of the Security Protocols XXII, 2014

Self-stabilizing Uncoupled Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Open vs. closed systems for accountability.

[BibT_eX]

[DOI]

Proceedings of the 2014 Symposium and Bootcamp on the Science of Security, 2014

2013

On the Structure of Weakly Acyclic Games.

[BibT_eX]

[DOI]

Alex Fabrikant

Theory Comput. Syst., 2013

The design space of probing algorithms for network-performance measurement.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

2011

Cryptographically sound security proofs for basic and public-key Kerberos.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2011

Pattern Avoidance by Even Permutations.

[BibT_eX]

[DOI]

Andrew Baxter

Electron. J. Comb., 2011

Accountability and deterrence in online life.

[BibT_eX]

[DOI]

Proceedings of the Web Science 2011, 2011

Distributed computing with rules of thumb.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Towards a formal model of accountability.

[BibT_eX]

[DOI]

Proceedings of the 2011 New Security Paradigms Workshop, 2011

Distributed Computing with Adaptive Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

2010

Approximate Privacy: PARs for Set Problems

[BibT_eX]

[DOI]

CoRR, 2010

Approximate privacy: foundations and quantification (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Reasoning about Probabilistic Security Using Task-PIOAs.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, 2010

2009

Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond

[BibT_eX]

[DOI]

CoRR, 2009

The Impact of Communication Models on Routing-Algorithm Convergence.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

2008

Rationality and traffic attraction: incentives for honest path announcements in bgp.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2008 Conference on Applications, 2008

Computationally sound mechanized proofs for basic and public-key Kerberos.

[BibT_eX]

[DOI]

Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, 2008

2007

An almost-bijective proof of an asymptotic property of partitions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

2006

Formal analysis of Kerberos 5.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Breaking and Fixing Public-Key Kerberos.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Robust Path-Vector Routing Despite Inconsistent Route Preferences.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE International Conference on Network Protocols, 2006

2005

Toward the design of robust interdomain routing protocols.

[BibT_eX]

[DOI]

IEEE Netw., 2005

Subsequence Containment by Involutions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

Specifying Kerberos 5 cross-realm authentication.

[BibT_eX]

[DOI]

Proceedings of the POPL 2005 Workshop on Issues in the Theory of Security, 2005

Relating two formal models of path-vector routing.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004

Robustness of Class-Based Path-Vector Systems.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004), 2004

2003

Design principles of policy languages for path vector protocols.

[BibT_eX]

[DOI]

Timothy Griffin

Proceedings of the ACM SIGCOMM 2003 Conference on Applications, 2003

Verifying Confidentiality and Authentication in Kerberos 5.

[BibT_eX]

[DOI]

Proceedings of the Software Security, 2003

2002

Prefix Exchanging and Pattern Avoidance by Involutions.

[BibT_eX]

[DOI]