On the public citation graph
Security Aspects of Piecewise Hashing in Computer Forensics
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4419-5803-7openalex-snapshot
Open Source Software for Digital Forensics
inferredcites →https://doi.org/10.1016/j.diin.2006.06.015openalex-snapshot
Identifying almost identical files using context triggered piecewise hashing
inferredcites →https://doi.org/10.1109/wkdd.2008.80openalex-snapshot
An Efficient Piecewise Hashing Method for Computer Forensics
inferredcites →https://doi.org/10.5281/zenodo.1417972openalex-snapshot
A Highly Robust Audio Fingerprinting System.
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
inferredcites →https://doi.org/10.6028/nist.sp.800-22r1aopenalex-snapshot
A statistical test suite for random and pseudorandom number generators for cryptographic applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-88381-2_5openalex-snapshot
EVALUATION OF NETWORK TRAFFIC ANALYSIS USING APPROXIMATE MATCHING ALGORITHMS
inferred← citeshttps://doi.org/10.1007/978-3-031-82362-6_10openalex-snapshot
On the Robustness of Malware Detectors to Adversarial Samples
inferred← citeshttps://doi.org/10.1007/978-3-031-95310-1_179openalex-snapshot
The Effective of Identify the Predominant Cyber Threats Detect of the Social Media Networks Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-14289-0_6openalex-snapshot
Taxonomy of Data Fragment Classification Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-25512-5_4openalex-snapshot
How Cuckoo Filter Can Improve Existing Approximate Matching Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-35515-8_12openalex-snapshot
Performance Issues About Context-Triggered Piecewise Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-39891-9_11openalex-snapshot
Similarity Preserving Hashing: Eligible Properties and a New Algorithm MRSH-v2
inferred← citeshttps://doi.org/10.1007/978-3-642-41148-9_7openalex-snapshot
Reducing the Time Required for Hashing Operations
inferred← citeshttps://doi.org/10.1007/978-3-662-44952-3_10openalex-snapshot
Similarity Hashing Based on Levenshtein Distances
inferred← citeshttps://doi.org/10.1007/978-3-662-44952-3_11openalex-snapshot
Using Approximate Matching to Reduce the Volume of Digital Data
inferred← citeshttps://doi.org/10.1016/j.cose.2020.102119openalex-snapshot
Pre-processing memory dumps to improve similarity score of Windows modules
inferred← citeshttps://doi.org/10.1016/j.diin.2013.06.006openalex-snapshot
FRASH: A framework to test algorithms of similarity hashing
inferred← citeshttps://doi.org/10.1016/j.diin.2013.08.003openalex-snapshot
F2S2: Fast forensic similarity search through indexing piecewise hash signatures
inferred← citeshttps://doi.org/10.1016/j.diin.2014.03.002openalex-snapshot
Automated evaluation of approximate matching algorithms on real data
inferred← citeshttps://doi.org/10.1016/j.diin.2014.05.002openalex-snapshot
Evaluating detection error trade-offs for bytewise approximate matching algorithms
inferred← citeshttps://doi.org/10.1016/j.diin.2017.12.004openalex-snapshot
Lempel-Ziv Jaccard Distance, an effective alternative to ssdeep and sdhash
inferred← citeshttps://doi.org/10.1016/j.diin.2019.01.018openalex-snapshot
Improving file-level fuzzy hashes for malware variant classification
inferred← citeshttps://doi.org/10.1016/j.diin.2019.04.006openalex-snapshot
FbHash: A New Similarity Hashing Scheme for Digital Forensics
inferred← citeshttps://doi.org/10.1016/j.fsidi.2021.301120openalex-snapshot
Bringing order to approximate matching: Classification and attacks on similarity digest algorithms
inferred← citeshttps://doi.org/10.1016/j.fsidi.2021.301220openalex-snapshot
Understanding uses and misuses of similarity hashing functions for malware detection and family clustering in actual scenarios
inferred← citeshttps://doi.org/10.1109/euc53437.2021.00028openalex-snapshot
Designing the Elements of a Fuzzy Hashing Scheme
inferred← citeshttps://doi.org/10.1109/iadcc.2014.6779437openalex-snapshot
An efficient parallel algorithm for hash computation in security and forensics applications
inferred← citeshttps://doi.org/10.1109/icosp.2014.7015299openalex-snapshot
Biometric authentication constructed from quantum entropy distribution fuzzy hash
inferred← citeshttps://doi.org/10.1109/imf.2013.18openalex-snapshot
mvHash-B - A New Approach for Similarity Preserving Hashing
inferred← citeshttps://doi.org/10.1109/issa.2012.6320445openalex-snapshot
Properties of a similarity preserving hash function and their realization in sdhash
inferred← citeshttps://doi.org/10.1109/ntms.2018.8328746openalex-snapshot
A Fragment Hashing Approach for Scalable and Cloud-Aware Network File Detection
inferred← citeshttps://doi.org/10.1109/tifs.2025.3599662openalex-snapshot
Targeted Attacks Against the TLSH Similarity Digest Scheme
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0274openalex-snapshot
Forensic Malware Analysis: The Value of Fuzzy Hashing Algorithms in Identifying Similarities
inferred← citeshttps://doi.org/10.1109/worldcis.2013.6751028openalex-snapshot
Optimizing search for malware by hashing smaller amounts of data
inferred← citeshttps://doi.org/10.15394/jdfsl.2016.1376openalex-snapshot
Security Analysis of MVhash-B Similarity Hashing
inferred← citeshttps://doi.org/10.20868/upm.thesis.39099openalex-snapshot
Biometric authentication of users through iris by using key binding and similarity preserving hash functions = Autenticación biométrica de usuarios a través del iris mediante la ocultación de claves y funciones resumen que preservan la similitud
inferred← citeshttps://doi.org/10.23919/saiee.2016.8531543openalex-snapshot
Detecting Derivative Malware Samples Using Deobfuscation-Assisted Similarity Analysis
inferred← citeshttps://doi.org/10.3390/math8040503openalex-snapshot
An Improved Bytewise Approximate Matching Algorithm Suitable for Files of Dissimilar Sizes
inferred← citeshttps://doi.org/10.4018/ijdcf.2014010103openalex-snapshot
Attack Graph Analysis for Network Anti-Forensics
inferred← citeshttps://doi.org/10.4225/75/57b3f6edfb88aopenalex-snapshot
Improving the detection and validation of inland revenue numbers
inferred← citeshttps://doi.org/10.47749/t/unicamp.2020.1129455openalex-snapshot
A study on approximate matching for similarity search
inferred← citeshttps://doi.org/10.48550/arxiv.1812.07071openalex-snapshot
Fuzzy Hashing as Perturbation-Consistent Adversarial Kernel Embedding
inferred← citeshttps://doi.org/10.6028/nist.sp.800-168openalex-snapshot
Approximate matching : definition and terminology
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.