Lattice-Based Public Key Searchable Encryption from Experimental Perspectives

Behnia, Rouzbeh; Ozmen, Muslum Ozgur; Yavuz, Attila A.

doi:10.1109/tdsc.2018.2867462

Cited by 66 publications

(27 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To date, no lightweight operation can replace it while keeping the same algebraic features. In addition, very few PEKS schemes are constructed without bilinear mapping, such as the PEKS schemes based on quadratic residuosity or lattice algebra [16]- [19]. However, all of them cannot achieve fast searching performance over ciphertexts, i.e., the sublinear search complexity, and many random numbers are chosen in their encryption algorithms.…”

Section: Related Workmentioning

confidence: 99%

Lightweighted Secure Searching Over Public-Key Ciphertexts for Edge-Cloud-Assisted Industrial IoT Devices

Wang

Liu

et al. 2020

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

For the industrial Internet of Things (IIoT), public-key encryption with keyword search (PEKS) is a type of applicable and promising encryption technique to maintain the data stored in clouds secure and searchable. To further improve the efficiency of searching, it is popular to introduce edge computing near the IIoT as the substitute for a cloud. However, the straightforward collaboration of the two techniques performs negatively in latency-sensitive applications since the sluggish encryption of PEKS by IIoT devices negates the instant reaction of edges. To meet this challenge, in this article, we exploit the capability

show abstract

Section: Related Workmentioning

confidence: 99%

Lightweighted Secure Searching Over Public-Key Ciphertexts for Edge-Cloud-Assisted Industrial IoT Devices

Wang

Liu

et al. 2020

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

show abstract

“…There are many directions on the research of PEKS. For example, some schemes [24][25][26] are constructed to possess resistance against for a quantum attack by founding on lattice-based cryptography. Other direction is to prohibit reusing a token (namely, a trapdoor), Sharma et al proposed a scheme which can evaluate the freshness of the token in [27].…”

Section: Related Searchable Techniquesmentioning

confidence: 99%

Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages

Kodera

Kuribayashi

Kusaka

et al. 2019

IJNC

View full text Add to dashboard Cite

IoT technologies and cloud storages have been developed remarkably, and many types of data including private information have been gradually outsourced. For such a situation, new convenient functionalities such as arithmetic and a keyword search over ciphertexts are required to allow users to obtain information without leaking queried results, contents of ciphertext, and so on. Especially, searchable encryptions have been paid much attention to realize a keyword search on an encrypted domain. In addition, an architecture of searchable symmetric encryption (SSE) is a suitable and efficient solution for data outsourcing. In this paper, we focus on an SSE scheme which employs a secure index for searching a keyword. In conventional studies, it has been widely considered that the scheme searches whether a queried keyword is contained in encrypted documents or not. On the other hand, we additionally take into account the location of the queried keyword in the documents by targeting a matrix-type data format. The method enables an administrator to search personal information listed per line or column in CSV-like format data.

show abstract

“…Behnia et al [24] proposed two PEKS schemes from a view of the experiment, where one scheme is based on NTRU, the other is based on LWE problem. In this work, they implemented NTRU-PEKS that is 18 times lower end-to-end delay than the most efficient pairing-based scheme.…”

Section: B Related Workmentioning

confidence: 99%

“…So searchable encryption scheme that can resist quantum computing attack is an urgent issue. Since then, some lattice-based searchable encryption schemes [21]- [24] were proposed.…”

Section: Introductionmentioning

confidence: 99%

Lattice-Based Searchable Encryption With Keywords Revocable and Bounded Trapdoor Exposure Resistance

2019

IEEE Access

View full text Add to dashboard Cite

Searchable encryption plays a vital role in keeping data privacy of current cloud storage. Considering the security threat of trapdoor exposure, Emura et al. introduced a formal definition of keywords revocable public-key encryption with keywords search (KR-PEKS), which satisfies trapdoor exposure resistance (TER) and trapdoor re-generability. However, there is little work on lattice-based searchable encryption schemes to have the above properties, while it was widely accepted that cryptosystem on lattice has the potential to resist quantum computing attack. In this paper, we give a model of KR-PEKS with novel security, called bounded TER, i.e., a bounded number (previously set) of trapdoors for per keyword are exposed, which cannot affect other keywords. Then, we propose a lattice-based KR-PEKS scheme with bounded TER and trapdoor re-generability and show that this scheme is secure under the hardness assumption of learning with errors (LWE) problem. Finally, we conduct some simulation experiments on our scheme and give a comparison, which indicates that our scheme has less computational cost than the prior arts.

show abstract

Lattice-Based Public Key Searchable Encryption from Experimental Perspectives

Cited by 66 publications

References 56 publications

Lightweighted Secure Searching Over Public-Key Ciphertexts for Edge-Cloud-Assisted Industrial IoT Devices

Lightweighted Secure Searching Over Public-Key Ciphertexts for Edge-Cloud-Assisted Industrial IoT Devices

Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages

Lattice-Based Searchable Encryption With Keywords Revocable and Bounded Trapdoor Exposure Resistance

Contact Info

Product

Resources

About