{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:11:55Z","timestamp":1771697515887,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540752479","type":"print"},{"value":"9783540752486","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75248-6_8","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T15:20:40Z","timestamp":1189005640000},"page":"108-123","source":"Crossref","is-referenced-by-count":18,"title":["Common Secure Index for Conjunctive Keyword-Based Retrieval over 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":"8_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., Lopez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol.\u00a03783, pp. 414\u2013426. Springer, Heidelberg (2005)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"N. Baric","year":"1997","unstructured":"Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 480\u2013494. Springer, Heidelberg (1997)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"J. Benaloh","year":"1994","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 274\u2013285. Springer, Heidelberg (1994)"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM Journal of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal of Computing"},{"key":"8_CR5","unstructured":"Boneh, D., Waters, B.: Conjunctive, Subset, and Range Queries on Encrypted Data. Cryptology ePrint Archive, Report 2006\/287"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","first-page":"199","volume-title":"Advances in Cryptology 1981\u2013 1997","author":"D. Chaum","year":"1999","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981\u2013 1997. LNCS, vol.\u00a01440, pp. 199\u2013203. Springer, Heidelberg (1999)"},{"key":"8_CR8","unstructured":"Goh, E.-J.: Secure indexes. In: Cryptology ePrint Archive, Report 2003\/216, (February 25, 2004), See \n                      http:\/\/eprint.iacr.org\/2003\/216\/"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"8_CR10","series-title":"Lecture Notes in Computer Science","first-page":"223","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":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Lopez, J., Pernul, G. (eds.) TrustBus 2005. LNCS, vol.\u00a03592, pp. 128\u2013140. Springer, Heidelberg (2005)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"Shamir, A.: On the Generation of Cryptographically Strong Pseudorandom Sequences. ACM Transaction on Computer Systems\u00a01(1), 38\u201344 (1983)","journal-title":"ACM Transaction on Computer Systems"},{"key":"8_CR13","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)"}],"container-title":["Lecture Notes in Computer Science","Secure Data Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75248-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T02:08:10Z","timestamp":1676686090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-75248-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752479","9783540752486"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75248-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}