{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:38:16Z","timestamp":1743082696418,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811358258"},{"type":"electronic","value":"9789811358265"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-5826-5_43","type":"book-chapter","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T05:07:57Z","timestamp":1548306477000},"page":"554-562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Inverted Index Based Ranked Keyword Search in Multi-user Searchable Encryption"],"prefix":"10.1007","author":[{"given":"Manju S.","family":"Nair","sequence":"first","affiliation":[]},{"given":"M. S.","family":"Rajasree","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,24]]},"reference":[{"issue":"2","key":"43_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"JA Akinyele","year":"2013","unstructured":"Akinyele, J.A., et al.: Charm: a framework for rapidly prototyping cryptosystems. J. Cryptogr. Eng. 3(2), 111\u2013128 (2013). \n                  https:\/\/doi.org\/10.1007\/s13389-013-0057-3","journal-title":"J. Cryptogr. Eng."},{"key":"43_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., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). \n                  https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"issue":"3","key":"43_CR3","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 J. Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"43_CR4","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. 3531, pp. 442\u2013455. Springer, Heidelberg (2005). \n                  https:\/\/doi.org\/10.1007\/11496137_30"},{"issue":"5","key":"43_CR5","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J., 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."},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing gentry\u2019s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129\u2013148. Springer, Heidelberg (2011). \n                  https:\/\/doi.org\/10.1007\/978-3-642-20465-4_9"},{"issue":"3","key":"43_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM (JACM) 43(3), 431\u2013473 (1996)","journal-title":"J. ACM (JACM)"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965\u2013976. ACM (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"43_CR9","unstructured":"Lynn, B.: PBC Library (2006). \n                  http:\/\/crypto.stanford.edu\/pbc"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Naveed, M., Prabhakaran, M., Gunter, C., et al.: Dynamic searchable encryption via blind storage. In: 2014 IEEE Symposium on Security and Privacy (SP), pp. 639\u2013654. IEEE (2014)","DOI":"10.1109\/SP.2014.47"},{"key":"43_CR11","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the 2000 IEEE Symposium on Security and Privacy, S&P 2000, pp. 44\u201355. IEEE (2000)"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Wang, B., Song, W., Lou, W., Hou, Y.T.: Inverted index based multi-keyword public-key searchable encryption with strong privacy guarantee. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 2092\u20132100. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218594"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Wang, C., Cao, N., Li, J., Ren, K., Lou, W.: Secure ranked keyword search over encrypted cloud data. In: 2010 IEEE 30th International Conference on Distributed Computing Systems (ICDCS), pp. 253\u2013262. IEEE (2010)","DOI":"10.1109\/ICDCS.2010.34"},{"issue":"3","key":"43_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2730906","volume":"21","author":"DJ Wu","year":"2015","unstructured":"Wu, D.J.: Fully homomorphic encryption: cryptography\u2019s holy grail. XRDS Crossroads ACM Mag. Students 21(3), 24\u201329 (2015)","journal-title":"XRDS Crossroads ACM Mag. Students"}],"container-title":["Communications in Computer and Information Science","Security in Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-5826-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:54:08Z","timestamp":1558396448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-5826-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811358258","9789811358265"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-5826-5_43","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Security in Computing and Communication","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangalore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sscc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acn-conference.org\/sscc2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}