[1] Shamir A.Identity-based cryptosystems and signature schemes[C]//CRYPTO 1984.California: Springer,1985: 47-53.[2] Boneh D,Franklin M.Identity-based encryption from the weil pairing[C]//CRYPTO 2001.California: Springer,2001: 213-229.[3] Boyen X,Waters B.Anonymous hierarchical identity-based encryption (without random oracles)[C]//CRYPTO 2006.California: Springer,2006: 290-307.[4] Gentry C.Practical identity-based encryption without random oracles[C]//EUROCRYPT 2006.Petersburg: Springer,2006: 445-464.[5] Ren Yanli,Wang Shuozhong,Zhang Xinpeng,et al.Fully secure anonymous identity-based encryption under simpleassumptions[C]//MINES 2010.Nanjing: IEEE Press,2010: 428-432.[6] 任艳丽,谷大武,王朔中,等.标准模型中基于身份的匿名加密方案[J].中国科学技术大学学报,2012,42(4): 296-301.Ren Yanli,Gu Dawu,Wang Shuozhong,et al.Anonymous identity-based encryption schemes[J].Journal of University of Science and Technology of China,2012,42(4): 296-301.[7] Freeman D.Converting pairing-based cryptosystems from composite-order groups to prime-order groups[C]//EUROCRYPT 2010.French Riviera: Springer,2010: 44-61.[8] Ducas L.Anonymity from asymmetry: new constructions for anonymous HIBE[C]//CT-RSA'10.San Francisco: Springer,2010: 148-164.[9] Waters B.Efficient identity-based encryption without random oracles[C]//EUROCRYPT 2005.Aarhus: Springer,2005: 114-127.[10] Barreto P,Naehrig M.Pairing-friendly elliptic curves of prime order[C]//SAC 2005.New Mexico: Springer,2006: 319-331. |