40 research outputs found

    Paying the Guard: An Entry-Guard-Based Payment System for Tor

    Get PDF
    When choosing the three relays that compose a circuit, Tor selects the first hop among a restricted number of relays called entry guards, pre-selected by the user himself. The reduced number of entry guards, that until recently was fixed to three, helps in mitigating the effects of several traffic analysis attacks. However, recent literature indicates that the number should be further reduced, and the time during which the user keeps the relays as guards increased. Therefore, developers of Tor recently proposed selecting only one entry guard, which is to be used by the user for all circuits and for a prolonged period of time (nine months). While this design choice was made to increase the security of the protocol, it also opens an unprecedented opportunity for a market mechanism where relays get paid for traffic by the users. In this paper, we propose to use the entry guard as the point-of-sale: users subscribe to their entry guard of choice, and deposit an amount that will be used for paying for the circuits. From the entry guard, income is then distributed to the other relays included in circuits through an inter-relay accounting system. While the user may pay the entry guard using BitCoins, or any other anonymous payment system, the relays exchange I Owe You (IOU) certificates during communication, and settle their balances only at synchronized, later points in time. This novel deferred payment approach overcomes the weaknesses of the previously proposed Tor payment mechanisms: we separate the user’s payment from the inter-relay payments, and we effectively unlink both from the chosen path, thus preserving the secrecy of the circuit

    Coverage preserving redundancy elimination in sensor networks

    No full text

    Scalable routing in hybrid cellular and ad-hoc networks

    No full text

    CoreLime: A Coordination Model for Mobile Agents

    Get PDF
    AbstractLime is a middleware communication infrastructure for mobile computation that addresses both physical mobility of devices as well as logical mobility of software components by providing a rich set of primitives for local and remote operations. The original Lime specification is surprisingly complex and tricky to implement. In this paper, we start by deconstructing the Lime model to identify its core components. In a second step we attempt to reconstruct a simpler model, which we call CoreLime, that scales better to large and rapidly changing configurations of agents and hosts

    A public key algorithm for ad-hoc networks

    No full text

    Distributed and dynamic voronoi overlays for coverage detection and distributed hash tables in ad-hoc networks

    No full text

    A public key algorithm for ad-hoc networks

    No full text

    High Throughput Routing in Hybrid Cellular and Ad-Hoc Networks

    No full text

    A Coordination Model for ad hoc Mobile Systems

    No full text
    corecore