Tim Grube

name

Tim Grube

position

Research Assistant / Doctoral Researcher

Smart Protection in Infrastructures and Networks (SPIN) (former Secure Smart Infrastructures SSI) Group 

GRK 2050 - Privacy and Trust for Mobile Users

Software Campus Project KomBi

email

grube(at)tk(dot)tu-darmstadt(dot)de

grube(at)cs(dot)tu-darmstadt(dot)de

phone

+49 (6151) 16 - 23205

fax

+49 (6151) 16 - 23202

office

S2-02 A 316

postal address

TU Darmstadt - FB 20

FG Telekooperation
Hochschulstraße 10
D-64289 Darmstadt
Germany

 

Short Biography

Tim is a doctoral researcher in the Smart Protection in Infrastructures and Networks (SPIN) group at the Technische Universität Darmstadt. In 2015, he also joined the graduate college Privacy and Trust for Mobile Users (PAT). He works on a PhD thesis in the area of efficient and anonymous communication, besides that he is interested in graph theory, visualization of dynamic systems and P2P systems. In addition to his work in the graduate college, Tim is leading the Software Campus project Complexity Reduction in Big Data (KomBi), researching in the field of graph-based data visualization. 

Tim received his master degree in Computer Science with a focus on distributed systems from the Technische Universität Darmstadt in 2014. His thesis dealt with complexity reduction in large networks by using sampling techniques. 

Research Interests

  • Distributed Communication

    • Privacy
    • Efficiency
    • Topologies for privacy preserving and efficient communication

  • Dynamic Systems

    • Graphs
    • Graph Theory
    • P2P Systems
    • Visualisation of Dynamic Systems

Theses & Teaching

Supervised Theses (ongoing and finished)

  • Advanced Ants to establish Anonymous Communication Overlays
  • Measuring a User's Privacy
  • Source Protection in P2P-based Pub/Sub-Networks
  • What is the Influence of Topologies on Achievable Privacy?
  • Reducing Data Complexity while Maintaining its Meaning
  • Survey and Comparison: Complexity Reduction in Graphs to support the Visualization of Big Data
  • Framework for Visualization of Massive Data
  • Visualization of Large Dynamic Networks
  • Analysis of a Street Network with Dynamic Graphs
  • Connecting multiple uMundo Workspaces
  • Evaluation of Codecs for HD Video Streaming in Wireless Home Networks

Please contact me if you are interested in writing a Bachelor or Master thesis. Please provide a short topic proposal and express your motivation for this topic in a few sentences. I am regularly supervising theses. 

 Teaching

Winter Term 2017/18

  • TK1 - Exercise
  • Ubiquitous Computing in Geschäftsprozessen

Winter Term 2016/17

  • TK1 - Exercise 
  • TK Seminar

    • Differential Privacy in Practice
    • A Survey of Trends in Privacy Measurements

Summer Term 2015

  • TK Seminar

    • Complexity Reduction in Graphs
    • Understanding Freenet
    • Using Monotonicity to Predict Sampling Steps

Winter Term 2014/15

  • TK Seminar

    • Attacks on Anonymous Communication
    • Measures of Anonymity in Communication Networks
    • Multi-Layer Resilience in Computer Networks

Publications

Ant Colony Optimisation - A Solution to Efficient Anonymous Group Communication?

Author Tim Grube, Sascha Hauke, Jörg Daubert, Max Mühlhäuser
Date January 2017
Kind Inproceedings
PublisherIEEE
Book title(to appear) Proceedings of the 14th Annual IEEE Consumer Communications & Networking Conference (CCNC)
Pages1-4
LocationLas Vegas (USA)
KeyTUD-CS-2017-0012
Research Areas privacy trust, Telecooperation, CYSEC, CRISP, Fachbereich Informatik, - SSI - Area Secure Smart Infrastructures, - SST - Area Smart Security and Trust
Abstract Online Social Networks (OSNs) are the core of most communications nowadays, leading to possibly sensitive information exchange. Privacy is an important building block of free societies, and thus, for OSNs. OSNs function as group communication systems and can be build in centralised and distributed styles. Privacy can be achieved in distributed systems as all participants contribute to privacy. Peer-to-peer-based group communication systems achieve this privacy improvement par- tially, at the cost of additional messaging overhead. In this paper, we introduce ant colony optimisation to reduce the messaging overhead of anonymous communication systems, bridging the gap between privacy and efficiency. We apply our adapted privacy sensitive ant colony optimization to improve routing paths by encouraging re-usage and aggregation. Our first results indicate a 9–13% lower messaging overhead compared to the state of the art, while maintaining privacy.
[Export this entry to BibTeX]

Important Copyright Notice:

The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
A A A | Drucken Print | Impressum Impressum | Sitemap Sitemap | Suche Search | Kontakt Contact | Webseitenanalyse: Mehr Informationen
zum Seitenanfangzum Seitenanfang