Stronger Security Model for Public-Key Encryption with Equality Test

Author(s):  
Yao Lu ◽  
Rui Zhang ◽  
Dongdai Lin
Author(s):  
Guomin Yang ◽  
Chik How Tan ◽  
Qiong Huang ◽  
Duncan S. Wong

2019 ◽  
Vol 500 ◽  
pp. 15-33 ◽  
Author(s):  
Hyung Tae Lee ◽  
San Ling ◽  
Jae Hong Seo ◽  
Huaxiong Wang

2020 ◽  
Vol 113 (1) ◽  
pp. 313-335
Author(s):  
Rashad Elhabob ◽  
Yanan Zhao ◽  
Alzubair Hassan ◽  
Hu Xiong

2016 ◽  
Vol 59 (11) ◽  
pp. 1689-1694 ◽  
Author(s):  
Hyung Tae Lee ◽  
San Ling ◽  
Jae Hong Seo ◽  
Huaxiong Wang

2019 ◽  
Vol 30 (04) ◽  
pp. 647-664
Author(s):  
Libing Wu ◽  
Yubo Zhang ◽  
Kim-Kwang Raymond Choo ◽  
Debiao He

Online social networking applications have become more and more popular in the advance of the technological age. Much of our personal information has been disclosed in social networking activities and privacy-preserving still remains a research challenge in social network. Public key encryption scheme with equality test(PKEET), which is an extension of public key encryption with keyword search (PEKS), seems to be a solution. PKEET enables the tester to check whether two given ciphertexts are derived from the same plaintext. Recently, Zhu et al. proposed a pairing-free public key encryption scheme with equality test based on the traditional public key cryptosystem. However, it suffers from certificates management issue. In this paper, we propose a pairing-free identity-based encryption scheme with authorized equality test(PF-IBEAET). The PF-IBEAET scheme also provides fine-grained authorizations. We prove that the scheme is one way secure against chosen identity and chosen ciphertext attack (OW-ID-CCA) and indistinguishable against chosen-identity and chosen-ciphertext attack (IND-ID-CCA) in the random oracle model (ROM). Performance analysis shows that the scheme achieves a better performance than similar schemes.


2020 ◽  
Vol 510 ◽  
pp. 16-32 ◽  
Author(s):  
Yunhao Ling ◽  
Sha Ma ◽  
Qiong Huang ◽  
Ximing Li ◽  
Yunzhi Ling

2019 ◽  
Vol 30 (04) ◽  
pp. 619-633
Author(s):  
Burong Kang ◽  
Xinyu Meng ◽  
Lei Zhang ◽  
Yinxia Sun

Most of the existing cryptographic schemes, e.g., key agreement protocol, call for good randomness. Otherwise, the security of these cryptographic schemes cannot be fully guaranteed. Nonce-based cryptosystem is recently introduced to improve the security of public key encryption and digital signature schemes by ensuring security when randomness fails. In this paper, we first investigate the security of key agreement protocols when randomness fails. Then we define the security model for nonce-based key agreement protocols and propose a nonce-based key agreement protocol that protects against bad randomness. The new protocol is proven to be secure in our proposed security model.


Sign in / Sign up

Export Citation Format

Share Document