Marina Blanton
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Marina Blanton has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Fattaneh Bayatbabolghani
Computer Science and Engineering University of Notre Dame
2 shared publications - Everaldo Aguiar
University of Notre Dame
1 shared publication Fattaneh Bayatbabolghani
University of Notre Dame
1 shared publication- Mehrdad Aliasgari
California State University
1 shared publication Siddharth Saraph
University of Notre Dame
1 shared publication
Latest Publications
- 2 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Security & Privacy
- Vol. 15 (5) , 20-28
Improving the Security and Efficiency of Private Genomic Computation Using Server Aid
In many genomic applications, especially nonmedical applications, computations are carried out in a server-mediated setting where the server enables joint genomic computations between users. Thus, it's sensible to utilize the server's computational capabilities to aid data protection.
- 2 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Security & Privacy
- Vol. 15 (5) , 20-28
Improving the Security and Efficiency of Private Genomic Computation Using Server Aid
In many genomic applications, especially nonmedical applications, computations are carried out in a server-mediated setting where the server enables joint genomic computations between users. Thus, it's sensible to utilize the server's computational capabilities to aid data protection.
- 23 September 2016
- Published by Springer Nature in International Journal of Information Security
- Vol. 16 (6) , 577-601
Secure computation of hidden Markov models and secure floating-point arithmetic in the malicious model
- 23 September 2016
- Published by Springer Nature in International Journal of Information Security
- Vol. 16 (6) , 577-601
Secure computation of hidden Markov models and secure floating-point arithmetic in the malicious model
- Open Access
- 14 July 2016
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2016 (4) , 144-164
Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation
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.
- 14 July 2016
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2016 (4) , 144-164
Open AccessEfficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation
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.
- 3 October 2015
- Published by Springer Nature in International Journal of Information Security
- Vol. 15 (5) , 493-518
Private and oblivious set and multiset operations
- 3 October 2015
- Published by Springer Nature in International Journal of Information Security
- Vol. 15 (5) , 493-518
Private and oblivious set and multiset operations
- Open Access
- 1 January 2015
- Published by Springer Nature
- p. 384-406
Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
- 1 January 2015
- Published by Springer Nature
- p. 384-406
Open AccessOblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification