A fast search method for encrypted medical data

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes an inverted-index-based, practical, encrypted search engine, including encrypted index creation, search, and maintenance methods. Recently, more and more patients are placing their medical data at online third-party services, such as Google Health. If such sensitive data are stored at a semi-trusted third-party, security guarantee is necessary for assurance of data confidentiality and access pattern privacy. However, most service providers only provide such assurance by policy means. The new method proposed in this paper can efficiently resolve both the medical data confidentiality and sharing privacy issues. Based on our encrypted inverted-index table structure, key derivation and distribution methods, it is convenient for a patient to authorize others to access his encrypted medical data without any loss of data confidentiality and access pattern privacy to an unauthorized person. Further with the help of virtual deletion technology, our method resolves the encrypted index table maintenance issue when medical data are deleted. The experimental results show that the overhead of our solution is small compared to indexing and search times of traditional search engines. The security analysis shows that our solution assures data confidentiality and access pattern privacy. © 2009 IEEE.

Cite

CITATION STYLE

APA

Tian, Y., Lei, H., Wang, L., Zeng, K., & Fukushima, T. (2009). A fast search method for encrypted medical data. In Proceedings - 2009 IEEE International Conference on Communications Workshops, ICC 2009. https://doi.org/10.1109/ICCW.2009.5208080

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free