TY - GEN
T1 - Public-Key Encryption with Keyword Search in Multi-user, Multi-challenge Setting under Adaptive Corruptions
AU - Ling, Yunhao
AU - Zhang, Kai
AU - Chen, Jie
AU - Huang, Qiong
AU - Qian, Haifeng
N1 - Publisher Copyright:
© International Association for Cryptologic Research 2024.
PY - 2024
Y1 - 2024
N2 - In the past decade, much progress has been made on proposing encryption schemes with multi-user security. However, no known work aims at constructing a Public-key Encryption with Keyword Search (PEKS) scheme that is secure in multi-user setting. PEKS is a well-known primitive to solve the problem of searching over encrypted data. In this paper, we fill the gap. For more realistic multi-user scenario, we consider a strong security notion. Specifically, the adversary can adaptively corrupt some users’ secret keys, and can adaptively request searchable ciphertexts of related keywords under different public keys as well as trapdoors of related keywords under different secret keys. We present two multi-user PEKS schemes both under simple assumptions in the standard model to achieve this strong security notion. Technically, our first scheme is a variation of the Lewko-Waters identity-based encryption scheme, and our second scheme is a variation of the Wee identity-based encryption scheme. However, we need to prove that the presented public key encryption schemes are secure in the multi-user, multi-challenge setting under adaptive corruptions. We modify the dual system encryption methodology to meet the goal. In particular, the security loss is constant.
AB - In the past decade, much progress has been made on proposing encryption schemes with multi-user security. However, no known work aims at constructing a Public-key Encryption with Keyword Search (PEKS) scheme that is secure in multi-user setting. PEKS is a well-known primitive to solve the problem of searching over encrypted data. In this paper, we fill the gap. For more realistic multi-user scenario, we consider a strong security notion. Specifically, the adversary can adaptively corrupt some users’ secret keys, and can adaptively request searchable ciphertexts of related keywords under different public keys as well as trapdoors of related keywords under different secret keys. We present two multi-user PEKS schemes both under simple assumptions in the standard model to achieve this strong security notion. Technically, our first scheme is a variation of the Lewko-Waters identity-based encryption scheme, and our second scheme is a variation of the Wee identity-based encryption scheme. However, we need to prove that the presented public key encryption schemes are secure in the multi-user, multi-challenge setting under adaptive corruptions. We modify the dual system encryption methodology to meet the goal. In particular, the security loss is constant.
KW - Searchable encryption
KW - keyword search
KW - multi-user setting
KW - public key encryption
KW - tight security
UR - https://www.scopus.com/pages/publications/85192175820
U2 - 10.1007/978-3-031-57728-4_4
DO - 10.1007/978-3-031-57728-4_4
M3 - 会议稿件
AN - SCOPUS:85192175820
SN - 9783031577277
T3 - Lecture Notes in Computer Science
SP - 105
EP - 126
BT - Public-Key Cryptography - PKC 2024 - 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
A2 - Tang, Qiang
A2 - Teague, Vanessa
PB - Springer Science and Business Media Deutschland GmbH
T2 - 27th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2024
Y2 - 15 April 2024 through 17 April 2024
ER -