A fully secure identity-based encryption scheme against chosen-ciphertext attack

Pairing-Free Identity-Based Encryption with Authorized Equality Test in Online Social Networks

International Journal of Foundations of Computer Science ◽

10.1142/s0129054119400185 ◽

2019 ◽

Vol 30 (04) ◽

pp. 647-664

Author(s):

Libing Wu ◽

Yubo Zhang ◽

Kim-Kwang Raymond Choo ◽

Debiao He

Keyword(s):

Social Networking ◽

Online Social Networks ◽

Keyword Search ◽

Public Key ◽

Encryption Scheme ◽

Public Key Encryption ◽

Identity Based Encryption ◽

Identity Based ◽

Equality Test ◽

Chosen Ciphertext Attack

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.

Download Full-text

Research on Identity-Based Encryption Scheme for Grid Computing System

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.543-547.3156 ◽

2014 ◽

Vol 543-547 ◽

pp. 3156-3159

Author(s):

Qing Hai Bai ◽

Ying Zheng ◽

Qing Hu Wang ◽

Guo Li Wei ◽

Hai Chun Zhao ◽

...

Keyword(s):

Grid Computing ◽

Data Transmission ◽

Computing System ◽

Grid Service ◽

Encryption Scheme ◽

Grid System ◽

Identity Based Encryption ◽

Diffie Hellman ◽

Long Run ◽

Identity Based

Grid system has secure requirements of confidential communication, data integrity and non-repudiation. According to the secure requirements for Grid service, the paper proposed an identity-based encryption scheme for Grid, which can solve a series of problem: the privacy of data transmission, validation of integrity of data, key update after long run time and non-repudiation. The scheme is constructed by bilinear paring on elliptic cures and its security can be reduced to the computational Bilinear Diffie-Hellman assumption. Finally, the authors analyses the security and efficiency of this scheme.

Download Full-text