Adaptive-ID Secure Revocable Identity-Based Encryption from Lattices via Subset Difference Method

被引:16
作者
Cheng, Shantian [1 ]
Zhang, Juanyang [1 ]
机构
[1] Nanyang Technol Univ, Sch Phys & Math Sci, Div Math Sci, Singapore 637371, Singapore
来源
INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2015 | 2015年 / 9065卷
关键词
Revocable identity-based encryption; Lattices; Subset difference method; Adaptive security; Standard model;
D O I
10.1007/978-3-319-17533-1_20
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In view of the expiration or reveal of user's private credential (or private key) in a realistic scenario, identity-based encryption (IBE) schemes with an efficient key revocation mechanism, or for short, revocable identity-based encryption (RIBE) schemes, become prominently significant. In this paper, we present an RIBE scheme from lattices by combining two Agrawal et al.'s IBE schemes with the subset difference (SD) method. Our scheme is secure against adaptive identity-time attacks in the standard model under the learning with errors (LWE) assumption. In particular, our scheme serves as one solution to the challenge posed by Chen et al. (ACISP'12).
引用
收藏
页码:283 / 297
页数:15
相关论文
共 27 条
[1]  
Agrawal S, 2012, LECT NOTES COMPUT SC, V7293, P280, DOI 10.1007/978-3-642-30057-8_17
[2]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[3]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6110, P553
[4]  
Ajtai M., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P1
[5]   Generating Shorter Bases for Hard Random Lattices [J].
Alwen, Joel ;
Peikert, Chris .
THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) :535-553
[6]  
[Anonymous], EFFICIENT LATTICE H
[7]  
[Anonymous], ADAPTIVE ID SECURE R
[8]  
[Anonymous], 2014132 CRYPT EPRINT
[9]  
Boldyreva A, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P417
[10]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223