{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:47:43Z","timestamp":1748580463686},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00453-019-00576-7","type":"journal-article","created":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T17:02:40Z","timestamp":1563469360000},"page":"3245-3390","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation"],"prefix":"10.1007","volume":"81","author":[{"given":"Pratish","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ratna","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"key":"576_CR1","doi-asserted-by":"crossref","unstructured":"Abusalah, H., Fuchsbauer, G.: Constrained PRFs for unbounded inputs with short keys. In: Applied Cryptography and Network Security\u2014ACNS 2016, pp. 445\u2013463. Springer (2016)","DOI":"10.1007\/978-3-319-39555-5_24"},{"key":"576_CR2","doi-asserted-by":"crossref","unstructured":"Abusalah, H., Fuchsbauer, G., Pietrzak, K.: Constrained PRFs for unbounded inputs. In: Topics in Cryptology\u2014CT-RSA 2016, pp. 413\u2013428. Springer (2016)","DOI":"10.1007\/978-3-319-29485-8_24"},{"key":"576_CR3","doi-asserted-by":"crossref","unstructured":"Ananth, P., Chen, Y.C., Chung, K.M., Lin, H., Lin, W.K.: Delegating RAM computations with adaptive soundness and privacy. In: Theory of Cryptography Conference\u2014TCC 2016-B, pp. 3\u201330. Springer (2016)","DOI":"10.1007\/978-3-662-53644-5_1"},{"key":"576_CR4","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: Advances in Cryptology\u2014CRYPTO 2015, pp. 308\u2013326. Springer (2015)","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"576_CR5","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation from functional encryption for simple functions. Cryptology ePrint Archive, Report 2015\/730 (2015)","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"576_CR6","doi-asserted-by":"crossref","unstructured":"Ananth, P., Sahai, A.: Functional encryption for turing machines. In: Theory of Cryptography Conference\u2014TCC 2016, pp. 125\u2013153. Springer (2016)","DOI":"10.1007\/978-3-662-49096-9_6"},{"key":"576_CR7","doi-asserted-by":"crossref","unstructured":"Ananth, P., Sahai, A.: Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps. In: Advances in Cryptology\u2014EUROCRYPT 2017, pp. 152\u2013181. Springer (2017)","DOI":"10.1007\/978-3-319-56620-7_6"},{"key":"576_CR8","unstructured":"Apon, D., D\u00f6ttling, N., Garg, S., Mukherjee, P.: Cryptanalysis of indistinguishability obfuscations of circuits over GGH13. In: International Colloquium on Automata, Languages, and Programming\u2014ICALP 2017, vol.\u00a080, pp. 38:1\u201338:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"576_CR9","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Bootstrapping obfuscators via fast pseudorandom functions. In: Advances in Cryptology\u2014ASIACRYPT 2014, pp. 162\u2013172. Springer (2014)","DOI":"10.1007\/978-3-662-45608-8_9"},{"key":"576_CR10","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K., Stevens, S.: Key-homomorphic constrained pseudorandom functions. In: Theory of Cryptography Conference\u2014TCC 2015, pp. 31\u201360. Springer (2015)","DOI":"10.1007\/978-3-662-46497-7_2"},{"key":"576_CR11","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Innovations in Theoretical Computer Science\u2014ITCS 2012, pp. 326\u2013349. ACM (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"576_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Symposium on Theory of Computing\u2014STOC 2015, pp. 439\u2013448. ACM (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"576_CR13","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. In: Foundations of Computer Science\u2014FOCS 2015, pp. 171\u2013190. IEEE (2015)","DOI":"10.1109\/FOCS.2015.20"},{"key":"576_CR14","doi-asserted-by":"crossref","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Lattice-based snargs and their application to more efficient obfuscation. In: Advances in Cryptology\u2014EUROCRYPT 2017, pp. 247\u2013277. Springer (2017)","DOI":"10.1007\/978-3-319-56617-7_9"},{"key":"576_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lewi, K., Wu, D.J.: Constraining pseudorandom functions privately. In: Public-Key Cryptography\u2014PKC 2017, pp. 494\u2013524. Springer (2017)","DOI":"10.1007\/978-3-662-54388-7_17"},{"key":"576_CR16","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Advances in Cryptology\u2014ASIACRYPT 2013, pp. 280\u2013300. Springer (2013)","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"576_CR17","doi-asserted-by":"crossref","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Advances in Cryptology\u2014CRYPTO 2014, pp. 480\u2013499. Springer (2014)","DOI":"10.1007\/978-3-662-44371-2_27"},{"key":"576_CR18","doi-asserted-by":"crossref","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Computer and Communications Security\u2014CCS 2017, pp. 1465\u20131482. ACM (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"576_CR19","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Public-Key Cryptography\u2014PKC 2014, pp. 501\u2013519. Springer (2014)","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"576_CR20","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Tsabary, R., Vaikuntanathan, V., Wee, H.: Private constrained PRFs (and more) from LWE. In: Theory of Cryptography Conference\u2014TCC 2017, pp. 264\u2013302. Springer (2017)","DOI":"10.1007\/978-3-319-70500-2_10"},{"key":"576_CR21","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Constrained key-homomorphic PRFs from standard lattice assumptions. In: Theory of Cryptography Conference\u2014TCC 2015, pp. 1\u201330. Springer (2015)","DOI":"10.1007\/978-3-662-46497-7_1"},{"key":"576_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Raykova, M.: Adaptive succinct garbled RAM or: How to delegate your database. In: Theory of Cryptography Conference\u2014TCC 2016, pp. 61\u201390. Springer (2016)","DOI":"10.1007\/978-3-662-53644-5_3"},{"key":"576_CR23","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J.: Fully succinct garbled ram. In: Innovations in Theoretical Computer Science\u2014ITCS 2016, pp. 169\u2013178. ACM (2016)","DOI":"10.1145\/2840728.2840765"},{"key":"576_CR24","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Theory of Cryptography Conference\u2014TCC 2015, pp. 468\u2013497. Springer (2015)","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"576_CR25","unstructured":"Chandran, N., Raghuraman, S., Vinayagamurthy, D.: Constrained pseudorandom functions: verifiable and delegatable. Cryptology ePrint Archive, Report 2014\/522 (2014)"},{"key":"576_CR26","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Fouque, P.A., Lee, C., Minaud, B., Ryu, H.: Cryptanalysis of the new CLT multilinear map over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2016, pp. 509\u2013536. Springer (2016)","DOI":"10.1007\/978-3-662-49890-3_20"},{"key":"576_CR27","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Han, K., Lee, C., Ryu, H., Stehl\u00e9, D.: Cryptanalysis of the multilinear map over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2015, pp. 3\u201312. Springer (2015)","DOI":"10.1007\/978-3-662-46800-5_1"},{"issue":"A","key":"576_CR28","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1112\/S1461157016000371","volume":"19","author":"JH Cheon","year":"2016","unstructured":"Cheon, J.H., Jeong, J., Lee, C.: An algorithm for ntru problems and cryptanalysis of the ggh multilinear map without a low-level encoding of zero. LMS J. Comput. Math. 19(A), 255\u2013266 (2016)","journal-title":"LMS J. Comput. Math."},{"key":"576_CR29","doi-asserted-by":"crossref","unstructured":"Coron, J.S., Lee, M.S., Lepoint, T., Tibouchi, M.: Zeroizing attacks on indistinguishability obfuscation over clt13. In: Public-Key Cryptography\u2014PKC 2017, pp. 41\u201358. Springer (2017)","DOI":"10.1007\/978-3-662-54365-8_3"},{"key":"576_CR30","doi-asserted-by":"crossref","unstructured":"Datta, P., Dutta, R., Mukhopadhyay, S.: Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation. In: Public-Key Cryptography\u2014PKC 2017, pp. 463\u2013493. Springer (2017)","DOI":"10.1007\/978-3-662-54388-7_16"},{"key":"576_CR31","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Koppula, V., Waters, B.: Constrained pseudorandom functions for unconstrained inputs. In: Advances in Cryptology\u2014EUROCRYPT 2016, pp. 124\u2013153. Springer (2016)","DOI":"10.1007\/978-3-662-49896-5_5"},{"key":"576_CR32","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Koppula, V., Waters, B.: Constrained pseudorandom functions for unconstrained inputs. Cryptology ePrint Archive, Report 2016\/301 (2016)","DOI":"10.1007\/978-3-662-49896-5_5"},{"key":"576_CR33","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G.: Constrained verifiable random functions. In: Security and Cryptography for Networks\u2014SCN 2014, pp. 95\u2013114. Springer (2014)","DOI":"10.1007\/978-3-319-10879-7_7"},{"key":"576_CR34","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Konstantinov, M., Pietrzak, K., Rao, V.: Adaptive security of constrained PRFs. In: Advances in Cryptology\u2014ASIACRYPT 2014, pp. 82\u2013101. Springer (2014)","DOI":"10.1007\/978-3-662-45608-8_5"},{"key":"576_CR35","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: Foundations of Computer Science\u2014FOCS 2013, pp. 40\u201349. IEEE (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"576_CR36","doi-asserted-by":"crossref","unstructured":"Garg, S., Miles, E., Mukherjee, P., Sahai, A., Srinivasan, A., Zhandry, M.: Secure obfuscation in a weak multilinear map model. In: Theory of Cryptography Conference\u2014TCC 2016, pp. 241\u2013268. Springer (2016)","DOI":"10.1007\/978-3-662-53644-5_10"},{"key":"576_CR37","doi-asserted-by":"crossref","unstructured":"Gentry, C., Lewko, A.B., Sahai, A., Waters, B.: Indistinguishability obfuscation from the multilinear subgroup elimination assumption. In: Foundations of Computer Science\u2014FOCS 2015, pp. 151\u2013170. IEEE (2015)","DOI":"10.1109\/FOCS.2015.19"},{"key":"576_CR38","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Symposium on Theory of Computing\u2014STOC 2011, pp. 99\u2013108. ACM (2011)","DOI":"10.1145\/1993636.1993651"},{"issue":"4","key":"576_CR39","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM (JACM) 33(4), 792\u2013807 (1986)","journal-title":"J. ACM (JACM)"},{"key":"576_CR40","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: Theory of Cryptography Conference\u2014TCC 2010, pp. 308\u2013326. Springer (2010)","DOI":"10.1007\/978-3-642-11799-2_19"},{"key":"576_CR41","doi-asserted-by":"crossref","unstructured":"Goyal, V., Jain, A., Koppula, V., Sahai, A.: Functional encryption for randomized functionalities. In: Theory of Cryptography Conference\u2014TCC 2015, pp. 325\u2013351. Springer (2015)","DOI":"10.1007\/978-3-662-46497-7_13"},{"key":"576_CR42","unstructured":"Hofheinz, D., Kamath, A., Koppula, V., Waters, B.: Adaptively secure constrained pseudorandom functions. Cryptology ePrint Archive, Report 2014\/720 (2014)"},{"key":"576_CR43","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Adaptively secure puncturable pseudorandom functions in the standard model. In: Advances in Cryptology\u2014ASIACRYPT 2015, pp. 79\u2013102. Springer (2015)","DOI":"10.1007\/978-3-662-48797-6_4"},{"key":"576_CR44","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Replacing a random oracle: Full domain hash from indistinguishability obfuscation. In: Advances in Cryptology\u2014EUROCRYPT 2014, pp. 201\u2013220. Springer (2014)","DOI":"10.1007\/978-3-642-55220-5_12"},{"key":"576_CR45","doi-asserted-by":"crossref","unstructured":"Hu, Y., Jia, H.: Cryptanalysis of GGH map. In: Advances in Cryptology\u2014EUROCRYPT 2016, pp. 537\u2013565. Springer (2016)","DOI":"10.1007\/978-3-662-49890-3_21"},{"key":"576_CR46","doi-asserted-by":"crossref","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Innovations in Theoretical Computer Science\u2014ITCS 2015, pp. 163\u2013172. ACM (2015)","DOI":"10.1145\/2688073.2688105"},{"key":"576_CR47","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Pandey, O., Sahai, A.: Public-coin differing-inputs obfuscation and its applications. In: Theory of Cryptography Conference\u2014TCC 2015, pp. 668\u2013697. Springer (2015)","DOI":"10.1007\/978-3-662-46497-7_26"},{"key":"576_CR48","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Computer and Communications Security\u2014CCS 2013, pp. 669\u2013684. ACM (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"576_CR49","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for turing machines with unbounded memory. In: Symposium on Theory of Computing\u2014STOC 2015, pp. 419\u2013428. ACM (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"576_CR50","doi-asserted-by":"crossref","unstructured":"Lin, H.: Indistinguishability obfuscation from constant-degree graded encoding schemes. In: Advances in Cryptology\u2014EUROCRYPT 2016, pp. 28\u201357. Springer (2016)","DOI":"10.1007\/978-3-662-49890-3_2"},{"key":"576_CR51","doi-asserted-by":"crossref","unstructured":"Lin, H., Tessaro, S.: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. In: Advances in Cryptology\u2014CRYPTO 2017, pp. 630\u2013660. Springer (2017)","DOI":"10.1007\/978-3-319-63688-7_21"},{"key":"576_CR52","doi-asserted-by":"crossref","unstructured":"Lin, H., Vaikuntanathan, V.: Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings. In: Foundations of Computer Science\u2014FOCS 2016, pp. 11\u201320. IEEE (2016)","DOI":"10.1109\/FOCS.2016.11"},{"key":"576_CR53","doi-asserted-by":"crossref","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Attribute-based signatures. In: Topics in Cryptology\u2014CT-RSA 2011, pp. 376\u2013392. Springer (2011)","DOI":"10.1007\/978-3-642-19074-2_24"},{"key":"576_CR54","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: Foundations of Computer Science\u2014FOCS 1999, pp. 120\u2013130. IEEE (1999)"},{"key":"576_CR55","doi-asserted-by":"crossref","unstructured":"Miles, E., Sahai, A., Zhandry, M.: Annihilation attacks for multilinear maps: cryptanalysis of indistinguishability obfuscation over GGH13. In: Advances in Cryptology\u2014CRYPTO 2016, pp. 629\u2013658. Springer (2016)","DOI":"10.1007\/978-3-662-53008-5_22"},{"key":"576_CR56","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Pietrzak, K., Waters, B., Wichs, D.: New realizations of somewhere statistically binding hashing and positional accumulators. In: Advances in Cryptology\u2014ASIACRYPT 2015, pp. 121\u2013145. Springer (2015)","DOI":"10.1007\/978-3-662-48797-6_6"},{"issue":"4","key":"576_CR57","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/TCC.2014.2353053","volume":"2","author":"T Okamoto","year":"2014","unstructured":"Okamoto, T., Takashima, K.: Efficient attribute-based signatures for non-monotone predicates in the standard model. IEEE Trans. Cloud Comput. 2(4), 409\u2013421 (2014)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"576_CR58","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Symposium on Theory of Computing\u2014STOC 2014, pp. 475\u2013484. ACM (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"576_CR59","doi-asserted-by":"crossref","unstructured":"Sakai, Y., Attrapadung, N., Hanaoka, G.: Attribute-based signatures for circuits from bilinear map. In: Public-Key Cryptography\u2014PKC 2016, pp. 283\u2013300. Springer (2016)","DOI":"10.1007\/978-3-662-49384-7_11"},{"key":"576_CR60","doi-asserted-by":"crossref","unstructured":"Tang, F., Li, H., Liang, B.: Attribute-based signatures for circuits from multilinear maps. In: Information Security\u2014IS 2014, pp. 54\u201371. Springer (2014)","DOI":"10.1007\/978-3-319-13257-0_4"},{"key":"576_CR61","doi-asserted-by":"crossref","unstructured":"Waters, B.: A punctured programming approach to adaptively secure functional encryption. In: Advances in Cryptology\u2014CRYPTO 2015, pp. 678\u2013697. Springer (2015)","DOI":"10.1007\/978-3-662-48000-7_33"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00576-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00576-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00576-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T23:27:42Z","timestamp":1589585262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00576-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,17]]},"references-count":61,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["576"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00576-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,17]]},"assertion":[{"value":"15 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}