CRChristian Rathgeb

Christian Rathgeb

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Christian Rathgeb has a total of 2 co-authors. Here are the top co-authors by number of shared publications:

  • Frank Breitinger

    Hsch Darmstadt, Da Sec Biometr & Internet Secur Res Grp, D-64295 Darmstadt, Germany

    1 shared publication
  • Harald Baier

    Biometrics and Internet Security Research Group Christian Rathgeb Biometrics and Internet Security Research Group Harald Baier Biometrics and Internet Security Research Group da/sec -Biometrics and Internet Security Research Group Hochschule Darmstadt Darmstadt Germany

    1 shared publication

Latest Publications

  • Open Access

    An Efficient Similarity Digests Database Lookup – A Logarithmic Divide & Conquer Approach

    by Frank Breitinger, Christian Rathgeb, Harald Baier

    Investigating seized devices within digital forensics represents a challenging task due to the increasing amount of data. Common procedures utilize automated file identification, which reduces the amount of data an investigator has to examine manually. In the past years the research field of approximate matching arises to detect similar data. However, if n denotes the number of similarity digests in a database, then the lookup for a single similarity digest is of complexity of O(n). This paper presents a concept to extend existing approximate matching algorithms, which reduces the lookup complexity from O(n) to O(log(n)). Our proposed approach is based on the well-known divide and conquer paradigm and builds a Bloom filter-based tree data structure in order to enable an efficient lookup of similarity digests. Further, it is demonstrated that the presented technique is highly scalable operating a trade-off between storage requirements and computational efficiency. We perform a theoretical assessment based on recently published results and reasonable magnitudes of input data, and show that the complexity reduction achieved by the proposed technique yields a 2 20-fold acceleration of look-up costs.