当前位置: X-MOL 学术Telecommun. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A sustainable certificateless authenticated searchable encryption with multi-trapdoor indistinguishability
Telecommunication Systems ( IF 2.5 ) Pub Date : 2024-03-20 , DOI: 10.1007/s11235-024-01121-w
Mohammed Raouf Senouci , Ilyas Benkhaddra , Abdelkader Senouci , Fagen Li

Abstract

Nowadays, users often opt to encrypt their sensitive data before outsourcing it to the cloud. While this encryption ensures data privacy, it compromises the search functionality. Public key encryption with keyword search (PEKS) has been posited as a potential solution to this challenge. However, many PEKS schemes are either inefficient or vulnerable to various types of attacks, such as inside keyword guessing attacks, outside keyword guessing attacks, etc. In response, we introduce a sustainable certificateless authenticated encryption system with a keyword search scheme. To the best of our knowledge, this proposed scheme is the first to consider multi-trapdoor indistinguishability within the certificateless primitive. Furthermore, our in-depth security analysis indicates that our scheme effectively protects against both online and offline keyword guessing attacksAdditionally, it ensures semantic security by offering both ciphertext indistinguishability and multi-trapdoor indistinguishability. Performance analysis results also suggest that our scheme is efficient and superior to existing alternatives.



中文翻译:

具有多活板门不可区分性的可持续无证书认证可搜索加密

摘要

如今,用户通常选择在将敏感数据外包到云之前对其进行加密。虽然这种加密可以确保数据隐私,但它会损害搜索功能。带关键字搜索的公钥加密 (PEKS) 已被认为是应对这一挑战的潜在解决方案。然而,许多PEKS方案要么效率低下,要么容易受到各种类型的攻击,例如内部关键字猜测攻击、外部关键字猜测攻击等。为此,我们引入了一种具有关键字搜索方案的可持续无证书认证加密系统。据我们所知,这个提出的方案是第一个考虑无证书原语中多活板门不可区分性的方案。此外,我们深入的安全分析表明,我们的方案可以有效防止在线和离线关键字猜测攻击。此外,它通过提供密文不可区分性和多陷门不可区分性来确保语义安全。性能分析结果还表明我们的方案是有效的并且优于现有的替代方案。

更新日期:2024-03-21
down
wechat
bug