{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:41:06Z","timestamp":1761324066510,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319462974"},{"type":"electronic","value":"9783319462981"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46298-1_17","type":"book-chapter","created":{"date-parts":[[2016,9,19]],"date-time":"2016-09-19T22:40:37Z","timestamp":1474324837000},"page":"251-265","source":"Crossref","is-referenced-by-count":15,"title":["An Efficient Secure Channel Free Searchable Encryption Scheme with Multiple Keywords"],"prefix":"10.1007","author":[{"given":"Tingting","family":"Wang","sequence":"first","affiliation":[]},{"given":"Man Ho","family":"Au","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","volume":"21","author":"M Abdalla","year":"2008","unstructured":"Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J. Cryptology 21(3), 350\u2013391 (2008)","journal-title":"J. Cryptology"},{"key":"17_CR2","series-title":"Lecture Notes In Computer Science","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/978-3-540-69839-5_96","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"J Baek","year":"2008","unstructured":"Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with keyword search revisited. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008. LNCS, vol. 5072, pp. 1249\u20131259. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-69839-5_96"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-36288-6_7","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Boldyreva, A., Staddon, J.: Randomness re-use in multi-recipient encryption schemeas. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 85\u201399. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36288-6_7"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J. (eds.) [7], pp. 223\u2013238","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J. (eds.) [7], pp. 506\u2013522","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"17_CR6","series-title":"Lecture Notes In Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44647-8_13"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2004","year":"2004","unstructured":"Cachin, C., Camenisch, J.L. (eds.): EUROCRYPT 2004. LNCS, vol. 3027. Springer, Heidelberg (2004)"},{"issue":"5","key":"17_CR8","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"issue":"1","key":"17_CR9","first-page":"25","volume":"10","author":"G Chunxiang","year":"2010","unstructured":"Chunxiang, G., Zhu, Y.: New efficient searchable encryption schemes from bilinear pairings. I. J. Netw. Secur. 10(1), 25\u201331 (2010)","journal-title":"I. J. Netw. Secur."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-73489-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"YH Hwang","year":"2007","unstructured":"Hwang, Y.H., Lee, P.J.: Public key encryption with conjunctive keyword search and its extension to a multi-user system. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 2\u201322. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73489-5_2"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-45664-3_4","volume-title":"Public Key Cryptography","author":"K Kurosawa","year":"2002","unstructured":"Kurosawa, K.: Multi-recipient public-key encryption with shortened ciphertext. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 48\u201363. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45664-3_4"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Li, M., Yu, S., Cao, N., Lou, W.: Authorized private keyword search over encrypted data in cloud computing. In: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, 20\u201324 June 2011, pp. 383\u2013392. IEEE Computer Society (2011)","DOI":"10.1109\/ICDCS.2011.55"},{"issue":"1","key":"17_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/TPDS.2012.97","volume":"24","author":"M Li","year":"2013","unstructured":"Li, M., Shucheng, Y., Zheng, Y., Ren, K., Lou, W.: Scalable and secure sharing of personal health records in cloud computing using attribute-based encryption. IEEE Trans. Parallel Distrib. Syst. 24(1), 131\u2013143 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.future.2014.10.014","volume":"52","author":"J Liu","year":"2015","unstructured":"Liu, J., Huang, X., Liu, J.K.: Secure sharing of personal health records in cloud computing: ciphertext-policy attribute-based signcryption. Future Gener. Comp. Syst. 52, 67\u201376 (2015)","journal-title":"Future Gener. Comp. Syst."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"L\u00f6hr, H., Sadeghi, A.-R., Winandy, M.: Securing the e-health cloud. In: Veinot, T.C., \u00c7ataly\u00fcrek, \u00dc.V., Luo, G., Andrade, H., Smalheiser, N.R. (eds.) Proceedings of the ACM International Health Informatics Symposium, IHI 2010, Arlington, VA, USA, 11\u201312 November 2010, pp. 220\u2013229. ACM (2010)","DOI":"10.1145\/1882992.1883024"},{"key":"17_CR16","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, 14\u201317 May 2000, pp. 44\u201355. IEEE Computer Society (2000)"},{"key":"17_CR17","series-title":"Lecture Notes In Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-15546-8_7","volume-title":"Secure Data Management","author":"P Liesdonk","year":"2010","unstructured":"Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., Jonker, W.: Computationally efficient searchable symmetric encryption. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2010. LNCS, vol. 6358, pp. 87\u2013100. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15546-8_7"},{"key":"17_CR18","unstructured":"Waters, B.R., Balfanz, D., Durfee, G., Smetters, D.K.: Building an encrypted and searchable audit log. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2004, San Diego, California, USA. The Internet Society (2004)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F Zhang","year":"2004","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme from bilinear pairings and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277\u2013290. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24632-9_20"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46298-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:11:57Z","timestamp":1498331517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46298-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319462974","9783319462981"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46298-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}