Verifiable Identity-Based Encryption with Keyword Search for IoT from Lattice

Lin, Minghua; Xu, Chunxiang; Xu, Lei; Yu, Xiaowei; Zuo, Cong

doi:10.32604/cmc.2021.017216

Cited by 8 publications

(12 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As compared to the lattice-based searchable encryption schemes YXX22 31 and MXX21, 33 it is evident that our scheme has smaller keyword ciphertext and trapdoor sizes MXX21 33 No No Secure Insecure Insecure Yes Ours Yes Yes Secure Secure Secure Secure compared to YXX22, 31 while having storage size similar to MXX21. 33 Due to the algebraic structures of lattice cryptography, such as matrices and vectors, our scheme requires more storage space when compared to LLW21 8 and LHS19. 32 We have compared our scheme with existing searchable encryption schemes in terms of security and other performance aspects, as listed in Table 4.…”

Section: Performance Analysismentioning

confidence: 85%

“…As indicated in Table 3, Test algorithm of MXX21 33 involves t the matrix multiplication operations, while our scheme's Test algorithm requires 2t the matrix multiplication operations and matrix inverse operations, resulting in higher Test algorithm time cost compared to MXX21. 33 However, in comparison to the Test algorithm time cost of YXX22, 31 as shown in Figure 6, our scheme exhibits lower time costs. Although the test algorithm in our scheme involves the matrix inverse operation, it should be noted that the inversion matrix is only related to the CS private key.…”

Section: Performance Analysismentioning

confidence: 99%

See 1 more Smart Citation

A lattice‐based searchable encryption scheme with multi‐user authorization for the certificateless cloud computing environment

Zhou,

Tang,

Yang

2024

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Public key encryption with keyword search (PEKS) is able to enhance cloud data security. On the other hand, the existence of malicious cloud servers and untrusted central authorities, in addition the keyword space faces a low entropy, attackers often launch keyword guessing attacks (KGA), thereby leaking data privacy. Therefore, we use certificateless authentication and proxy re‐encryption technology to construct a lattice‐based verifiable PEKS scheme for Multi‐Data Users (MDU). Certificateless authentication can ensure that our scheme does not require key escrow, and proxy re‐encryption technology allows us to perform multi‐user authorization and use the verification block for data users to ensure the integrity of search results. Security research proves that, under the assumption that the learning with errors (LWE) problem is hard, the ciphertext is indistinguishable and resistant to KGA. Results from experiments show that our scheme is significantly more effective than current schemes.

show abstract

Section: Performance Analysismentioning

confidence: 85%

Section: Performance Analysismentioning

confidence: 99%

A lattice‐based searchable encryption scheme with multi‐user authorization for the certificateless cloud computing environment

Zhou,

Tang,

Yang

2024

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…The searchable encryption scheme under the public key system was presented by Boneh et al [1], which also gave a general transformation from identity-based encryption (IBE) to PEKS. Since then, many improved schemes [9][10][11][12][13][14][15][16][17][18][19][20][21][22] involving security, performance, function were presented. After Park et al [2] put forward a PECKS scheme which supports joint keyword search, many works [23][24][25][26][27] have been committed to reducing the computation cost and the trapdoor length.…”

Section: Related Workmentioning

confidence: 99%

Efficient Expressive Attribute-Based Encryption with Keyword Search over Prime-Order Groups

Miao¹,

Guo²,

Lu³

et al. 2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

Attribute-based encryption with keyword search (ABEKS) is a novel cryptographic paradigm that can be used to implement fine-grained access control and retrieve ciphertexts without disclosing the sensitive information. It is a perfect combination of attribute-based encryption (ABE) and public key encryption with keyword search (PEKS). Nevertheless, most of the existing ABEKS schemes have limited search capabilities and only support single or simple conjunctive keyword search. Due to the weak search capability and inaccurate search results, it is difficult to apply these schemes to practical applications. In this paper, an efficient expressive ABEKS (EABEKS) scheme supporting unbounded keyword universe over prime-order groups is designed, which supplies the expressive keyword search function supporting the logical connectives of "AND" and "OR". The proposed scheme not only leads to low computation and communication costs, but also supports unbounded keyword universe. In the standard model, the scheme is proven to be secure under the chosen keyword attack and the chosen plaintext attack. The comparison analysis and experimental results show that it has better performance than the existing EABEKS schemes in the storage, computation and communication costs.

show abstract

“…Searchable encryption [24,25] is a technique widely being explored in the area of cloud computing, where large amounts of data are stored in the cloud. Searchable encryption allows a user to generate a search query (also called a trapdoor) and can delegate the search across the peers involved in a network.…”

Section: Searchable Encryption On Dna Strandsmentioning

confidence: 99%

Water Is a Viable Data Storage Medium: A Security and Privacy Viewpoint

Tahir

et al. 2022

Electronics

View full text Add to dashboard Cite

The security of IoT devices is a major concern that needs to be addressed for their wide adoption. Users are constantly seeking devices that are faster and capable of holding large amounts of data securely. It is purported that water has memory of its own and the ability to retain memory of the substances that are dissolved into it, even after being substantially and serially diluted. It was also observed in the lab setting that the microscopic pattern of water obtained from the same vessel by different people is unique but can easily distinguish those individuals if the same experiment is executed repeatedly. Furthermore, extensive research is already underway that explores the storage of data on water and liquids. This leads to the requirement of taking the security and privacy concerns related to the storage of data on water into consideration, especially when the real-time collection of data related to water through the IoT devices is of interest. Otherwise, the water memory aspect may lead to leakage of the data and, consequently, the data owners identity. Therefore, this article for the first time highlights the security and privacy implications related to water memory and discusses the possible countermeasures to effectively handle these potential threats. This article also presents a framework to securely store sensitive data on water. The proof-of-concept prototype is implemented and tested over a real-world dataset to analyze the feasibility of the proposed framework. The performance analysis yields that the proposed framework can be deployed once data storage on water is widely used.

show abstract

Verifiable Identity-Based Encryption with Keyword Search for IoT from Lattice

Cited by 8 publications

References 13 publications

A lattice‐based searchable encryption scheme with multi‐user authorization for the certificateless cloud computing environment

A lattice‐based searchable encryption scheme with multi‐user authorization for the certificateless cloud computing environment

Efficient Expressive Attribute-Based Encryption with Keyword Search over Prime-Order Groups

Water Is a Viable Data Storage Medium: A Security and Privacy Viewpoint

Contact Info

Product

Resources

About