Publications related to I2P | EPFL Graph Search

Promoting synergies for sustainability through peer-to-peer sharing: an analysis of drivers and barriers

Claudia Rebeca Binder Signer, Ralph Hansmann

Peer-to-peer (P2P) sharing may foster sustainability synergistically by saving resources, reducing costs and promoting satisfaction of consumer needs and social connectivity. A survey of Swiss and Swedish consumers (N = 1522) was conducted to analyze drive ...

TAYLOR & FRANCIS INC2023

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

Verónica del Carmen Estrada Galiñanes

Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this contribution must be rewarded. Peers across the network may share computation po ...

IEEE COMPUTER SOC2022

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Benjamin Pinot

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

2022

Moby: A Blackout-Resistant Anonymity Network for Mobile Devices

Bryan Alexander Ford, Antoine Rault, Amogh Pradeep, Hira Javaid

Internet blackouts are challenging environments for anonymity and censorship resistance. Existing popular anonymity networks (e.g., Freenet, I2P, Tor) rely on Internet connectivity to function, making them impracticable during such blackouts. In such a set ...

2022

Blockchain-based Practical Multi-agent Secure Comparison and its Application in Auctions

Boi Faltings, Sujit Prakash Gujar, Sankarshan Damle

AI applications find widespread use in a variety of domains. For further acceptance, mostly when multiple agents interact with the system, we must aim to preserve the privacy of participants information in such applications. Towards this, the Yao’s Million ...

ACM2022

Formal Analysis of Distance Bounding with Secure Hardware

Serge Vaudenay, Handan Kilinç Alper

A distance bounding (DB) protocol is a two-party authentication protocol between a prover and a verifier which is based on the distance between the prover and the verifier. It aims to defeat threats by malicious provers who try to convince that they are cl ...

2018

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

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Jean-Pierre Hubaux, Bryan Alexander Ford, Mahdi Zamani, Italo Ivan Dacosta Petrocelli, Ludovic Barman

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

CoShare: A Cost-effective Data Sharing System for Data Center Networks

Karl Aberer, Rameez Rahman, Hao Zhuang, Imen Filali

Numerous research groups and other organizations collect data from popular data sources such as online social networks. This leads to the problem of data islands, wherein all this data is isolated and lying idly, without any use to the community at large. ...

2015

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.

I2P

Promoting synergies for sustainability through peer-to-peer sharing: an analysis of drivers and barriers

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

The Universal Gossip Fighter

Moby: A Blackout-Resistant Anonymity Network for Mobile Devices

Blockchain-based Practical Multi-agent Secure Comparison and its Application in Auctions

Formal Analysis of Distance Bounding with Secure Hardware

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

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Trustworthy Cloud Storage

CoShare: A Cost-effective Data Sharing System for Data Center Networks

Graph Chatbot

Chat with Graph Search

Promoting synergies for sustainability through peer-to-peer sharing: an analysis of drivers and barriers

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Blockchain-based Practical Multi-agent Secure Comparison and its Application in Auctions

Moby: A Blackout-Resistant Anonymity Network for Mobile Devices

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

Formal Analysis of Distance Bounding with Secure Hardware

The Universal Gossip Fighter

Trustworthy Cloud Storage

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

CoShare: A Cost-effective Data Sharing System for Data Center Networks