{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T03:38:52Z","timestamp":1768966732717,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662490952","type":"print"},{"value":"9783662490969","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,12,19]],"date-time":"2015-12-19T00:00:00Z","timestamp":1450483200000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49096-9_8","type":"book-chapter","created":{"date-parts":[[2015,12,18]],"date-time":"2015-12-18T05:45:05Z","timestamp":1450417505000},"page":"176-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Order-Revealing Encryption and the Hardness of Private Learning"],"prefix":"10.1007","author":[{"given":"Mark","family":"Bun","sequence":"first","affiliation":[]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,19]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-11799-2_26","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2010","unstructured":"Beimel, A., Kasiviswanathan, S.P., Nissim, K.: Bounds on the sample complexity for private learning and private data release. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 437\u2013454. Springer, Heidelberg (2010)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-40328-6_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"A Beimel","year":"2013","unstructured":"Beimel, A., Nissim, K., Stemmer, U.: Private learning and sanitization: pure vs. approximate differential privacy. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) RANDOM 2013 and APPROX 2013. LNCS, vol. 8096, pp. 363\u2013378. Springer, Heidelberg (2013)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. In: FOCS (2015)","DOI":"10.1109\/FOCS.2015.20"},{"issue":"5","key":"8_CR4","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1137\/S009753979223455X","volume":"23","author":"A Blum","year":"1994","unstructured":"Blum, A.: Separating distribution-free and mistake-bound learning models over the Boolean domain. SIAM J. Comput. 23(5), 990\u20131000 (1994). \n                      http:\/\/dx.doi.org\/10.1137\/S009753979223455X","journal-title":"SIAM J. Comput."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the SuLQ framework. In: PODS, pp. 128\u2013138 (2005)","DOI":"10.1145\/1065167.1065184"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC, pp. 609\u2013618 (2008)","DOI":"10.1145\/1374376.1374464"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-22792-9_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A Boldyreva","year":"2011","unstructured":"Boldyreva, A., Chenette, N., O\u2019Neill, A.: Order-preserving encryption revisited: improved security analysis and alternative solutions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 578\u2013595. Springer, Heidelberg (2011)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/978-3-662-46803-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"D Boneh","year":"2015","unstructured":"Boneh, D., Lewi, K., Raykova, M., Sahai, A., Zhandry, M., Zimmerman, J.: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 563\u2013594. Springer, Heidelberg (2015)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 573\u2013592. Springer, Heidelberg (2006)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014)"},{"key":"8_CR11","unstructured":"Bost, R., Popa, R.A., Tu, S., Goldwasser, S.: Machine learning classification over encrypted data. IACR Cryptology ePrint Archive 2014:331 (2014). \n                      http:\/\/eprint.iacr.org\/2014\/331"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-662-46497-7_12","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2015","unstructured":"Brakerski, Z., Segev, G.: Function-private functional encryption in the private-key setting. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 306\u2013324. Springer, Heidelberg (2015)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Bun, M., Nissim, K., Stemmer, U., Vadhan, S.P.: Differentially private release and learning of threshold functions. In: Foundations of Computer Science, FOCS 2015, 18\u201320 October 2015, Berkeley, CA, USA, pp. 634\u2013649 (2015)","DOI":"10.1109\/FOCS.2015.45"},{"key":"8_CR14","unstructured":"Bun, M., Ullman, J., Vadhan, S.P.: Fingerprinting codes and the price of approximate differential privacy. In: Symposium on Theory of Computing, STOC 2014, May 31 - June 03, 2014, New York, NY, USA, pp. 1\u201310 (2014)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, K., Thaler, J., Ullman, J., Wan, A.: Faster private release of marginals on small databases. In: ITCS 2014 (2014)","DOI":"10.1145\/2554797.2554833"},{"key":"8_CR16","unstructured":"Chaudhuri, K., Hsu, D.: Sample complexity bounds for differentially private learning. In: Kakade, S.M., von Luxburg, U. (eds.) COLT, JMLR Proceedings, vol. 19, pp. 155\u2013186. JMLR.org (2011)"},{"key":"8_CR17","unstructured":"Chaudhuri, K., Hsu, D., Song, S.: The large margin mechanism for differentially private maximization. In: Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 8\u201313 December 2014, Montreal, Quebec, Canada, pp. 1287\u20131295 (2014)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing Traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G.N., Vadhan, S.P.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: STOC, pp. 381\u2013390 (2009)","DOI":"10.1145\/1536414.1536467"},{"key":"8_CR22","unstructured":"Dwork, C., Nikolov, A., Talwar, K.: Using convex relaxations for efficiently and privately releasing marginals. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, SOCG 2014, pp. 261:261\u2013261:270. ACM, New York (2014). \n                      http:\/\/doi.acm.org\/10.1145\/2582112.2582123"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.P.: Boosting and differential privacy. In: FOCS, pp. 51\u201360 (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"8_CR24","unstructured":"Feldman, V., Kanade, V.: Computational bounds on statistical query learning. In: The 25th Annual Conference on Learning Theory, COLT 2012, 25\u201327 June 2012, Edinburgh, Scotland, pp. 16.1-16.22 (2012). \n                      http:\/\/www.jmlr.org\/proceedings\/papers\/v23\/feldman12a\/feldman12a.pdf"},{"key":"8_CR25","unstructured":"Feldman, V., Xiao, D.: Sample complexity bounds on differentially private learning via communication complexity. CoRR abs\/1402.6278 (2014)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013)"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: Proceedings of FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Zhandry, M.: Fully secure functional encryption without obfuscation (2014)","DOI":"10.1007\/978-3-662-49099-0_18"},{"key":"8_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser, S., Gordon, S.D., Goyal, V., Jain, A., Katz, J., Liu, F.-H., Sahai, A., Shi, E., Zhou, H.-S.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014)"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-37682-5_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"T Graepel","year":"2013","unstructured":"Graepel, T., Lauter, K., Naehrig, M.: ML confidential: machine learning on encrypted data. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 1\u201321. Springer, Heidelberg (2013)"},{"issue":"3","key":"8_CR32","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2220357.2220358","volume":"59","author":"J Groth","year":"2012","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: New techniques for noninteractive zero-knowledge. J. ACM 59(3), 11:1\u201311:35 (2012). \n                      http:\/\/doi.acm.org\/10.1145\/2220357.2220358","journal-title":"J. ACM"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-28914-9_19","volume-title":"Theory of Cryptography","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 339\u2013356. Springer, Heidelberg (2012)"},{"key":"8_CR34","unstructured":"Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release. In: NIPS, pp. 2348\u20132356 (2012)"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for privacy-preserving data analysis. In: FOCS, pp. 61\u201370 (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N., Servedio, R.A.: Private data release via learning thresholds. In: SODA, pp. 168\u2013187 (2012)","DOI":"10.1137\/1.9781611973099.15"},{"issue":"3","key":"8_CR37","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/090756090","volume":"40","author":"SP Kasiviswanathan","year":"2011","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? SIAM J. Comput. 40(3), 793\u2013826 (2011)","journal-title":"SIAM J. Comput."},{"key":"8_CR38","unstructured":"Katz, J., Koo, C.Y.: On constructing universal one-way hash functions from arbitrary one-way functions. IACR Cryptology ePrint Archive 2005, p. 328 (2005)"},{"issue":"6","key":"8_CR39","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"M Kearns","year":"1998","unstructured":"Kearns, M.: Efficient noise-tolerant learning from statistical queries. J. ACM 45(6), 983\u20131006 (1998). \n                      http:\/\/doi.acm.org\/10.1145\/293347.293351","journal-title":"J. ACM"},{"issue":"1","key":"8_CR40","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns, M., Valiant, L.: Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM 41(1), 67\u201395 (1994). \n                      http:\/\/doi.acm.org\/10.1145\/174644.174647","journal-title":"J. ACM"},{"issue":"3","key":"8_CR41","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1006\/jcss.1995.1046","volume":"50","author":"M Kharitonov","year":"1995","unstructured":"Kharitonov, M.: Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution. J. Comput. Syst. Sci. 50(3), 600\u2013610 (1995). \n                      http:\/\/dx.doi.org\/10.1006\/jcss.1995.1046","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 94\u2013103. IEEE Computer Society, Washington, DC (2007). \n                      http:\/\/dx.doi.org\/10.1109\/FOCS.2007.41","DOI":"10.1109\/FOCS.2007.41"},{"key":"8_CR43","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 33\u201343. ACM, New York (1989). \n                      http:\/\/doi.acm.org\/10.1145\/73007.73011"},{"key":"8_CR44","unstructured":"Nissim, K.: Personal communication, July 2014"},{"key":"8_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-29011-4_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"O Pandey","year":"2012","unstructured":"Pandey, O., Rouselakis, Y.: Property preserving symmetric encryption. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 375\u2013391. Springer, Heidelberg (2012)"},{"issue":"4","key":"8_CR46","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM 35(4), 965\u2013984 (1988). \n                      http:\/\/doi.acm.org\/10.1145\/48014.63140","journal-title":"J. ACM"},{"key":"8_CR47","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 387\u2013394. ACM, New York (1990). \n                      http:\/\/doi.acm.org\/10.1145\/100216.100269"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Roth, A., Roughgarden, T.: Interactive privacy via the median mechanism. In: STOC, pp. 765\u2013774 (2010)","DOI":"10.1145\/1806689.1806794"},{"issue":"1","key":"8_CR49","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1999.1666","volume":"60","author":"RA Servedio","year":"2000","unstructured":"Servedio, R.A.: Computational sample complexity and attribute-efficient learning. J. Comput. Syst. Sci. 60(1), 161\u2013178 (2000). \n                      http:\/\/dx.doi.org\/10.1006\/jcss.1999.1666","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"8_CR50","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/S0097539704412910","volume":"33","author":"RA Servedio","year":"2004","unstructured":"Servedio, R.A., Gortler, S.J.: Equivalences and separations between quantum and classical learnability. SIAM J. Comput. 33(5), 1067\u20131092 (2004). \n                      http:\/\/dx.doi.org\/10.1137\/S0097539704412910","journal-title":"SIAM J. Comput."},{"key":"8_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1007\/978-3-642-31594-7_68","volume-title":"Automata, Languages, and Programming","author":"J Thaler","year":"2012","unstructured":"Thaler, J., Ullman, J., Vadhan, S.: Faster algorithms for privately releasing marginals. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 810\u2013821. Springer, Heidelberg (2012)"},{"key":"8_CR52","doi-asserted-by":"crossref","unstructured":"Ullman, J.: Answering \n                      \n                        \n                      \n                      $$n^{2+o(1)}$$\n                     counting queries with differential privacy is hard. In: STOC, pp. 361\u2013370 (2013)","DOI":"10.1145\/2488608.2488653"},{"key":"8_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-19571-6_24","volume-title":"Theory of Cryptography","author":"J Ullman","year":"2011","unstructured":"Ullman, J., Vadhan, S.: PCPs and the hardness of generating private synthetic data. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 400\u2013416. Springer, Heidelberg (2011)"},{"issue":"11","key":"8_CR54","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984). \n                      http:\/\/doi.acm.org\/10.1145\/1968.1972","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49096-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T20:03:24Z","timestamp":1578513804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49096-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,19]]},"ISBN":["9783662490952","9783662490969"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49096-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,19]]},"assertion":[{"value":"19 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}