DocumentCode
1703156
Title
Fully Secure Anonymous Identity-Based Encryption under Simple Assumptions
Author
Ren, Yanli ; Wang, Shuozhong ; Zhang, Xinpeng ; Qian, Zhenxing
Author_Institution
Sch. of Commun. & Inf. Eng., Shanghai Univ., Shanghai, China
fYear
2010
Firstpage
428
Lastpage
432
Abstract
Anonymous identity-based encryption systems can be used to protect users´ privacy and construct Public key Encryption with Keyword Search (PEKS) schemes where the ciphertext does not leak the identity of the recipient. Currently, there is no anonymous IBE scheme that is fully secure under simple assumptions without random oracles. In this paper, we propose an anonymous IBE scheme using the approach of Dual System Encryption. The scheme is fully secure without random oracles based on decisional bilinear Diffie-Hellman (BDH) and linear assumptions, and the security reduction is tight. These two assumptions are simple and our scheme is more secure than the previous anonymous IBE schemes.
Keywords
data privacy; public key cryptography; anonymous IBE scheme; decisional bilinear Diffie-Hellman; dual system encryption; fully secure anonymous identity-based encryption systems; keyword search schemes; public key encryption; simple assumptions; users privacy protection; Complexity theory; Encryption; Games; Identity-based encryption; anonymous; fully secure; identity-based encryption; simple assumptions; without random oracles;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Information Networking and Security (MINES), 2010 International Conference on
Conference_Location
Nanjing, Jiangsu
Print_ISBN
978-1-4244-8626-7
Electronic_ISBN
978-0-7695-4258-4
Type
conf
DOI
10.1109/MINES.2010.96
Filename
5671013
Link To Document