{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:46:02Z","timestamp":1752461162524},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596075"},{"type":"electronic","value":"9783319596082"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59608-2_12","type":"book-chapter","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T15:29:56Z","timestamp":1497367796000},"page":"219-238","source":"Crossref","is-referenced-by-count":5,"title":["Parallel and Dynamic Structured Encryption"],"prefix":"10.1007","author":[{"given":"Russell W. F.","family":"Lai","sequence":"first","affiliation":[]},{"given":"Sherman S. M.","family":"Chow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-17373-8_33","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M Chase","year":"2010","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577\u2013594. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-17373-8_33"},{"issue":"5","key":"12_CR2","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., Encryption, S.S.: Improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"key":"12_CR3","unstructured":"Goh, E.-J.: Secure Indexes. Cryptology ePrint Archive, Report 2003\/216"},{"issue":"3","key":"12_CR4","doi-asserted-by":"crossref","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 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Hahn, F., Kerschbaum, F.: Searchable encryption with secure and efficient updates. In: ACM Conference on Computer and Communications Security (CCS), pp. 310\u2013320 (2014)","DOI":"10.1145\/2660267.2660297"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Financial Cryptography, pp. 258\u2013274 (2013)","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: ACM Conference on Computer and Communications Security (CCS), pp. 965\u2013976 (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Lai, R., Chow, S.: Structured encryption with non-interactive updates and parallel traversal. In: IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 776\u2013777 (2015)","DOI":"10.1109\/ICDCS.2015.104"},{"key":"12_CR9","unstructured":"Leskovec, J., Krevl, A., Datasets, S.: Stanford Large Network Dataset Collection, June 2014. \nhttp:\/\/snap.stanford.edu\/data"},{"issue":"3","key":"12_CR10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1145\/765568.765571","volume":"50","author":"BA Reed","year":"2003","unstructured":"Reed, B.A.: The height of a random binary search tree. J. ACM 50(3), 306\u2013332 (2003)","journal-title":"J. ACM"},{"key":"12_CR11","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44\u201355 (2000)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Wang, B., Hou, Y., Li, M., Wang, H., Li, H.: Maple: scalable multi-dimensional range search over encrypted cloud data with tree-based index. In: ASIACCS, pp. 111\u2013122 (2014)","DOI":"10.1145\/2590296.2590305"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Wang, Q., He, M., Du, M., Chow, S.S.M., Lai, R.W.F., Zou, Q.: Searchable encryption over feature-rich data. IEEE Trans. Depend. Secure Comput. (to appear). doi:\n10.1109\/TDSC.2016.2593444","DOI":"10.1109\/TDSC.2016.2593444"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59608-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T15:35:07Z","timestamp":1497368107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59608-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596075","9783319596082"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59608-2_12","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2017]]}}}