Verifiable Identity-Based Encryption with Keyword Search for IoT from Lattice
Source abstract
Abstract
Internet of Things (IoT), which provides the solution of connecting things and devices, has increasingly developed as vital tools to realize intelligent life. Generally, source-limited IoT sensors outsource their data to the cloud, which arises the concerns that the transmission of IoT data is happening without appropriate consideration of the profound security challenges involved. Though encryption technology can guarantee the confidentiality of private data, it hinders the usability of data. Searchable encryption (SE) has been proposed to achieve secure data sharing and searching. However, most of existing SE schemes are designed under conventional hardness assumptions and may be vulnerable to the adversary with quantum computers. Moreover, the untrusted cloud server may perform an unfaithful search execution. To address these problems, in this paper, we propose the first verifiable identity-based keyword search (VIBKS) scheme from lattice. In particular, a lattice-based delegation algorithm is adopted to help the data user to verify both the correctness and the integrity of the search results. Besides, in order to reduce the communication overhead, we refer to the identity-based mechanism. We conduct rigorous proof to demonstrate that the proposed VIBKS scheme is ciphertext indistinguishable secure against the semi-honest-but-curious adversary. In addition, we give the detailed computation and communication complexity of our VIBKS and conduct a series of experiments to validate its efficiency performance.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security · Complexity and Algorithms in Graphs · Blockchain Technology Applications and Security
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (25)
Show source-provided references
1. That internet of things thing
2. Internet of Things (IoT): A vision, architectural elements, and future directions10.1016/j.future.2013.01.010 ↗
3. Enabling comparable search over encrypted data for IoT with privacy-preserving10.32604/cmc.2019.05276 ↗
4. Practical techniques for searches on encrypted data
5. Public key encryption with keyword search
6. Public key encryption with conjunctive field keyword search
7. Public-key encryption with fuzzy keyword search: A provably secure scheme under keyword guessing attack10.1109/TC.2012.215 ↗
8. Proxy re-encryption with keyword search10.1016/j.ins.2010.03.026 ↗
9. Algorithms for quantum computation: Discrete logarithms and factoring
10. Quantum supremacy using a programmable superconducting processor10.1038/s41586-019-1666-5 ↗
11. Keyword search over encrypted data in cloud computing from lattices in the standard model
12. Multi-writer searchable encryption: An LWE-based realization and implementation
13. Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage10.1016/j.ins.2019.04.051 ↗
14. Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices10.1002/ett.3531 ↗
15. Protecting your right: Verifiable attribute-based keyword search with fine-grained owner enforced search authorization in the cloud10.1109/TPDS.2014.2355202 ↗
16. FS-PEKS: Lattice-based forward secure public-key encryption with keyword search for cloud-assisted industrial internet of things10.1109/TDSC.2019.2914117 ↗
17. Lattice-based searchable encryption scheme against inside keywords guessing attack10.32604/cmc.2020.09680 ↗
18. Verifiable delegation of computation over large datasets
19. VABKS: Verifiable attribute-based keyword search over outsourced encrypted data
20. Verifiable searchable encryption framework against insider keyword-guessing attack in cloud storage
21. Verifiable public key encryption with keyword search based on homomorphic encryption in multi-user setting10.1109/ACCESS.2018.2861424 ↗
22. On lattices, learning with errors, random linear codes, and cryptography10.1145/1568318.1568324 ↗
23. Generating shorter bases for hard random lattices10.1007/s00224-010-9278-3 ↗
24. Trapdoors for hard lattices and new cryptographic constructions
25. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE