scholarly journals A Multivariate Public Key Encryption Scheme With Equality Test

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 75463-75472
Author(s):  
Xiaoying Shen ◽  
Licheng Wang ◽  
Huijun Zhu ◽  
Yuan Liu
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.


IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 12702-12713 ◽  
Author(s):  
Yan Xu ◽  
Ming Wang ◽  
Hong Zhong ◽  
Jie Cui ◽  
Lu Liu ◽  
...  

2017 ◽  
Vol 2017 ◽  
pp. 1-6
Author(s):  
Yuan Ping ◽  
Baocang Wang ◽  
Yuehua Yang ◽  
Shengli Tian

Multivariate public key cryptography is a set of cryptographic schemes built from the NP-hardness of solving quadratic equations over finite fields, amongst which the hidden field equations (HFE) family of schemes remain the most famous. However, the original HFE scheme was insecure, and the follow-up modifications were shown to be still vulnerable to attacks. In this paper, we propose a new variant of the HFE scheme by considering the special equation x2=x defined over the finite field F3 when x=0,1. We observe that the equation can be used to further destroy the special structure of the underlying central map of the HFE scheme. It is shown that the proposed public key encryption scheme is secure against known attacks including the MinRank attack, the algebraic attacks, and the linearization equations attacks. The proposal gains some advantages over the original HFE scheme with respect to the encryption speed and public key size.


Sign in / Sign up

Export Citation Format

Share Document