Public Key Encryption with Keyword Search Revisited

Baek, Joonsang; Safavi–Naini, Reihaneh; Susilo, Willy

doi:10.1007/978-3-540-69839-5_96

Cited by 372 publications

(354 citation statements)

References 11 publications

Supporting

Mentioning

350

Contrasting

Unclassified

Order By: Relevance

“…Secure computations on binary decision trees were introduced in [8], yet they have long execution time due to the use of the IBM HElib library. Searching an encrypted database was previeously addressed by [4], [6], [7], [14]. One drawback in [4], [6] was the need for a special key to aid the server in performing the search request.…”

Section: Related Workmentioning

confidence: 99%

“…Searching an encrypted database was previeously addressed by [4], [6], [7], [14]. One drawback in [4], [6] was the need for a special key to aid the server in performing the search request. They achieve a weaker security notion, namely one where partial information about the data access pattern is leaked.…”

Section: Related Workmentioning

confidence: 99%

“…x [2] x [3] x [4] x [5] x [6] x [7] X is more suited for a GPU global memory architecture. This design was also attractive due to its hardware regularity, which is also better suited for the GPU kernels.…”

Section: Number Theoretic Transformmentioning

confidence: 99%

See 2 more Smart Citations

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

Khedr

Gulak

Vaikuntanathan

2016

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-Homomorphic encryption (HE) systems enable computations on encrypted data, without decrypting and without knowledge of the secret key. In this work, we describe an optimized Ring Learning With Errors (RLWE) based implementation of a variant of the HE system recently proposed by Gentry, Sahai and Waters (GSW). Although this system was widely believed to be less efficient than its contemporaries, we demonstrate quite the opposite behavior for a large class of applications. We first highlight and carefully exploit the algebraic features of the system to achieve significant speedup over the state-of-the-art HE implementation, namely the IBM homomorphic encryption library (HElib). We introduce several optimizations on top of our HE implementation, and use the resulting scheme to construct a homomorphic Bayesian spam filter, secure multiple keyword search, and a homomorphic evaluator for binary decision trees. Our results show a factor of 10× improvement in performance (under the same security settings and CPU platforms) compared to IBM HElib for these applications. Our system is built to be easily portable to GPUs (unlike IBM HElib) which results in an additional speedup of up to a factor of 103.5× to offer an overall speedup of 1035×.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

Khedr

Gulak

Vaikuntanathan

2016

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…Key Encryption with Keyword Search (PEKS) is an asymmetric cryptographic mechanism that allows an entity to delegate the storage of its encrypted data, while preserving the capability to search encrypted keywords related to the encrypted information [9,10]. The entity uses the public key of a recipient PK to calculate the searchable encryption SPEKS of a set of keywords kw = {kw 1 , kw 2 , .…”

Section: Public Key Encryption With Abstractearch the Publicmentioning

confidence: 99%

“…Upon receiving the random nonce, ATA generates its own random nonce 15 and a random symmetric key 10 , 10 )) and uses it to obtain ( 14 , 15 , PCRL V ) = SDec( 10 , SEnc( 10 , ( 14, 15, PCRL V ))). Upon decrypting the data, Cloud ATA verifies the freshness of the message by comparing the decrypted 14 with the previously generated 14.…”

Section: Interregion Pseudo-certificatementioning

confidence: 99%

5G-VRSec: Secure Video Reporting Service in 5G Enabled Vehicular Networks

Yoo

2017

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Despite an imminent arrival of the 5G communication technology, there are only a few research works done using such technology in the field of vehicular networks. One of the pioneers in proposing a service for 5G enabled vehicular networks is the Eiza-Ni-Shi Scheme. In such scheme, the authors present an innovative system model for 5G vehicular networks that enables a secure real-time video reporting service with privacy awareness. Even though the proposed service is very important since it aims to improve the road safety, it cannot be considered secure enough. This work found that the scheme has serious security flaws and functionality limitations. First, it is vulnerable to Department of Motor Vehicles and Law Enforcement Agency impersonation attacks, it allows forged video upload, there is no separation of responsibilities between Law Enforcement Agency and trusted authority, and it is susceptible to privileged insider attack. In addition, it does not contemplate the management of multiple geographic/administrative regions (multiple trusted authorities) which is important in real implementations. In this situation, the present work proposes an extended scheme that eliminates the identified security flaws and implements new features that make the implementation across several geographic/administrative regions possible.

show abstract

Enabling efficient and secure data sharing in cloud computing

Liu

et al. 2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWith the rapid development of cloud computing, more and more data are being centralized into remote cloud server for sharing, which raises a challenge on how to keep them both private and accessible. Although searchable encryption provides an efficient solution to support keyword‐based search directly on encrypted data, considering its application in file sharing, existing work depends on key sharing among authorized users, which inevitably causes the risks of key exposure and abuse. In this paper, aiming at enabling efficient and secure data sharing in cloud computing, we provide a generic construction for this purpose. The proposed construction is full‐featured: (i) It enables authorized users to perform keyword‐based search directly on encrypted data without sharing the unique secret key; and (ii) it provides two‐layered access control to limit unauthorized user's access to the shared data. On the basis of the proposed generic construction, we utilize the existing techniques on identity‐based broadcast encryption and public key searchable encryption to instantiate a concrete construction. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Public Key Encryption with Keyword Search Revisited

Cited by 372 publications

References 11 publications

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

5G-VRSec: Secure Video Reporting Service in 5G Enabled Vehicular Networks

Enabling efficient and secure data sharing in cloud computing

Contact Info

Product

Resources

About