Publications associées à Onion routing

Proof-of-Personhood: Redemocratizing Permissionless Cryptocurrencies

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly, Maria Fernanda Borge Chavez

Permissionless blockchain-based cryptocurrencies commonly use proof-of-work (PoW) or proof-of-stake (PoS) to ensure their security, e.g. to prevent double spending attacks. However, both approaches have disadvantages: PoW leads to massive amounts of wasted ...

IEEE2017

Observer Placement for Source Localization: the Effect of Budgets and Transmission Variance

Patrick Thiran, Laura Elisa Celis, Brunella Marta Spinelli

When an epidemic spreads in a network, a key question is where was its source, i.e., the node that started the epidemic. If we know the time at which various nodes were infected, we can attempt to use this information in order to identify the source. Howev ...

2016

Seeking Anonymity in an Internet Panopticon

Bryan Alexander Ford

Internet, users often need to assume, by default, that their every statement or action online is monitored and tracked. The Dissent project at Yale University takes a collective approach to online anonymity, based on different algorithmic foundations from ...

2015

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

Christina Fragouli

We consider the Gaussian N-relay diamond network, where a source wants to communicate to destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain using only k out of the N avail ...

Institute of Electrical and Electronics Engineers2014

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

Multi-objective optimization of regenerator placement using Constraint Programming

Sébastien Rumley, Christian Gaumier

In translucent optical networks, connections bypass most intermediate nodes transparently. However, their signal quality is affected by the traveled distance and/or the bypass operations. Hence, they might require optical-electrical-optical conversions at ...

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

Understanding and Tackling the Root Causes of Instability in Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

We investigate, both theoretically and experimentally, the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that imp ...

2011

Elucidating the Instability of Random Access Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

We investigate both theoretically and experimentally the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that impac ...

2009

On Tamper-Resistance from a Theoretical Viewpoint: The Power of Seals

Serge Vaudenay

Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defeat some common privacy protection mechanisms. We propose the theoretical mode ...

Springer2009