PKE-AET: Public Key Encryption with Authorized Equality Test

被引:81
作者
Huang, Kaibin [1 ]
Tso, Raylin [1 ]
Chen, Yu-Chi [2 ]
Rahman, Sk Md Mizanur [3 ]
Almogren, Ahmad [4 ]
Alamri, Atif [3 ]
机构
[1] Natl Chengchi Univ, Dept Comp Sci, Taipei 11623, Taiwan
[2] Acad Sinica, Inst Informat Sci, Taipei, Taiwan
[3] King Saud Univ, Coll Comp & Informat Sci, Dept Informat Syst, Res Chair Pervas & Mobile Comp, Riyadh, Saudi Arabia
[4] King Saud Univ, Coll Comp & Informat Sci, Dept Comp Sci, Res Chair Pervas & Mobile Comp, Riyadh, Saudi Arabia
关键词
authorization; equality test; multi-user setting; searchable encryption; SEARCHABLE ENCRYPTION; PAIRINGS;
D O I
10.1093/comjnl/bxv025
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a new notion of public key encryption scheme with authorized equality test (PKE-AET), which allows authorized users those who have warrants to test the equivalence between two messages, where the messages are encrypted using different public keys. Comparing with the existing researches, our PKE-AET provides two kinds of warrants that are referred to as receiver's warrants and cipher-warrants. The proposed PKE-AET is able to deal with the following complicated scenario: Assume that a receiver authorizes a receiver's warrant to a tester, which makes the tester be able to perform equality test on all of receivers' ciphertext; on the other hand, if receiver authorizes a cipher-warrant corresponding to a specific ciphertext to the tester, then the tester only acquires the equality test on that particular ciphertext. The equality between two ciphertexts can be verified by the tester without decryption after he or she receives two warrants and varies their validations. Moreover, for security analysis, we define two types of adversaries and security notions for PKE-AET in the multi-user setting. Furthermore, we prove that our PKE-AET is one-way CCA secure against type-I adversaries and IND-CCA secure against type-II adversaries. Finally, the proposed scheme leads better efficiency than most of previous equality test schemes.
引用
收藏
页码:2686 / 2697
页数:12
相关论文
共 18 条
[1]  
[Anonymous], 1993, ACM CCS 1993, DOI DOI 10.1145/168588.168596
[2]  
Barker E., 2014, RECOMMENDATION KEY 2
[3]  
Bellare M, 2000, LECT NOTES COMPUT SC, V1807, P259
[4]  
Bellare M., 1994, ADV CRYPTOLOGY EUROC, V950, P92, DOI [10.1007/BFb0053428, DOI 10.1007/BFB0053428]
[5]  
Bellare M, 2007, LECT NOTES COMPUT SC, V4622, P535
[6]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[7]  
Canard S., 2012, PLAINTEXT CHECKABLE, P332
[8]   On cryptographic protocols employing asymmetric pairings - The role of Ψ revisited [J].
Chatterjee, Sanjit ;
Menezes, Alfred .
DISCRETE APPLIED MATHEMATICS, 2011, 159 (13) :1311-1322
[9]  
Fuhr T, 2007, LECT NOTES COMPUT SC, V4784, P228
[10]   Pairings for cryptographers [J].
Galbraith, Steven D. ;
Paterson, Kenneth G. ;
Smart, Nigel P. .
DISCRETE APPLIED MATHEMATICS, 2008, 156 (16) :3113-3121