Concept

Anonymous P2P

Related publications (160)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Proactively Accountable Anonymous Messaging in Verdict

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Among anonymity systems, DC-nets have long held attraction for their resistance to traffic analysis attacks, but practical implementations remain vulnerable to internal disruption or “jamming” attacks, which require time-consuming detection procedures to r ...

2013

Dissent in Numbers: Making Strong Anonymity Scale

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Current anonymous communication systems make a trade-off between weak anonymity among many nodes, via onion routing, and strong anonymity among few nodes, via DC-nets. We develop novel techniques in Dissent, a practical group anonymity system, to increase ...

2012

Distributed throughput optimization over P2P mesh networks using diffusion adaptation

Ali H. Sayed

This work develops a decentralized adaptive strategy for throughput maximization over peer-to-peer (P2P) networks. The adaptive strategy can cope with changing network topologies, is robust to network disruptions, and does not rely on central processors. T ...

IEEE2012

A Self-organized Mechanism of Resource Allocation in P2P Systems

Since the performance of a system of interacting peers depends strongly on their individual contributions, the ratio between their provided and consumed resources should be set in line with the social welfare improvement, without relying on a central coord ...

Atlantis Press2012

Naming Anonymous JavaScript Functions

Claude Petitpierre, Salman Mirghasemi

JavaScript developers create programs by calling functions and they use functions to construct objects. JavaScript development tools need to report to developers about those functions and constructors, for example in debugger call-stacks and in object repr ...

2011

Naming Anonymous JavaScript Functions

Claude Petitpierre, Salman Mirghasemi

2011

Scalable Video Dissemination with Prioritized Network Coding

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

In this paper, we present a pull-based dissemination protocol for efficient distribution of scalable video content in overlay peer-to-peer networks with mesh structures. The proposed protocol employs prioritized network coding, where the network coded pack ...

2011

On the Privacy of Anonymized Networks

Matthias Grossglauser, Pedram Pedarsani

The proliferation of online social networks, and the concomitant accumulation of user data, give rise to hotly debated issues of privacy, security, and control. One specific challenge is the sharing or public release of anonymized data without accidentally ...

2011

Signaling and Reciprocity

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

An ant-based rate allocation algorithm for media streaming in peer to peer networks: extension to multiple sessions and dynamic networks

Amir Hesam Salavati

In this paper, we introduce a novel algorithm for rate allocation in media stream- ing P2P networks where multimedia contents are distributed among network members and streamed toward any requesting peer. The proposed algorithm is based on ant-colony optim ...

2011