Verifiable Multi-keyword Search Encryption Scheme with Anonymous Key Generation for Medical Internet of Things

AbstractPublic key encryption scheme with keyword search is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it’s critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user’s secret keys are exposed. In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors problem on the standard model.

Download Full-text

Designated Server-Aided Revocable Identity-based Keyword Search on Lattice

10.21203/rs.3.rs-137965/v1 ◽

2021 ◽

Author(s):

Ying Guo ◽

Fei Meng ◽

Leixiao Cheng ◽

Xiaolei Dong ◽

Zhenfu Cao

Keyword(s):

Standard Model ◽

Keyword Search ◽

Key Generation ◽

Encryption Scheme ◽

Security Proof ◽

The Standard Model ◽

Secret Keys ◽

Identity Based ◽

Learning With Errors ◽

Designated Server

Abstract Public key encryption scheme with keyword search (PEKS) is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it's critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user's secret keys are exposed.In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors (LWE) problem on the standard model.

Download Full-text

LQI-Key: Symmetric Key Generation Scheme for Internet-of-Things (IoT) Devices Using Wireless Channel Link Quality

2018 Second International Conference on Advances in Electronics, Computers and Communications (ICAECC) ◽

10.1109/icaecc.2018.8479465 ◽

2018 ◽

Cited By ~ 1

Author(s):

Nandini Kuruwatti ◽

Y. N. Nayana ◽

Nikhita Sarole ◽

Girish Revadigar ◽

Chitra Javali

Keyword(s):

Internet Of Things ◽

Wireless Channel ◽

Link Quality ◽

Key Generation ◽

Symmetric Key ◽

Iot Devices

Download Full-text

Secure and flexible keyword search over encrypted data with outsourced decryption in Internet of things

annals of telecommunications - annales des télécommunications ◽

10.1007/s12243-018-0694-8 ◽

2018 ◽

Vol 74 (7-8) ◽

pp. 413-421 ◽

Cited By ~ 1

Author(s):

Yinghui Zhang ◽

Axin Wu ◽

Tiantian Zhang ◽

Dong Zheng

Keyword(s):

Internet Of Things ◽

Keyword Search ◽

Encrypted Data ◽

Outsourced Decryption

Download Full-text

Attribute-based encryption scheme with multi-keyword search and supporting attribute revocation in cloud storage

PLoS ONE ◽

10.1371/journal.pone.0205675 ◽

2018 ◽

Vol 13 (10) ◽

pp. e0205675 ◽

Cited By ~ 2

Author(s):

Shangping Wang ◽

Lisha Yao ◽

Yaling Zhang

Keyword(s):

Cloud Storage ◽

Keyword Search ◽

Encryption Scheme ◽

Attribute Based Encryption

Download Full-text

Proxy Re-Encryption in cloud using ALBC (adaptive lattice based cryptography)

Indonesian Journal of Electrical Engineering and Computer Science ◽

10.11591/ijeecs.v16.i3.pp1455-1463 ◽

2019 ◽

Vol 16 (3) ◽

pp. 1455

Author(s):

Chandrakala B M ◽

S C Lingareddy

Keyword(s):

Comparative Analysis ◽

Data Sharing ◽

Data Security ◽

Key Generation ◽

Encryption Scheme ◽

Two Phase ◽

Data Store ◽

Learning With Errors ◽

Lattice Based Cryptography

<p>In recent days, data sharing has provided the flexibility to share the data, store the data, and perform operation on data virtually as well as cost effectively. Data sharing in cloud is one of the feature, which is being popular and widely accepted. However, the concern here is to ensure the data security and this has led the researcher to research in this area. To provide the security several Proxy re-encryption scheme has been introduced, however all these method lacks of efficiency. Hence In this paper, we propose a scheme known as ALBC (Adaptive Lattice Based Cryptography), this scheme follows the two phase i.e. encryption and Re-encryption. Encryption phase has few algorithms such as Key_Gen, Enc, Dec. Similarly ALBC Re-Enc has five algorithm i.e. Key_Gen, Key_ReGen, Enc, Re-Enc, Dec. our algorithm not only provides the security but also solves the problem of RL(Ring-learning) with errors problems. In order to evaluate, our algorithm is compared with the existing model in terms of encryption time, decryption time, re-encryption time, key generation and key regeneration by varying the various key size. When we observe the comparative analysis, it is observed that our algorithm outperforms the existing algorithm.</p>

Download Full-text

LLSFIoT: Lightweight Logical Security Framework for Internet of Things

Wireless Communications and Mobile Computing ◽

10.1155/2021/8526206 ◽

2021 ◽

Vol 2021 ◽

pp. 1-9

Author(s):

Isha Batra ◽

Hatem S. A. Hamatta ◽

Arun Malik ◽

Mohammed Baz ◽

Fahad R. Albogamy ◽

...

Keyword(s):

Internet Of Things ◽

Data Security ◽

Algorithm Design ◽

Research Work ◽

Generation Mechanism ◽

Key Generation ◽

Security Framework ◽

Heavy Weight ◽

Work First ◽

Security Enhancements

Current research in Internet of Things (IoT) is focused on the security enhancements to every communicated message in the network. Keeping this thought in mind, researcher in this work emphasizes on a security oriented cryptographic solution. Commonly used security cryptographic solutions are heavy in nature considering their key size, operations, and mechanism they follow to secure a message. This work first determines the benefit of applying lightweight security cryptographic solutions in IoT. The existing lightweight counterparts are still vulnerable to attacks and also consume calculative more power. Therefore, this research work proposes a new hybrid lightweight logical security framework for offering security in IoT (LLSFIoT). The operations, key size, and mechanism used in the proposed framework make its lightweight. The proposed framework is divided into three phases: registration, authentication, and light data security (LDS). LDS offers security by using unique keys at each round bearing small size. Key generation mechanism used is comparatively fast making the compromise of keys as a difficult task. These steps followed in the proposed algorithm design make it lightweight and a better solution for IoT-based networks as compared to the existing solutions that are relatively heavy weight in nature.

Download Full-text