Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation

Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation Abstract Computation based on genomic data is becoming increasingly popular today, be it for medical or other purposes. Non-medical uses of genomic data in a computation often take place in a server-mediated setting where the server offers the ability for joint genomic testing between the users. Undeniably, genomic data is highly sensitive, which in contrast to other biometry types, discloses a plethora of information not only about the data owner, but also about his or her relatives. Thus, there is an urgent need to protect genomic data. This is particularly true when the data is used in computation for what we call recreational non-health-related purposes. Towards this goal, in this work we put forward a framework for server-aided secure two-party computation with the security model motivated by genomic applications. One particular security setting that we treat in this work provides stronger security guarantees with respect to malicious users than the traditional malicious model. In particular, we incorporate certified inputs into secure computation based on garbled circuit evaluation to guarantee that a malicious user is unable to modify her inputs in order to learn unauthorized information about the other user’s data. Our solutions are general in the sense that they can be used to securely evaluate arbitrary functions and offer attractive performance compared to the state of the art. We apply the general constructions to three specific types of genomic tests: paternity, genetic compatibility, and ancestry testing and implement the constructions. The results show that all such private tests can be executed within a matter of seconds or less despite the large size of one’s genomic data. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings on Privacy Enhancing Technologies de Gruyter

Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation

Download PDF
21 pages

Loading next page...
 
/lp/de-gruyter/efficient-server-aided-secure-two-party-function-evaluation-with-r9cEyFrLbG
Publisher
de Gruyter
Copyright
Copyright © 2016 by the
ISSN
2299-0984
eISSN
2299-0984
DOI
10.1515/popets-2016-0033
Publisher site
See Article on Publisher Site

Abstract

Abstract Computation based on genomic data is becoming increasingly popular today, be it for medical or other purposes. Non-medical uses of genomic data in a computation often take place in a server-mediated setting where the server offers the ability for joint genomic testing between the users. Undeniably, genomic data is highly sensitive, which in contrast to other biometry types, discloses a plethora of information not only about the data owner, but also about his or her relatives. Thus, there is an urgent need to protect genomic data. This is particularly true when the data is used in computation for what we call recreational non-health-related purposes. Towards this goal, in this work we put forward a framework for server-aided secure two-party computation with the security model motivated by genomic applications. One particular security setting that we treat in this work provides stronger security guarantees with respect to malicious users than the traditional malicious model. In particular, we incorporate certified inputs into secure computation based on garbled circuit evaluation to guarantee that a malicious user is unable to modify her inputs in order to learn unauthorized information about the other user’s data. Our solutions are general in the sense that they can be used to securely evaluate arbitrary functions and offer attractive performance compared to the state of the art. We apply the general constructions to three specific types of genomic tests: paternity, genetic compatibility, and ancestry testing and implement the constructions. The results show that all such private tests can be executed within a matter of seconds or less despite the large size of one’s genomic data.

Journal

Proceedings on Privacy Enhancing Technologies – de Gruyter

Published: Oct 1, 2016

References

  • Efficient group signature schemes for large groups In
    Camenisch
  • Cherniavsky Secure computation with minimal interaction revisited In CRYPTO pages
    Ishai
  • framework for outsourcing of secure computation In ACM Workshop on pages
    Jakobsen
  • Efficient privacy preserving k - means clustering in a three - party setting In pages
    Beye
  • Public verifiability in the covert model almost for free In
    Kolesnikov
  • Identifying genetic relatives without compromising privacy
    He
  • signature scheme with efficient protocols In pages
    Camenisch
  • Extending oblivious transfers efficiently In pages
    Ishai
  • Outsourcing secure two - party computation as a black box In CANS pages
    Carter
  • Outsourcing multiparty computation Cryptology ePrint Archive Report
    Kamara
  • Quid pro quo tocols Strengthening semi - honest protocols with dual execution In of Privacy
    Huang
  • Improved garbled circuit Free gates applications In pages
    Kolesnikov
  • Private intersection of certified sets In FC pages
    Camenisch
  • De Are privacy - preserving genomic tests ready for prime time In pages
    Cristofaro
  • Secure two - party computation via cut - and - choose oblivious transfer of
    Lindell
  • Proof systems for general statements about discrete logarithms Technical report Institute for ETH
    Camenisch
  • Signature schemes and anonymous credentials from bilinear maps In pages
    Camenisch
  • Practical private set intersection protocols with linear complexity In and FC pages
    De Cristofaro
  • Fast cut - and - choose based protocols for malicious and covert adversaries In
    Lindell
  • a shelat Two - output secure computation with malicious adversaries In
    Shen
  • Oblivious and fair serveraided two - party computation Technical Report
    Herzberg
  • Oblivious and fair serveraided two - party computation Technical Report
    Herzberg
  • Outsourcing secure two - party computation as a black box In CANS pages
    Carter
  • The library http cseweb ucsd edu groups justgarble
    JustGarble
  • Two halves make a whole : Reducing data transfer in garbled circuits using half gates In pages
    Zahur
  • Fast and secure three - party computation : The garbled circuit approach In pages
    Mohassel
  • Goldwasser Rothblum One time programs In pages
    Kalai
  • Whitewash Outsourcing garbled circuit generation for mobile devices In pages
    Carter
  • Proof systems for general statements about discrete logarithms Technical report Institute for ETH
    Camenisch
  • De Secure genomic testing with size - and position - hiding private substring matching In pages
    Cristofaro
  • Whitewash Outsourcing garbled circuit generation for mobile devices In pages
    Carter
  • More efficient oblivious transfer and extensions for faster secure computation In
    Asharov
  • Cherniavsky Secure computation with minimal interaction revisited In CRYPTO pages
    Ishai
  • Fast and secure three - party computation : The garbled circuit approach In pages
    Mohassel
  • Signature schemes and anonymous credentials from bilinear maps In pages
    Camenisch
  • Fast cut - and - choose based protocols for malicious and covert adversaries In
    Lindell
  • Secure two - party computation via cut - and - choose oblivious transfer of
    Lindell
  • Efficient privacy preserving k - means clustering in a three - party setting In pages
    Beye
  • Secure text processing with applications to private DNA matching In pages
    Katz
  • Privacy - enhancing technology for medical tests using genomic data Technical Report EPFL - REPORT
    Ayday
  • Two halves make a whole : Reducing data transfer in garbled circuits using half gates In pages
    Zahur
  • Genealogy Trees Records at Ancestry com http www ancestry com
  • Efficient two - party secure computation on committed inputs In EUROCRYPT pages
    Jarecki
  • Genealogy Trees Records at Ancestry com http www ancestry com
  • Privacy preserving protocol for detecting genetic relatives using rare variants In pages
    Hormozdiari
  • Efficient committed oblivious transfer of bit strings In Information Conference pages
    Kiraz
  • signature scheme with efficient protocols In pages
    Camenisch
  • The library http cseweb ucsd edu groups justgarble
    JustGarble
  • Separability and efficiency for generic group signature schemes In
    Camenisch
  • GenePartner com DNA matching is no coincidence http www genepartner com
    Love
  • statistically - hiding integer commitment scheme based on groups with hidden order In pages
    Damgard
  • Separability and efficiency for generic group signature schemes In
    Camenisch
  • Fiat How to prove yourself : Practical solutions to identification and signature scheme In pages
    Shamir
  • The library http http www certivox com miracl
    Miracl
  • Public verifiability in the covert model almost for free In
    Kolesnikov
  • Efficient oblivious transfer protocols In SODA pages
    Naor
  • Outsourcing multiparty computation Cryptology ePrint Archive Report
    Kamara
  • Garbled circuits checking garbled circuits : More efficient and secure two - party computation In pages
    Mohassel
  • andMe Genetic Testing for Ancestry DNA Test http www andme com
  • Practical private set intersection protocols with linear complexity In and FC pages
    De Cristofaro
  • Quid pro quo tocols Strengthening semi - honest protocols with dual execution In of Privacy
    Huang
  • Efficiency tradeoffs for malicious two - party computation In pages
    Mohassel
  • Efficient two - party secure computation on committed inputs In EUROCRYPT pages
    Jarecki
  • andMe Genetic Testing for Ancestry DNA Test http www andme com
  • Private intersection of certified sets In FC pages
    Camenisch
  • Efficient group signature schemes for large groups In
    Camenisch
  • Improved garbled circuit Free gates applications In pages
    Kolesnikov
  • Countering Efficient and secure testing of fullysequenced human genomes In pages
    Baldi
  • Privacy - preserving matching of DNA profiles Cryptology ePrint Archive Report
    Bruekers
  • Garbled circuits checking garbled circuits : More efficient and secure two - party computation In pages
    Mohassel
  • De Secure genomic testing with size - and position - hiding private substring matching In pages
    Cristofaro
  • Feigenbaum Reuse it or lose it : More efficient secure computation through reuse of encrypted values In pages
    Mood
  • minimal model for secure computation In pages
    Feige
  • Efficient committed oblivious transfer of bit strings In Information Conference pages
    Kiraz
  • More efficient oblivious transfer and extensions for faster secure computation In
    Asharov
  • Statistical zero knowledge protocols to prove modular polynomial relations In pages
    Fujisaki
  • De Are privacy - preserving genomic tests ready for prime time In pages
    Cristofaro
  • proof of security of protocol for two - party computation of
    Lindell
  • Privacy - preserving matching of DNA profiles Cryptology ePrint Archive Report
    Bruekers
  • Efficiency tradeoffs for malicious two - party computation In pages
    Mohassel
  • new approach to practical active - secure two - party computation In pages
    Nielsen
  • De Secure genomic testing with size - and position - hiding private substring matching In pages
    Cristofaro
  • Efficient oblivious transfer protocols In SODA pages
    Naor
  • The library http http www certivox com miracl
    Miracl
  • proof of security of protocol for two - party computation of
    Lindell
  • Feigenbaum Reuse it or lose it : More efficient secure computation through reuse of encrypted values In pages
    Mood
  • Oblivious and fair server aided two party computation In ARES pages
    Herzberg
  • new approach to practical active - secure two - party computation In pages
    Nielsen
  • Statistical zero knowledge protocols to prove modular polynomial relations In pages
    Fujisaki
  • a shelat Two - output secure computation with malicious adversaries In
    Shen
  • Identifying genetic relatives without compromising privacy
    He
  • Limits on the security of coin flips when half the processors are faulty In pages
    Cleve
  • framework for outsourcing of secure computation In ACM Workshop on pages
    Jakobsen
  • Non - interactive verifiable computing outsourcing computation to untrusted workers In pages
    Gennaro
  • Privacy - enhancing technology for medical tests using genomic data Technical Report EPFL - REPORT
    Ayday
  • a shelat Mood portable circuit format for scalable two - party secure computation In
    Kreuter
  • Oblivious and fair server aided two party computation In ARES pages
    Herzberg
  • Privacy - preserving computation of disease risk by using genomic clinical and environmental data In HealthTech
    Ayday
  • Limits on the security of coin flips when half the processors are faulty In pages
    Cleve
  • Privacy preserving protocol for detecting genetic relatives using rare variants In pages
    Hormozdiari
  • system for server - aided secure function evaluation In pages
    Kamara
  • system for server - aided secure function evaluation In pages
    Kamara
  • minimal model for secure computation In pages
    Feige
  • Secure outsourced garbled circuit evaluation for mobile devices In
    Carter
  • Secure outsourced garbled circuit evaluation for mobile devices In
    Carter
  • general certification framework with applications to privacyenhancing certificate infrastructures In Security and Privacy in Dynamic pages
    Camenisch
  • Non - interactive verifiable computing outsourcing computation to untrusted workers In pages
    Gennaro
  • GenePartner com DNA matching is no coincidence http www genepartner com
    Love
  • general certification framework with applications to privacyenhancing certificate infrastructures In Security and Privacy in Dynamic pages
    Camenisch
  • Privacy - preserving computation of disease risk by using genomic clinical and environmental data In HealthTech
    Ayday
  • Efficient verification of input consistency in server - assisted secure function evaluation In CANS pages
    Kolesnikov
  • a shelat Mood portable circuit format for scalable two - party secure computation In
    Kreuter
  • Efficient verification of input consistency in server - assisted secure function evaluation In CANS pages
    Kolesnikov
  • Secure text processing with applications to private DNA matching In pages
    Katz
  • Countering Efficient and secure testing of fullysequenced human genomes In pages
    Baldi
  • Extending oblivious transfers efficiently In pages
    Ishai
  • Fiat How to prove yourself : Practical solutions to identification and signature scheme In pages
    Shamir
  • Efficient garbling from a fixed - key blockcipher In of Privacy pages
    Bellare
  • Efficient garbling from a fixed - key blockcipher In of Privacy pages
    Bellare
  • Goldwasser Rothblum One time programs In pages
    Kalai
  • De Secure genomic testing with size - and position - hiding private substring matching In pages
    Cristofaro
  • statistically - hiding integer commitment scheme based on groups with hidden order In pages
    Damgard