PrivaMatch: A Privacy-Preserving DNA Matching Scheme for Forensic Investigation

• URL: http://arxiv.org/abs/2409.14798v1
• Date: Mon, 23 Sep 2024 08:22:31 GMT
• Title: PrivaMatch: A Privacy-Preserving DNA Matching Scheme for Forensic Investigation
• Authors: Sankha Das,
• Abstract summary: It is necessary that sensitive details pertaining to the investigation such as the identities of the suspects and evidence obtained from the crime scene must be kept private to the investigating agency. We present a novel DNA matching scheme, termed as PrivaMatch, which addresses multiple concerns about privacy of the suspects' DNA profiles and the crime scene evidence.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: DNA fingerprinting and matching for identifying suspects has been a common practice in criminal investigation. Such proceedings involve multiple parties such as investigating agencies, suspects and forensic labs. A major challenge in such settings is to carry out the matching process between the suspects' DNA samples and the samples obtained from the crime scene without compromising the privacy of the suspects' DNA profiles. Additionally, it is necessary that sensitive details pertaining to the investigation such as the identities of the suspects and evidence obtained from the crime scene must be kept private to the investigating agency. We present a novel DNA matching scheme, termed as PrivaMatch, which addresses multiple concerns about privacy of the suspects' DNA profiles and the crime scene evidence. In the proposed scheme, the investigating agencies oblivious transfer and zero-knowledge proofs to privately obtain the DNA profiles of the suspects from the forensic lab's database.In addition, we present a clever data obfuscation technique using homomorphic encryption and modular arithmetic for the investigating agency to privately obtain the DNA profile of the crime scene's sample, keeping the profile oblivious from the forensic lab. The DNA profile of the crime scene sample is operated on using a homomorphic cryptosystem such that neither of the parties (e.g., the investigation agency, forensic labs, DNA database owners) learns about the private data of the other parties. The proposed scheme is analysed formally and the practicality of its security strengths is verified using simulations under standard assumptions.

Related papers

• Behind the (Digital Crime) Scenes: An MSC Model [0.0]
  The establishment of digital forensics as a foundational discipline for extracting digital evidence further exacerbates the complex nature of criminal investigations. We delineate the protocols that compose digital forensics within a criminal case, formalise them as message sequence charts (MSCs) and identify their functional requirements.
  arXiv  Detail & Related papers  (2024-03-24T15:29:08Z)
• Privacy-Aware Single-Nucleotide Polymorphisms (SNPs) using Bilinear Group Accumulators in Batch Mode [0.40964539027092917]
  Some of the most sensitive of this type of data relates to the usage of DNA data on individuals. Several recent data breaches related to the leak of DNA information, including from 23andMe and Ancestry. This paper outlines a method of hashing the core information contained within the data stores into a bilinear group accumulator in batch mode.
  arXiv  Detail & Related papers  (2024-01-15T13:59:51Z)
• Diff-Privacy: Diffusion-based Face Privacy Protection [58.1021066224765]
  In this paper, we propose a novel face privacy protection method based on diffusion models, dubbed Diff-Privacy. Specifically, we train our proposed multi-scale image inversion module (MSI) to obtain a set of SDM format conditional embeddings of the original image. Based on the conditional embeddings, we design corresponding embedding scheduling strategies and construct different energy functions during the denoising process to achieve anonymization and visual identity information hiding.
  arXiv  Detail & Related papers  (2023-09-11T09:26:07Z)
• Membership Inference Attacks against Synthetic Data through Overfitting Detection [84.02632160692995]
  We argue for a realistic MIA setting that assumes the attacker has some knowledge of the underlying data distribution. We propose DOMIAS, a density-based MIA model that aims to infer membership by targeting local overfitting of the generative model.
  arXiv  Detail & Related papers  (2023-02-24T11:27:39Z)
• Criminal Investigation Tracker with Suspect Prediction using Machine Learning [0.0]
  This study provides a novel approach for crime prediction based on real-world data, and criminality incorporation. An automated approach to identifying offenders in Sri Lanka would be better than the current system.
  arXiv  Detail & Related papers  (2023-02-21T03:24:17Z)
• How Do Input Attributes Impact the Privacy Loss in Differential Privacy? [55.492422758737575]
  We study the connection between the per-subject norm in DP neural networks and individual privacy loss. We introduce a novel metric termed the Privacy Loss-Input Susceptibility (PLIS) which allows one to apportion the subject's privacy loss to their input attributes.
  arXiv  Detail & Related papers  (2022-11-18T11:39:03Z)
• Criminal Networks Analysis in Missing Data scenarios through Graph Distances [5.164732466825455]
  In this paper we analyse nine real criminal networks of different nature. We quantify the impact of incomplete data and to determine which network type is most affected by it.
  arXiv  Detail & Related papers  (2021-02-28T11:12:05Z)
• Private DNA Sequencing: Hiding Information in Discrete Noise [6.647959476396793]
  We study the problem of hiding a binary random variable $X$ with the additive noise provided by mixing DNA samples. We characterize upper and lower bounds to the solution of this problem, which are empirically shown to be very close.
  arXiv  Detail & Related papers  (2021-01-28T17:13:26Z)
• Subclass Contrastive Loss for Injured Face Recognition [79.14062188261163]
  We address the problem of injured face recognition and propose a novel Subclass Contrastive Loss (SCL) for this task. A novel database, termed as Injured Face (IF) database, is also created to instigate research in this direction.
  arXiv  Detail & Related papers  (2020-08-05T08:30:29Z)
• BeeTrace: A Unified Platform for Secure Contact Tracing that Breaks Data Silos [73.84437456144994]
  Contact tracing is an important method to control the spread of an infectious disease such as COVID-19. Current solutions do not utilize the huge volume of data stored in business databases and individual digital devices. We propose BeeTrace, a unified platform that breaks data silos and deploys state-of-the-art cryptographic protocols to guarantee privacy goals.
  arXiv  Detail & Related papers  (2020-07-05T10:33:45Z)
• Camera Trace Erasing [86.15997461603568]
  We address a new low-level vision problem, camera trace erasing, to reveal the weakness of trace-based forensic methods. We propose Siamese Trace Erasing (SiamTE), in which a novel hybrid loss is designed on the basis of Siamese architecture for network training.
  arXiv  Detail & Related papers  (2020-03-16T00:09:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.