Certificateless authenticated encryption with keyword search: Enhanced security model and a concrete construction for industrial IoT

2020 ◽  
Vol 53 ◽  
pp. 102525
Author(s):  
Nasrollah Pakniat ◽  
Danial Shiraly ◽  
Ziba Eslami
2020 ◽  
Vol 516 ◽  
pp. 515-528 ◽  
Author(s):  
Baodong Qin ◽  
Yu Chen ◽  
Qiong Huang ◽  
Ximeng Liu ◽  
Dong Zheng

2021 ◽  
pp. 19-38
Author(s):  
Baodong Qin ◽  
Hui Cui ◽  
Xiaokun Zheng ◽  
Dong Zheng

Author(s):  
Fei Meng ◽  
Leixiao Cheng ◽  
Mingqiang Wang

AbstractCountless data generated in Smart city may contain private and sensitive information and should be protected from unauthorized users. The data can be encrypted by Attribute-based encryption (CP-ABE), which allows encrypter to specify access policies in the ciphertext. But, traditional CP-ABE schemes are limited because of two shortages: the access policy is public i.e., privacy exposed; the decryption time is linear with the complexity of policy, i.e., huge computational overheads. In this work, we introduce a novel method to protect the privacy of CP-ABE scheme by keyword search (KS) techniques. In detail, we define a new security model called chosen sensitive policy security: two access policies embedded in the ciphertext, one is public and the other is sensitive and hidden. If user's attributes don't satisfy the public policy, he/she cannot get any information (attribute name and its values) of the hidden one. Previous CP-ABE schemes with hidden policy only work on the “AND-gate” access structure or their ciphertext size or decryption time maybe super-polynomial. Our scheme is more expressive and compact. Since, IoT devices spread all over the smart city, so the computational overhead of encryption and decryption can be shifted to third parties. Therefore, our scheme is more applicable to resource-constrained users. We prove our scheme to be selective secure under the decisional bilinear Diffie-Hellman (DBDH) assumption.


2022 ◽  
pp. 102390
Author(s):  
Danial Shiraly ◽  
Nasrollah Pakniat ◽  
Mahnaz Noroozi ◽  
Ziba Eslami

Author(s):  
Biwen Chen ◽  
Libing Wu ◽  
Sherali Zeadally ◽  
Debiao He

2019 ◽  
Vol 481 ◽  
pp. 330-343 ◽  
Author(s):  
Hongbo Li ◽  
Qiong Huang ◽  
Jian Shen ◽  
Guomin Yang ◽  
Willy Susilo

2017 ◽  
Vol 28 (06) ◽  
pp. 661-682
Author(s):  
Rashed Mazumder ◽  
Atsuko Miyaji ◽  
Chunhua Su

Security, privacy and data integrity are the critical issues in Big Data application of IoT-enable environment and cloud-based services. There are many upcoming challenges to establish secure computations for Big Data applications. Authenticated encryption (AE) plays one of the core roles for Big Data’s confidentiality, integrity, and real-time security. However, many proposals exist in the research area of authenticated encryption. Generally, there are two concepts of nonce respect and nonce reuse under the security notion of the AE. However, recent studies show that nonce reuse needs to sacrifice security bound of the AE. In this paper, we consider nonce respect scheme and probabilistic encryption scheme which are more efficient and suitable for big data applications. Both schemes are based on keyed function. Our first scheme (FS) operates in parallel mode whose security is based on nonce respect and supports associated data. Furthermore, it needs less call of functions/block-cipher. On the contrary, our second scheme is based on probabilistic encryption. It is expected to be a light solution because of weaker security model construction. Moreover, both schemes satisfy reasonable privacy security bound.


2021 ◽  
pp. 193-213
Author(s):  
Xueqiao Liu ◽  
Kai He ◽  
Guomin Yang ◽  
Willy Susilo ◽  
Joseph Tonien ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document