OblivP2P: An Oblivious Peer-to-Peer Content Sharing System
summary
OBLIVP2P implements a distributed ORAM to hide P2P access patterns and achieve unlinkability, using a tree-based ORAM mapped onto peers, distributed private information retrieval to fetch path-replicas, and a seed-homomorphic PRG to produce decryptable shares without revealing keys. A trusted tracker holds only position maps and metadata; no central bandwidth bottleneck appears. Simulation on 15 Deterlab nodes with ~16,384 virtual peers reaches roughly 3.6 MB/s (about seven 512 KB requests/sec), with remaining limits being computational, not network.
AI-written summary · about
chapters (16)
- 0:00Intro
- 0:22Traffic Analysis in P2P Systems
- 1:07What can an Adversary do?
- 2:10Problem
- 2:46Contributions
- 3:24Insufficiency of Existing Solutions
- 4:42Main Insight: Oblivious Access Pattern
- 5:17ORAM Background
- 5:52Mapping ORAM to P2P
- 9:00Naive approach: Removing Bottleneck
- 9:46Challenges
- 11:19Construction
- 15:58OblivP2P is an Oblivious P2P Protocol
- 16:38Experimental Setup
- 17:06No Centralized Bottleneck
- 17:25Linear Scalability with Peers
related talks
16mPlanetServe: A Decentralized, Scalable, and Privacy-Preserving Overlay for...
32mGetting started with p2p
21mGhostor: Toward a Secure Data Sharing System from Decentralized Trust
15mTreebeard: A Scalable and Fault Tolerant ORAM Datastore
15mH2O2RAM: A High-Performance Hierarchical Doubly Oblivious RAM
16mOblivious Plug&Charge: A Privacy-Preserving EV Charging Scheme based on ORAM
25mInternet of Peers
23mlibp2p: A Modular, P2P Networking Stack