Representing Network Trust and Using It to Improve Anonymous Communication

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 of elements observed by network adversaries. We present a modular system that allows users to efficiently and conveniently create such distributions and use them to improve their security. The major components of this system are (i) an ontology of network-element types that represents the main threats to and vulnerabilities of anonymous communication over Tor, (ii) a formal language that allows users to naturally express trust beliefs about network elements, and (iii) a conversion procedure that takes the ontology, public information about the network, and user beliefs written in the trust language and produce a Bayesian Belief Network that represents the probability distribution in a way that is concise and easily sampleable. We also present preliminary experimental results that show the distribution produced by our system can improve security when employed by users; further improvement is seen when the system is employed by both users and services.Comment: 24 pages; talk to be presented at HotPETs 201

Distributed Computing with Adaptive Heuristics

We use ideas from distributed computing to study dynamic environments in which computational nodes, or decision makers, follow adaptive heuristics (Hart 2005), i.e., simple and unsophisticated rules of behavior, e.g., repeatedly "best replying" to others' actions, and minimizing "regret", that have been extensively studied in game theory and economics. We explore when convergence of such simple dynamics to an equilibrium is guaranteed in asynchronous computational environments, where nodes can act at any time. Our research agenda, distributed computing with adaptive heuristics, lies on the borderline of computer science (including distributed computing and learning) and game theory (including game dynamics and adaptive heuristics). We exhibit a general non-termination result for a broad class of heuristics with bounded recall---that is, simple rules of behavior that depend only on recent history of interaction between nodes. We consider implications of our result across a wide variety of interesting and timely applications: game theory, circuit design, social networks, routing and congestion control. We also study the computational and communication complexity of asynchronous dynamics and present some basic observations regarding the effects of asynchrony on no-regret dynamics. We believe that our work opens a new avenue for research in both distributed computing and game theory.Comment: 36 pages, four figures. Expands both technical results and discussion of v1. Revised version will appear in the proceedings of Innovations in Computer Science 201

Lacunar fractal photon sieves

We present a new family of diffractive lenses whose structure is based on the combination of two concepts: photon sieve and fractal zone plates with variable lacunarity. The focusing properties of different members of this family are examined. It is shown that the sieves provide a smoothing effect on the higher order foci of a conventional lacunar fractal zone plate. However, the characteristic self-similar axial response of the fractal zone plates is always preserved.Comment: 7 pages, 5 figure

Lacunarity of Fractal Superlattices: a Remote Estimation using Wavelets

The lacunarity provides a useful parameter for describing the distribution of gap sizes in discrete self-similar (fractal) superlattices and is used in addition to the similarity dimension to describe fractals. We show here that lacunarity, as well as the similarity dimension, can be remotely estimated from the wavelet analysis of superlattices impulse response. As a matter of fact, the skeleton—the set of wavelet-transform modulus-maxima—of the reflected signal overlaps two hierarchical structures in the time-scale domain: such that one allows the direct remote extraction of the similarity dimension, while the other may provide an accurate estimation of the lacunarity of the interrogated superlattice. Criteria for the choice of the mother wavelet are established for impulse response corrupted by additive Gaussian white noise