{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:30Z","timestamp":1759638630246,"version":"3.37.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319769523"},{"type":"electronic","value":"9783319769530"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-76953-0_26","type":"book-chapter","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T03:13:36Z","timestamp":1520306016000},"page":"491-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Regularly Lossy Functions and\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Yu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baodong","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,7]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03356-8_3","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J Alwen","year":"2009","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 36\u201354. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03356-8_3"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14496-7_1","volume-title":"Information Theoretic Security","author":"J Alwen","year":"2010","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Survey: leakage resilience and the bounded retrieval model. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 1\u201318. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14496-7_1"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","author":"A Akavia","year":"2009","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474\u2013495. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00457-5_28"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random Oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 335\u2013359. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85174-5_19"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14623-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"Z Brakerski","year":"2010","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 1\u201320. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14623-7_1"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-85174-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision Diffie-Hellman. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 108\u2013125. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85174-5_7"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0055735","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Halevi, S., Sahai, A., Vadhan, S.: Many-to-one trapdoor functions and their relation to public-key cryptosystems. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 283\u2013298. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0055735"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-319-63697-9_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"X Boyen","year":"2017","unstructured":"Boyen, X., Li, Q.: All-but-many lossy trapdoor functions from lattices and applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 298\u2013331. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63697-9_11"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-13708-2_3","volume-title":"Applied Cryptography and Network Security","author":"X Boyen","year":"2010","unstructured":"Boyen, X., Waters, B.: Shrinking the keys of discrete-log-type lossy trapdoor functions. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 35\u201352. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13708-2_3"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45\u201364. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-46035-7_4"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-17373-8_35","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Y Dodis","year":"2010","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Efficient public-key cryptography in the presence of key leakage. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 613\u2013631. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17373-8_35"},{"issue":"1","key":"26_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"26_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s00145-011-9112-3","volume":"26","author":"DM Freeman","year":"2013","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More constructions of lossy and correlation-secure trapdoor functions. J. Cryptol. 26(1), 39\u201374 (2013)","journal-title":"J. Cryptol."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-74143-5_31","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D Hofheinz","year":"2007","unstructured":"Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 553\u2013571. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74143-5_31"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-38348-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Hazay","year":"2013","unstructured":"Hazay, C., L\u00f3pez-Alt, A., Wee, H., Wichs, D.: Leakage-resilient cryptography from minimal assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 160\u2013176. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38348-9_10"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-25385-0_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"B Hemenway","year":"2011","unstructured":"Hemenway, B., Libert, B., Ostrovsky, R., Vergnaud, D.: Lossy encryption: constructions from general assumptions and efficient selective opening chosen ciphertext security. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 70\u201388. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25385-0_4"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-642-30057-8_37","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"B Hemenway","year":"2012","unstructured":"Hemenway, B., Ostrovsky, R.: Extended-DDH and lossy trapdoor functions. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 627\u2013643. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-30057-8_37"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-29011-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Hofheinz","year":"2012","unstructured":"Hofheinz, D.: All-but-many lossy trapdoor functions. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 209\u2013227. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29011-4_14"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-38348-9_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D Hofheinz","year":"2013","unstructured":"Hofheinz, D.: Circular chosen-ciphertext security with compact ciphertexts. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 520\u2013536. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38348-9_31"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-28628-8_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K Kurosawa","year":"2004","unstructured":"Kurosawa, K., Desmedt, Y.: A new paradigm of hybrid encryption scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 426\u2013442. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-28628-8_26"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-13190-5_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"E Kiltz","year":"2010","unstructured":"Kiltz, E., Mohassel, P., O\u2019Neill, A.: Adaptive trapdoor functions and chosen-ciphertext security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 673\u2013692. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5_34"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-662-53641-4_6","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2016","unstructured":"Komargodski, I.: Leakage resilient one-way functions: the auxiliary-input setting. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 139\u2013158. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53641-4_6"},{"issue":"3","key":"26_CR24","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s00145-016-9238-4","volume":"30","author":"E Kiltz","year":"2017","unstructured":"Kiltz, E., O\u2019Neill, A., Smith, A.D.: Instantiability of RSA-OAEP under chosen-plaintext attack. J. Cryptol. 30(3), 889\u2013919 (2017)","journal-title":"J. Cryptol."},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-01001-9_34","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"E Kiltz","year":"2009","unstructured":"Kiltz, E., Pietrzak, K., Stam, M., Yung, M.: A new randomness extraction paradigm for hybrid encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 590\u2013609. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-01001-9_34"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-642-10366-7_41","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"J Katz","year":"2009","unstructured":"Katz, J., Vaikuntanathan, V.: Signature schemes with bounded leakage resilience. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 703\u2013720. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10366-7_41"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-36095-4_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"S Liu","year":"2013","unstructured":"Liu, S., Weng, J., Zhao, Y.: Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 84\u2013100. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36095-4_6"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-13013-7_18","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"P Mol","year":"2010","unstructured":"Mol, P., Yilek, S.: Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 296\u2013311. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13013-7_18"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 18\u201335. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03356-8_2"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: STOC, pp. 187\u2013196 (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-42045-0_20","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"B Qin","year":"2013","unstructured":"Qin, B., Liu, S.: Leakage-resilient chosen-ciphertext secure public-key encryption from hash proof system and one-time lossy filter. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 381\u2013400. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-42045-0_20"},{"key":"26_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-54631-0_2","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"B Qin","year":"2014","unstructured":"Qin, B., Liu, S.: Leakage-flexible CCA-secure public-key encryption: simple construction and free of pairing. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 19\u201336. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54631-0_2"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"26_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"Theory of Cryptography","author":"A Rosen","year":"2009","unstructured":"Rosen, A., Segev, G.: Chosen-ciphertext security via correlated products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 419\u2013436. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00457-5_25"},{"key":"26_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-29011-4_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"H Wee","year":"2012","unstructured":"Wee, H.: Dual projective hashing and its applications \u2014 lossy trapdoor functions and more. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 246\u2013262. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29011-4_16"},{"key":"26_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-02937-5_13","volume-title":"Cryptology and Network Security","author":"H Xue","year":"2013","unstructured":"Xue, H., Li, B., Lu, X., Jia, D., Liu, Y.: Efficient lossy trapdoor functions based on subgroup membership assumptions. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol. 8257, pp. 235\u2013250. Springer, Cham (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-319-02937-5_13"},{"key":"26_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-662-53018-4_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Zhandry","year":"2016","unstructured":"Zhandry, M.: The magic of ELFs. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 479\u2013508. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53018-4_18"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-76953-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T03:27:22Z","timestamp":1520306842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-76953-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319769523","9783319769530"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-76953-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}