Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Subtitle:
Article type: Research Article
Authors: Shao, Zhiyia; b; c; * | Yang, Boa; b; c | Zhang, Wenzhengb | Zhao, Yia | Wu, Zhenqianga | Miao, Meixiad
Affiliations: [a] School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi, China | [b] Science and Technology on Communication Security Laboratory, Chengdu, Sichuan, China | [c] State Key Laboratory of Information Security, Beijing, China | [d] State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, Shaanxi, China
Correspondence: [*] Corresponding author: Zhiyi Shao, School of Computer Science, Shaanxi Normal University, Xi'an 710119, Shaanxi, China.shaozy@snnu.edu.cn
Abstract: Medical information sharing is one of the most attractive applications of cloud computing, where searchable encryption is a fascinating solution for securely and conveniently sharing medical data among different medical organizers. However, almost all previous works are designed in symmetric key encryption environment. The only works in public key encryption do not support keyword trapdoor security, have long ciphertext related to the number of receivers, do not support receiver revocation without re-encrypting, and do not preserve the membership of receivers. In this paper, we propose a searchable encryption supporting multiple receivers for medical information sharing based on bilinear maps in public key encryption environment. In the proposed protocol, data owner stores only one copy of his encrypted file and its corresponding encrypted keywords on cloud for multiple designated receivers. The keyword ciphertext is significantly shorter and its length is constant without relation to the number of designated receivers, i.e., for n receivers the ciphertext length is only twice the element length in the group. Only the owner knows that with whom his data is shared, and the access to his data is still under control after having been put on the cloud. We formally prove the security of keyword ciphertext based on the intractability of Bilinear Diffie-Hellman problem and the keyword trapdoor based on Decisional Diffie-Hellman problem.
Keywords: Medical information sharing, searchable encryption, multiple receivers, ciphertext security, trapdoor security
DOI: 10.3233/thc-150945
Journal: Technology and Health Care, vol. 23, no. s1, pp. S133-S137, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl