[1] Boneh D, Di C G, Ostrovsky R, et al. Public Key Encryption with Keyword Search [C]//Lecture Notes in Computer Science: 3027. Berlin: Springer-Verlag, 2004: 506-522.
[2] Boneh D, Franklin M. Identity-based Encryption from the Weil Pairing [C]//Lecture Notes in Computer Science: 2139. Berlin: Springer-Verlag, 2001: 213-229.
[3] Blazy O, Kiltz E, Pan J X. (Hierarchical) Identity-based Encryption from Affine Message Authentication [C]//Lecture Notes in Computer Science: 8617. Berlin: Springer-Verlag, 2014: 408-425.
[4] Lai J Z, Deng R H, Liu S L, et al. Identity-based Encryption Secure Against Selective Opening Chosen-ciphertext Attack [C]//Lecture Notes in Computer Science: 8441. Berlin: Springer-Verlag, 2014: 77-92.
[5] Chen J, Wee H. Fully, (almost) Tightly Secure IBE and Dual System Groups [C]//Lecture Notes in Computer Science: 8043. Berlin:Springer-Verlag, 2013: 435-460.
[6] Boneh D, Waters B. Conjunctive, Subset, and Range Queries on Encrypted Data [C]//Lecture Notes in Computer Science: 4392. Berlin: Springer-Verlag, 2007: 535-554.
[7] Zhang B, Zhang F G. An Efficient Public Key Encryption with Conjunctive-subset Keywords Search [J]. Journal of Network and Computer Applications, 2011, 34(1): 262-267.
[8] Kawai Y, Takashima K. Predicate-and Attribute-hiding Inner Product Encryption in a Public Key Setting [C]//Lecture Notes in Computer Science: 8365. Berlin: Springer-Verlag, 2013: 113-130.
[9] Bosch C, Hartel P, Jonker W, et al. A Survey of Provably Secure Searchable Encryption [J]. ACM Computing Surveys, 2014, 47(2): 03600300. |