Searchable Encryption for Healthcare Clouds: A Survey

Zhang, Rui; Xue, Rui; Liu, Ling

doi:10.1109/tsc.2017.2762296

Cited by 93 publications

(36 citation statements)

References 74 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, to solve these problems, we proposed AVX2-optimized Simeck family block cipher implementations supporting various numbers of blocks with good performance to provide efficiency and availability of data encryption at the cloud or on the server side. The [35] AES, DES, Blowfish X X Zhang et al [36] Searchable encryption X X Zhao et al [40] Attribute-based encryption X X Proposed method Simeck O O [30] with the same data size (64 bytes). We also proposed adaptive encryption based on AVX2-optimized Simeck encryption for efficient big data encryption on the cloud or server side to ensure high performance.…”

Section: Resultsmentioning

confidence: 99%

“…They suggested that the Blowfish block cipher is the most appropriate algorithm for their proposed health care system. Zhang et al [36] described survey results on searchable encryption schemes and proposed searchable encryption to provide security and privacy on healthcare applications. Mohit et al [37] proposed a mutual authentication protocol for a cloud-computingbased health care system.…”

Section: Related Work On Cryptographic Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Secure Data Encryption for Cloud-Based Human Care Services

et al. 2018

View full text Add to dashboard Cite

Sensor network services utilize sensor data from low-end IoT devices of the types widely deployed over long distances. After the collection of sensor data, the data is delivered to the cloud server, which processes it to extract useful information. Given that the data may contain sensitive and private information, it should be encrypted and exchanged through the network to ensure integrity and confidentiality. Under these circumstances, a cloud server should provide high-speed data encryption without a loss of availability. In this paper, we propose efficient parallel implementations of Simeck family block ciphers on modern 64-bit Intel processors. In order to accelerate the performance, an adaptive encryption technique is also exploited for load balancing of the resulting big data. Finally, the proposed implementations achieved 3.5 cycles/byte and 4.6 cycles/byte for Simeck32/64 and Simeck64/128 encryption, respectively.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Related Work On Cryptographic Algorithmmentioning

confidence: 99%

Secure Data Encryption for Cloud-Based Human Care Services

et al. 2018

View full text Add to dashboard Cite

show abstract

“…Searchable encryption is a cryptographic primitive that supports keyword search over encrypted data . The problem of searching on encrypted data was introduced the first time by Song et al They proposed a schema enabling keyword search on cipher‐texts.…”

Section: Related Workmentioning

confidence: 99%

Toward a big data approach for indexing encrypted data in Cloud Computing

Kaci

Bouabana-Tebibel

Rachedi

et al. 2019

Security and Privacy

View full text Add to dashboard Cite

Searchable encryption provides encryption schemes allowing search on encrypted data without decrypting the whole collection. However, due to the huge amount of data that exists in the Cloud, it is required to review such encryption schemes to decrease search and indexation times. In this paper, we propose a big data approach called MR‐Index (MapReduce Indexation) that makes the indexation mechanism parallel. In fact, the proposed MR‐Index is composed of two phases: Map phase and Reduce phase. In the Map phase, MR‐Index processes documents in parallel to build for each keyword, the list of identifiers of documents containing it. Access control is ensured through attribute based encryption. In the reduce phase of MR‐Index, the data structures of the index are constructed. The MR‐Index is performed by a trusted party called searchable encryption authority. Experimental results, shown that the proposed solution decreases the indexation time for large documents, compared to the original sequential indexation mechanism. In terms of scalability of the solution, we ameliorated the MR‐Index using the Hadoop archive files.

show abstract

“…In today's society, almost all medical service providers will use some form of electronic medical record system [1]. Specifically, medical Internet of things (MIoT) has become a new technology to gather data from patients by small wearable devices or implantable sensors.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Searchable Public-Key Authenticated Encryption for Cloud-Assisted Medical Internet of Things

Chi

Qin

Zheng

2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

In recent years, it has become popular to upload patients’ medical data to a third-party cloud server (TCS) for storage through medical Internet of things. It can reduce the local maintenance burden of the medical data and importantly improve accuracy in the medical treatment. As remote TCS cannot be fully trusted, medical data should be encrypted before uploading, to protect patients’ privacy. However, encryption makes search capabilities difficult for patients and doctors. To address this issue, Huang et al. recently put forward the notion of Public-key Authenticated Encryption with Keyword Search (PAEKS) against inside keyword guessing attacks. However, the existing PAEKS schemes rely on time-consuming computation of parings. Moreover, some PAEKS schemes still have security issues in a multiuser setting. In this paper, we propose a new and efficient PAEKS scheme, which uses the idea of Diffie-Hellman key agreement to generate a shared secret key between each sender and receiver. The shared key will be used to encrypt keywords by the sender and to generate search trapdoors by the receiver. We prove that our scheme is semantically secure against inside keyword guessing attacks in a multiuser setting, under the oracle Diffie-Hellman assumption. Experimental results demonstrate that our PAEKS scheme is more efficient than that of previous ones, especially in terms of keyword searching time.

show abstract

Searchable Encryption for Healthcare Clouds: A Survey

Cited by 93 publications

References 74 publications

Secure Data Encryption for Cloud-Based Human Care Services

Secure Data Encryption for Cloud-Based Human Care Services

Toward a big data approach for indexing encrypted data in Cloud Computing

An Efficient Searchable Public-Key Authenticated Encryption for Cloud-Assisted Medical Internet of Things

Contact Info

Product

Resources

About