Tim Grube


Tim Grube


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





+49 (6151) 16 - 23205


+49 (6151) 16 - 23202


S2-02 A 316

postal address

TU Darmstadt - FB 20

FG Telekooperation
Hochschulstraße 10
D-64289 Darmstadt


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. 


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


Cover Traffic: A Trade of Anonymity and Efficiency

Author Tim Grube, Markus Thummerer, Jörg Daubert, Max Mühlhäuser
Date September 2017
Kind Inproceedings
Book titleto appear in: 13th International Workshop on Security and Trust Management in conjunction with the 22th European Symposium On Research in Computer Security (ESORICS 2017)
Research Areas Fachbereich Informatik, CYSEC, privacy trust, Telecooperation, SPIN: Smart Protection in Infrastructures and Networks, - SST - Area Smart Security and Trust, - SSI - Area Secure Smart Infrastructures
Abstract Communication is ubiquitous in societies, more and more devices participate in communication processes, as in for example the Internet of Things.&nbsp;<br />Due to the proximity to their users and the omnipresence of the communication itself, communication is sensitive w.r.t. to anonymity as even the process of communication can disclose information about the content of a communication. Anonymity gains more and more importance in the development of communication services.&nbsp;<br />Thus, anonymity in communication systems is a desired property in many scenarios, allowing to communicate without someone having the ability to attribute the communication to its senders and recipients.&nbsp;<br />However, sender anonymity, i.e., communication without having an identifiable source of information, is a hard goal and the only viable option to achieve it is cover traffic. Cover traffic blends communication in random noise. However, the generation of this noise degrades the efficiency of the system, in a worst case producing two times the number of connections messages to send just a single message.&nbsp;<br />Cover traffic as a technique is hardly understood and analyzed. For that, we derived a model of cover traffic with four parameters to vary the generation of noise in location, spread and time to achieve a better understanding of cover traffic. We analyze the impact of varying parameters on anonymity by computing the remaining cover and on efficiency by computing the noise to content ratio. Our results indicate that cover traffic can be generated in a more efficient way while anonymity is preserved on a reasonable level, yet, the parametrization randomizes the participation allowing to diminish anonymity in the long run.
[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