Difference between revisions of "Riazi2016genmatch"
From ACES
(Import from BibTeX) |
m (Import from BibTeX) |
||
Line 3: | Line 3: | ||
|keywords=DNA Matching, Garbled Circuit, Privacy-Preserving Computing, Secure Function Evaluation | |keywords=DNA Matching, Garbled Circuit, Privacy-Preserving Computing, Secure Function Evaluation | ||
|abstract=<p>We introduce GenMatch, a novel set of techniques based on hardware synthesis, for achieving efficient and scalable privacy-preserving genetic testing. Processing and handling sensitive genome data require methodologies to thwart possible attacks and data theft scenarios. The GenMatch secure genome testing method utilizes Yao\’s Garbled Circuit (GC) protocol and creates a formulation of the matching problem in a sequential GC format. Our formulation involves private matching of genome data by the GC protocol. Our method reduces the memory footprint of the secure computation such that it can be done in a resource-constrained devices like embedded platforms, rendering the method scalable and time-efficient. Proofof-concept evaluations are performed on the application of matching Human Leukocyte Antigen (HLA) data for organ and tissue transplant compatibility between recipient and donors. This type of testing also has applications in ancestry testing and genetic matchmaking. HLA data of the recipient is matched with a database of possible donor HLA data while keeping the data from both parties private. Experimental results on real genome data demonstrate the practicability of GenMatch in terms of timing and communication complexity for HLA database in the order of million user profiles.</p> | |abstract=<p>We introduce GenMatch, a novel set of techniques based on hardware synthesis, for achieving efficient and scalable privacy-preserving genetic testing. Processing and handling sensitive genome data require methodologies to thwart possible attacks and data theft scenarios. The GenMatch secure genome testing method utilizes Yao\’s Garbled Circuit (GC) protocol and creates a formulation of the matching problem in a sequential GC format. Our formulation involves private matching of genome data by the GC protocol. Our method reduces the memory footprint of the secure computation such that it can be done in a resource-constrained devices like embedded platforms, rendering the method scalable and time-efficient. Proofof-concept evaluations are performed on the application of matching Human Leukocyte Antigen (HLA) data for organ and tissue transplant compatibility between recipient and donors. This type of testing also has applications in ancestry testing and genetic matchmaking. HLA data of the recipient is matched with a database of possible donor HLA data while keeping the data from both parties private. Experimental results on real genome data demonstrate the practicability of GenMatch in terms of timing and communication complexity for HLA database in the order of million user profiles.</p> | ||
|month=5 | |||
|year=2016 | |||
|booktitle=IEEE International Symposium on Hardware Oriented Security and Trust(HOST) | |booktitle=IEEE International Symposium on Hardware Oriented Security and Trust(HOST) | ||
|title=GenMatch: Secure DNA Compatibility Testing | |title=GenMatch: Secure DNA Compatibility Testing | ||
|entry=inproceedings | |entry=inproceedings | ||
}} | }} |
Revision as of 03:43, 4 September 2021
Riazi2016genmatch | |
---|---|
entry | inproceedings |
address | |
annote | |
author | M. Sadegh Riazi and Neeraj K. R. Dantu and L. N. Vinay Gattu and Farinaz Koushanfar |
booktitle | IEEE International Symposium on Hardware Oriented Security and Trust(HOST) |
chapter | |
edition | |
editor | |
howpublished | |
institution | |
journal | |
month | 5 |
note | |
number | |
organization | |
pages | |
publisher | |
school | |
series | |
title | GenMatch: Secure DNA Compatibility Testing |
type | |
volume | |
year | 2016 |
doi | |
issn | |
isbn | |
url | |