{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:40:03Z","timestamp":1771026003593,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642332715","type":"print"},{"value":"9783642332722","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33272-2_15","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T13:45:33Z","timestamp":1345643133000},"page":"235-252","source":"Crossref","is-referenced-by-count":27,"title":["Secure Keyword Search Using Bloom Filter with Specified Character Positions"],"prefix":"10.1007","author":[{"given":"Takanori","family":"Suga","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Nishide","sequence":"additional","affiliation":[]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","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. Journal of Cryptology\u00a021, 350\u2013391 (2008)","journal-title":"Journal of Cryptology"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-79104-1_6","volume-title":"Information Security Practice and Experience","author":"F. Bao","year":"2008","unstructured":"Bao, F., Deng, R.H., Ding, X., Yang, Y.: Private Query on Encrypted Data in Multi-user Settings. In: Chen, L., Mu, Y., Susilo, W. (eds.) ISPEC 2008. LNCS, vol.\u00a04991, pp. 71\u201385. Springer, Heidelberg (2008)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM\u00a013, 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"15_CR4","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., Di 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":"15_CR5","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. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 535\u2013554. Springer, Heidelberg (2007)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11496137_30","volume-title":"Applied Cryptography and Network Security","author":"Y.-C. Chang","year":"2005","unstructured":"Chang, Y.-C., Mitzenmacher, M.: Privacy Preserving Keyword Searches on Remote Encrypted Data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 442\u2013455. Springer, Heidelberg (2005)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1180405.1180417","volume-title":"Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006","author":"R. Curtmola","year":"2006","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 79\u201388. ACM, New York (2006)"},{"key":"15_CR8","unstructured":"Goh, E.J.: Secure indexes. Cryptology ePrint Archive, Report 2003\/216 (2003), \n                    \n                      http:\/\/eprint.iacr.org\/2003\/216\/"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-Hashing for Message Authentication. RFC 2104 (Informational) (February 1997)","DOI":"10.17487\/rfc2104"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Leach, P., Mealling, M., Salz, R.: RFC 4122: A universally unique identifier (UUID) URN namespace (2005)","DOI":"10.17487\/rfc4122"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., Lou, W.: Fuzzy keyword search over encrypted data in cloud computing. In: 2010 Proceedings of the IEEE INFOCOM, pp. 1\u20135 (March 2010)","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"15_CR12","unstructured":"NIST: Announcing the advanced encryption standards (AES). Federal Information Processing Standards Publication 197 (2001)"},{"key":"15_CR13","unstructured":"NIST: Announcing the secure hash standard. Federal Information Processing Standards Publication 180-2 (2002)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-15317-4_10","volume-title":"Security and Cryptography for Networks","author":"S. Sedghi","year":"2010","unstructured":"Sedghi, S., van Liesdonk, P., Nikova, S., Hartel, P., Jonker, W.: Searching Keywords with Wildcards on Encrypted Data. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol.\u00a06280, pp. 138\u2013153. Springer, Heidelberg (2010)"},{"key":"15_CR15","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the IEEE Symposium on Security and Privacy, S&P 2000, pp. 44\u201355 (2000)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-642-00887-0_43","volume-title":"Database Systems for Advanced Applications","author":"C. Watanabe","year":"2009","unstructured":"Watanabe, C., Arai, Y.: Privacy-Preserving Queries for a DAS Model Using Encrypted Bloom Filter. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol.\u00a05463, pp. 491\u2013495. Springer, Heidelberg (2009)"},{"key":"15_CR17","unstructured":"Waters, B.R., Balfanz, D., Durfee, G., Smetters, D.K.: Building an encrypted and searchable audit log. In: The 11th Annual Network and Distributed System Security Symposium (2004)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33272-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:01:43Z","timestamp":1620129703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33272-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332715","9783642332722"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33272-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}