{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:31:56Z","timestamp":1771705916752,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642003059","type":"print"},{"value":"9783642003066","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00306-6_11","type":"book-chapter","created":{"date-parts":[[2009,2,17]],"date-time":"2009-02-17T06:15:44Z","timestamp":1234851344000},"page":"145-159","source":"Crossref","is-referenced-by-count":19,"title":["An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data"],"prefix":"10.1007","author":[{"given":"Peishun","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/11602897_35","volume-title":"Information and Communications Security","author":"L. Ballard","year":"2005","unstructured":"Ballard, L., Kamara, S., Monrose, F.: Achieving Efficient Conjunctive Keyword Searches over Encrypted Data. In: Qing, S., Mao, W., L\u00f3pez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol.\u00a03783, pp. 414\u2013426. Springer, Heidelberg (2005)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, Subset, and Range Queries on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 535\u2013554. Springer, Heidelberg (2007)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-77026-8_21","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"G.D. Crescenzo","year":"2007","unstructured":"Crescenzo, G.D., Saraswat, V.: Public Key Encryption with Searchable Keywords Based on Jacobi Symbols. In: Srinathan, K., Pandu Rangan, C., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 282\u2013296. Springer, Heidelberg (2007)"},{"key":"11_CR5","first-page":"79","volume-title":"ACM CCS 2006","author":"R. Curtmola","year":"2007","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: ACM CCS 2006, pp. 79\u201388. ACM Press, New York (2007)"},{"key":"11_CR6","unstructured":"Goh, E.-J.: Secure indexes. In: Cryptology ePrint Archive, Report, 2003\/216 (February 25, 2004), \n                    \n                      http:\/\/eprint.iacr.org\/2003\/216\/"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-24852-1_3","volume-title":"Applied Cryptography and Network Security","author":"P. Golle","year":"2004","unstructured":"Golle, P., Staddon, J., Waters, B.: Secure Conjunctive Search over Encrypted Data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 31\u201345. Springer, Heidelberg (2004)"},{"key":"11_CR8","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":"Y.H. 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.\u00a04575, pp. 2\u201322. Springer, Heidelberg (2007)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-76900-2_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"A. Kiayias","year":"2007","unstructured":"Kiayias, A., Tsiounis, Y., Yung, M.: Group Encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 181\u2013199. Springer, Heidelberg (2007)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-46588-1_30","volume-title":"Public Key Cryptography","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting Cryptographic Key Sizes. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 446\u2013465. Springer, Heidelberg (2000)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-60865-6_45","volume-title":"Fast Software Encryption","author":"K. Nyberg","year":"1996","unstructured":"Nyberg, K.: Fast accumulated hashing. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 83\u201387. Springer, Heidelberg (1996)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems based on Composite Degree Residue Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11537878_14","volume-title":"Trust, Privacy, and Security in Digital Business","author":"H.A. Park","year":"2005","unstructured":"Park, H.A., Byun, J.W., Lee, D.H.: Secure Index Search for Groups. In: Katsikas, S.K., L\u00f3pez, J., Pernul, G. (eds.) TrustBus 2005. LNCS, vol.\u00a03592, pp. 128\u2013140. Springer, Heidelberg (2005)"},{"key":"11_CR14","unstructured":"Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 44\u201355 (May 2000)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-75248-6_8","volume-title":"Secure Data Management","author":"P. Wang","year":"2007","unstructured":"Wang, P., Wang, H., Pieprzyk, J.: Common Secure Index for Conjunctive Keyword-Based Retrieval over Encrypted Data. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2007. LNCS, vol.\u00a04721, pp. 108\u2013123. Springer, Heidelberg (2007)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-77048-0_8","volume-title":"Information and Communications Security","author":"P. Wang","year":"2007","unstructured":"Wang, P., Wang, H., Pieprzyk, J.: A New Dynamic Accumulator for Batch Updates. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol.\u00a04861, pp. 98\u2013112. Springer, Heidelberg (2007)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-540-77566-9_56","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"P. Wang","year":"2008","unstructured":"Wang, P., Wang, H., Pieprzyk, J.: Threshold Privacy Preserving Keyword Searches. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 646\u2013658. Springer, Heidelberg (2008)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-540-89641-8_13","volume-title":"CANS 2008","author":"P. Wang","year":"2008","unstructured":"Wang, P., Wang, H., Pieprzyk, J.: Keyword Field-free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups. In: Franklin, M.K., Hui, L.C.K., Wang, D.S. (eds.) CANS 2008. LNCS, vol.\u00a05339, pp. 178\u2013195. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00306-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T04:55:42Z","timestamp":1551761742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00306-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642003059","9783642003066"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00306-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}