Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Jaggard, Aaron D."'
We introduce a logic for reasoning about contextual trust for web addresses, provide a Kripke semantics for it, and prove its soundness under reasonable assumptions about principals' policies. Self-Authenticating Traditional Addresses (SATAs) are val
Externí odkaz:
http://arxiv.org/abs/2405.01809
Autor:
Jaggard, Aaron D., Syverson, Paul
We introduce and investigate *targeting adversaries* who selectively attack users of Tor or other secure-communication networks. We argue that attacks by such adversaries are more realistic and more significant threats to those most relying on Tor's
Externí odkaz:
http://arxiv.org/abs/1706.10292
Tor users are vulnerable to deanonymization by an adversary that can observe some Tor relays or some parts of the network. We demonstrate that previous network-aware path-selection algorithms that propose to solve this problem are vulnerable to attac
Externí odkaz:
http://arxiv.org/abs/1511.05453
We use ideas from distributed computing and game theory to study dynamic and decentralized environments in which computational nodes, or decision makers, interact strategically and with limited information. In such environments, which arise in many r
Externí odkaz:
http://arxiv.org/abs/1509.02955
Motivated by the effectiveness of correlation attacks against Tor, the censorship arms race, and observations of malicious relays in Tor, we propose that Tor users capture their trust in network elements using probability distributions over the sets
Externí odkaz:
http://arxiv.org/abs/1406.3583
Dynamics in a distributed system are self-stabilizing if they are guaranteed to reach a stable state regardless of how the system is initialized. Game dynamics are uncoupled if each player's behavior is independent of the other players' preferences.
Externí odkaz:
http://arxiv.org/abs/1403.5791
The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. In a weakly acyclic game, from any starting state, there is a sequence of better-response moves that leads to
Externí odkaz:
http://arxiv.org/abs/1108.2092
Autor:
Baxter, Andrew M., Jaggard, Aaron D.
We study questions of even-Wilf-equivalence, the analogue of Wilf-equivalence when attention is restricted to pattern avoidance by permutations in the alternating group. Although some Wilf-equivalence results break when considering even-Wilf-equivale
Externí odkaz:
http://arxiv.org/abs/1106.3653
In previous work (arXiv:0910.5714), we introduced the Privacy Approximation Ratio (PAR) and used it to study the privacy of protocols for second-price Vickrey auctions and Yao's millionaires problem. Here, we study the PARs of multiple protocols for
Externí odkaz:
http://arxiv.org/abs/1001.3388
Increasing use of computers and networks in business, government, recreation, and almost all aspects of daily life has led to a proliferation of online sensitive data about individuals and organizations. Consequently, concern about the privacy of the
Externí odkaz:
http://arxiv.org/abs/0910.5714