Weak Hashing

Weak Hashing is a content-addressable storage technique that employs a hash function with reduced collision resistance and sensitivity to detect approximate similarities among data objects, distinguishing it from strong hashing methods by prioritizing efficiency and locality preservation over cryptographic security and exact matching.

23

Publications

629

Citations

60

Authors

28

Institutions

Publications per year

2017–2026

6

Authors

60

  1. TV
    Tran van Trung

    University of Duisburg-Essen, Germany

    2 publications · 41 citations

    2

    h-index

  2. SU
    Samee U. Khan

    North Dakota State University, United States

    1 publications · 10 citations

    1

    h-index

  3. SM
    Sosina Martirosyan

    University of Duisburg-Essen, Germany

    1 publications · 23 citations

    1

    h-index

  4. EA
    Elena Andreeva

    KU Leuven, Belgium

    1 publications · 25 citations

    1

    h-index

  5. BZ
    Bochuan Zheng

    China West Normal University, China

    1 publications · 35 citations

    1

    h-index

1–5 of 60

Venues

  1. Designs Codes and Cryptography

    5 publications · 95 citations

    5

    h-index

  2. IEEE Transactions on Image Processing

    1 publications · 35 citations

    1

    h-index

  3. IEICE Transactions on Information and Systems

    1 publications · 21 citations

    1

    h-index

  4. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 11 citations

    1

    h-index

  5. Infoscience (Ecole Polytechnique Fédérale de Lausanne)

    Repository · 1 publications · 12 citations

    1

    h-index

1–5