@misc{Janiuk2014Securex,
  author = {Jens Janiuk and Alexander Mäcker (Präsentierender and Heinz Nixdorf Institute and University of Paderborn) and Kalman Graffi},
  title = {Secure Distributed Data Structures for Peer-to-Peer-based Social Networks},
  year = {2014},
  howpublished = {IEEE International Conference on Cyber Technology in Automation, Systems, and Technologies (CTS 2014), P2PCS track},
  abstract = {This paper presents secure distributed data structures (DDS) — lists, sets and trees — operated on a DHT (FreePastry with PAST storage) for peer-to-peer social networks, addressing functionality, fine-grained write/read control, replicability and load balancing without central servers. Lists are split into buckets of configurable splitsize addressed by h(listName + floor(i/splitsize)), so a list of length n needs only n/splitsize lookups and load spreads over many peers; remote operations (get(i), set(i), contains(item) executed at the storage peer) nearly halve traffic, while message counts s},
  note = {2014_Pub__Kalman.Graffi_IEEE.CTS.2014_Secure-Distributed-Data-Structures-for-Peer-to-Peer-based-Social-Networks___Slides.pdf},
}
