Scan Science and Technology
Contact Leading Edge Experts & Companies
Anonymous Network
The Experts below are selected from a list of 13836 Experts worldwide ranked by ideXlab platform
Roger Wattenhofer – One of the best experts on this subject based on the ideXlab platform.

DISC – Randomness vs. Time in Anonymous Networks
Lecture Notes in Computer Science, 2015CoAuthors: Jochen Seidel, Jara Uitto, Roger WattenhoferAbstract:In an Anonymous Network, symmetry breaking tasks can only be solved if randomization is available. But how many random bits are required to solve any such task? As it turns out, the answer to this question depends on the desired runtime of the algorithm.
Since any randomized Anonymous Network algorithm can be decomposed into a randomized 2hop coloring stage and a deterministic stage, we tackle the question by focusing on the randomized stage. We establish that for any reasonable target function f, there is a randomized 2hop coloring scheme running in $$\mathcal {O} fn$$ time. Our coloring scheme allows to trade an increase in runtime by a factor of d for a decrease by the $$d^\text {th}$$ root in the random bit complexity.
To show that the achieved tradeoff is asymptotically optimal for any choice of f, we establish a tradeoff lower bound. Our bounds yield that it is sufficient to consider the cases when f is between $$\Omega \log ^*n$$ and $$\mathcal {O} \log \log n$$. We obtain that for the two extreme cases, i.e., where $$f \in \Theta \log ^*n$$ and $$f \in \Theta \log \log n$$, the random bit complexity is $$\Theta \root d \of {n}$$ and $$\Theta \log n$$, respectively, for any constant d. The tradeoff achieved by our scheme is asymptotically optimal for any f, i.e., reducing the runtime must lead to an increase in the random bit complexity.

Randomness vs. Time in Anonymous Networks
, 2015CoAuthors: Jochen Seidel, Jara Uitto, Roger WattenhoferAbstract:In an Anonymous Network, symmetry breaking tasks can only be solved if randomization is available. But how many random bits are required to solve any such task? As it turns out, the answer to this question depends on the desired runtime of the algorithm. Since any randomized Anonymous Network algorithm can be decomposed into a randomized 2hop coloring stage and a deterministic stage, we tackle the question by focusing on the randomized stage. We establish that for any reasonable target function f, there is a randomized 2hop coloring scheme running in O(f(n)) time. Our coloring scheme allows to trade an increase in runtime by a factor of d for a decrease by the dth root in the random bit complexity. To show that the achieved tradeoff is asymptotically optimal for any choice of f, we establish a tradeoff lower bound. Our bounds yield that it is sufficient to consider the cases when f is between Ω(log∗ n) and O(log log n). We obtain that for the two extreme cases, i.e., where f ∈ Θ(log∗ n) and f ∈ Θ(log log n), the random bit complexity is Θ( d√ n) and Θ(log n), respectively, for any constant d. The tradeoff achieved by our scheme is asymptotically optimal for any f, i.e., reducing the runtime must lead to an increase in the random bit complexity.

Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs
Automata Languages and Programming, 2014CoAuthors: Yuval Emek, Jochen Seidel, Roger WattenhoferAbstract:What can be computed in an Anonymous Network, where nodes are not equipped with unique identifiers? It turns out that the answer to this question depends on the commitment of the nodes to their first computed output value: Two classes of problems solvable in Anonymous Networks are defined, where in the first class nodes are allowed to revoke their outputs and in the second class they are not. These two classes are then related to the class of all centrally solvable Network problems, observing that the three classes form a strict linear hierarchy, and for several classic and/or characteristic problems in distributed computing, we determine the exact class to which they belong.Does this hierarchy exhibit complete problems? We answer this question in the affirmative by introducing the concept of a distributed oracle, thus establishing a more fine grained classification for distributed computability which we apply to the classic/characteristic problems. Among our findings is the observation that the three classes are characterized by the three pillars of distributed computing, namely, local symmetry breaking, coordination, and leader election.
Olivier Festor – One of the best experts on this subject based on the ideXlab platform.

A Bird’s Eye View on the I2P Anonymous Filesharing Environment
, 2012CoAuthors: Juan Pablo Timpanaro, Isabelle Chrisment, Olivier FestorAbstract:Anonymous communications have been gaining more and more interest from Internet users as privacy and anonymity problems have emerged. Among Anonymous enabled services, Anonymous filesharing is one of the most active one and is increasingly growing. Large scale monitoring on these systems allows us to grasp how they behave, which type of data is shared among users, the overall behaviour in the system. But does large scale monitoring jeopardize the system anonymity? In this work we present the first large scale monitoring architecture and experiments on the I2P Network, a lowlatency messageoriented Anonymous Network. We characterize the filesharing environment within I2P, and evaluate if this monitoring affects the anonymity provided by the Network. We show that most activities within the Network are filesharing oriented, along with Anonymous webhosting. We assess the wide geographical location of nodes and Network popularity. We also demonstrate that groupbased profiling is feasible on this particular Network.

NSS – A bird’s eye view on the I2P Anonymous filesharing environment
Network and System Security, 2012CoAuthors: Juan Pablo Timpanaro, Isabelle Chrisment, Olivier FestorAbstract:Anonymous communications have been gaining more and more interest from Internet users as privacy and anonymity problems have emerged. Among Anonymous enabled services, Anonymous filesharing is one of the most active one and is increasingly growing. Large scale monitoring on these systems allows us to grasp how they behave, which type of data is shared among users, the overall behaviour in the system. But does large scale monitoring jeopardize the system anonymity?
In this work we present the first large scale monitoring architecture and experiments on the I2P Network, a lowlatency messageoriented Anonymous Network. We characterize the filesharing environment within I2P, and evaluate if this monitoring affects the anonymity provided by the Network.
We show that most activities within the Network are filesharing oriented, along with Anonymous webhosting. We assess the wide geographical location of nodes and Network popularity. We also demonstrate that groupbased profiling is feasible on this particular Network.

TMA – I2P’s usage characterization
Traffic Monitoring and Analysis, 2012CoAuthors: Juan Pablo Timpanaro, Isabelle Chrisment, Olivier FestorAbstract:We present the first monitoring study aiming to characterize the usage of the I2P Network, a lowlatency Anonymous Network based on garlic routing. We design a distributed monitoring architecture for the I2P Network and show through three oneweek measurement experiments the ability of the system to identify a significant number of all running applications, among web servers and filesharing clients.
Seiichiro Tani – One of the best experts on this subject based on the ideXlab platform.

Compression of View on Anonymous Networks—Folded View—
IEEE Transactions on Parallel and Distributed Systems, 2012CoAuthors: Seiichiro TaniAbstract:View is a labeled directed graph containing all information about the Network that a party can learn by exchanging messages with its neighbors. View can be used to solve distributed problems on an Anonymous Network (i.e., a Network that does not guarantee that every party has a unique identifier). This paper presents an algorithm that constructs views in a compressed form on an Anonymous nparty Network of any topology in at most 2n rounds with O(n6\log n) bit complexity, where the time complexity (i.e., the number of local computation steps per party) is O(n6\log n). This is the first viewconstruction algorithm that runs in O(n) rounds with polynomial bits complexity. The paper also gives an algorithm that counts the number of nonisomorphic views in the Network in O(n6\log n) time complexity if a view is given in the compressed form. These algorithms imply that some wellstudied problems, including the leader election problem, can deterministically be solved in O(n) rounds with polynomial bit and time complexity on an Anonymous nparty Network of any topology.