Security Research Ahead: Replication, Key Exchange, Reputation
Roadmap note — open work items #33, #34, #35, #36, #47, #55, #56, #126, #135
LibreSocial's security story is strong on paper — ECC-based identities (Practical Security, LCN 2009), secured DDS (CTS 2014), object-level access control (LANMAN 2017). The open items below are honest leftovers the researchers themselves flagged — ideal material for seminar and master theses.
- Replication is attackable via overtaking of neighbouring nodes (#33): storage replication trusts the Kademlia neighbourhood; an adversary that fills a neighbourhood can absorb replicas. Studying and mitigating this continues the SkyEye watchdog line (Convex Hull Watchdog 2016).
- Replication does not check validity of stored data (#35): replicas could be tampered with; signed object versions / hash chains would close the hole.
- Direct secure connection establishment via Diffie-Hellman (#34): replace today's key-handling path with proper ephemeral ECDH sessions between peers.
- Bug in calling
javax.crypto.spec(#126): a concrete crypto-API defect to fix first. - Prioritization of critical messages (#47): DoS-resilience of the message dispatcher — a classic P2P hardening topic.
- Decentralized reputation / technical trust score (#55): score storage and relay nodes from SkyEye metrics; connects monitoring research to placement decisions.
- Expiring posts (#56): socially important (right to be forgotten) and technically interesting (TTL semantics across DDS replicas and PAST content).
- Mutual friendship not easily possible (#135): a security-adjacent UX bug in the friend-set handshake — small, visible, satisfying to fix.
Each item carries a decade of context in the archive; each is a chance to publish.