{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:50:32Z","timestamp":1771573832544,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,20]],"date-time":"2015-03-20T00:00:00Z","timestamp":1426809600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10623-015-0048-8","type":"journal-article","created":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T06:07:18Z","timestamp":1426745238000},"page":"261-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Polly Cracker, revisited"],"prefix":"10.1007","volume":"79","author":[{"given":"Martin R.","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pooya","family":"Farshim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gottfried","family":"Herold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,20]]},"reference":[{"key":"48_CR1","unstructured":"Albrecht M., Perry J.: F4\/5. CoRR, arXiv:1006.4933v2 (2010)."},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Farshim P., Faug\u00e8re J.-C., Perret L.: Polly Cracker, revisited. In: Advances in Cryptology-ASIACRYPT 2011. Lecture Notes in Computer Science, vol. 7073, pp. 179\u2013196. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-25385-0_10"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum B., Cash D., Peikert C., Sahai A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Advances in Cryptography-CRYPTO 2009. Lecture Notes in Computer Science, vol. 5677, pp. 595\u2013618. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Arora S., Ge R.: New algorithms for learning in presence of errors. In: Aceto L., Henzinger M., Sgall J. (eds.) ICALP (1). Lecture Notes in Computer Science, vol. 6755, pp. 403\u2013415. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"48_CR5","unstructured":"Ars G.: Applications des bases de Gr\u00f6bner \u00e0 la cryptographie. Ph.D. thesis, Universit\u00e8 de Rennes I (2005)."},{"key":"48_CR6","unstructured":"Bard G.V., Courtois N.T., Jefferson C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers. Cryptology ePrint Archive, Report 2007\/024 (2007). http:\/\/eprint.iacr.org\/2007\/024 ."},{"key":"48_CR7","unstructured":"Bardet M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. Ph.D. thesis, Universit\u00e9 Paris VI (2004)."},{"key":"48_CR8","unstructured":"Bardet M., Faug\u00e8re J.-C., Salvy B.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: International Conference on Polynomial System Solving\u2014ICPSS, pp. 71\u201375 (2004)."},{"key":"48_CR9","unstructured":"Bardet M., Faug\u00e8re J.-C., Salvy B., Yang B.-Y.: Asymptotic expansion of the degree of regularity for semi-regular systems of equations. In: Gianni P. (ed.) The Effective Methods in Algebraic Geometry Conference, Mega 2005, pp. 1\u201314 (2005)."},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Barkee B., Can D.C., Ecks J., Moriarty T., Ree R.F.: Why you cannot even hope to use Gr\u00f6bner bases in public key cryptography: an open letter to a scientist who failed and a challenge to those who have not yet failed. J. Symb. Comput. 18(6), 497\u2013501 (1994).","DOI":"10.1006\/jsco.1994.1061"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Bayer D., Stillman M.: On the complexity of computing syzygies. In: Computational Aspects of Commutative Algebra, pp. 1\u201313. Academic Press, New York (1988).","DOI":"10.1016\/S0747-7171(88)80039-7"},{"key":"48_CR12","unstructured":"Becker T., Weispfenning V.: Gr\u00f6bner Bases\u2014A Computational Approach to Commutative Algebra. Springer, Berlin (1991)."},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Bellare M., Rogaway P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Advances in Cryptology-EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 4004, pp. 409\u2013426. Springer, Berlin (2006).","DOI":"10.1007\/11761679_25"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Bellare M., Ristenpart T., Tessaro S.: Multi-instance security and its application to password-based cryptography. In: Safavi-Naini R., Canetti R. (eds.) Advances in Cryptology-CRYPTO 2012\u2014Proceedings of the 32nd Annual Cryptology Conference, Santa Barbara, CA, August 19\u201323, 2012. Lecture Notes in Computer Science, vol. 7417, pp. 312\u2013329. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-32009-5_19"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Berbain C., Gilbert H., Patarin J.: QUAD: a multivariate stream cipher with provable security. J. Symb. Comput. 44(12), 1703\u20131723 (2009).","DOI":"10.1016\/j.jsc.2008.10.004"},{"key":"48_CR16","unstructured":"Brakerski Z.: When homomorphism becomes a liability. Cryptology ePrint Archive, Report 2012\/225. http:\/\/eprint.iacr.org\/ (2012)."},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser S. (ed.) ITCS, pp. 309\u2013325. ACM, New York (2012).","DOI":"10.1145\/2090236.2090262"},{"key":"48_CR18","unstructured":"Brakerski Z., Vaikuntanathan V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 97\u2013106. IEEE (2011)."},{"key":"48_CR19","unstructured":"Buchberger B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Ph.D. thesis, Universit\u00e4t Innsbruck (1965)."},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Buchberger B.: Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory. In: Bose N.K. (ed.) Multidimensional Systems Theory. Reidel Publishing Company, Dordrecht (1985).","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"48_CR21","doi-asserted-by":"crossref","unstructured":"Buchberger B.: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symb. Comput. 41(3\u20134), 475\u2013511 (2006).","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"48_CR22","unstructured":"Bulygin S.: Chosen-ciphertext attack on noncommutative Polly Cracker. CoRR, arXiv:abs\/cs\/0508015 (2005)."},{"key":"48_CR23","doi-asserted-by":"crossref","unstructured":"Caboara M., Caruso F., Traverso C.: Lattice Polly Cracker cryptosystems. J. Symb. Comput. 46, 534\u2013549 (2011).","DOI":"10.1016\/j.jsc.2010.10.004"},{"key":"48_CR24","doi-asserted-by":"crossref","unstructured":"Chen Y., Nguyen P.Q.: Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT. Lecture Notes in Computer Science, vol. 7237, pp. 502\u2013519. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-29011-4_30"},{"key":"48_CR25","unstructured":"Cohn H., Heninger N.: Approximate common divisors via lattices. Cryptology ePrint Archive, Report 2011\/437. http:\/\/eprint.iacr.org\/ (2011)."},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Coron J.-S., Mandal A., Naccache D., Tibouchi M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway P. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 6841, pp. 487\u2013504. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"48_CR27","doi-asserted-by":"crossref","unstructured":"Coron J.-S., Naccache D., Tibouchi M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. Cryptology ePrint Archive, Report 2011\/440. http:\/\/eprint.iacr.org\/ (2011).","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"48_CR28","doi-asserted-by":"crossref","unstructured":"Courtois N.T., Pieprzyk J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng Y. (ed.) Advances in Cryptology-ASIACRYPT 2002. Lecture Notes in Computer Science, vol. 2501, pp. 267\u2013287. Springer, Berlin (2002).","DOI":"10.1007\/3-540-36178-2_17"},{"key":"48_CR29","unstructured":"Cox D., Little J., O\u2019Shea D.: Ideals, Varieties, and Algorithms, 3rd edn. Springer, Berlin (2005)."},{"key":"48_CR30","doi-asserted-by":"crossref","unstructured":"Cramer R., Shoup V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33, 167\u2013226 (2003).","DOI":"10.1137\/S0097539702403773"},{"key":"48_CR31","doi-asserted-by":"crossref","unstructured":"Dickenstein A., Fitchas N., Giusti M., Sessa C.: The membership problem for unmixed polynomial ideals is solvable in single exponential time. Discret. Appl. Math. 33(1\u20133), 73\u201394 (1991).","DOI":"10.1016\/0166-218X(91)90109-A"},{"key":"48_CR32","unstructured":"dit Vehel F.L., Marinari M.G., Perret L., Traverso C.: A survey on Polly Cracker systems. In: Sala M., Mora T., Perret L., Sakata S., Traverso C. (eds.) Gr\u00f6bner Bases. Coding and Cryptography, pp. 285\u2013305. Springer, Berlin (2009)."},{"key":"48_CR33","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.-C.: A new efficient algorithm for computing Gr\u00f6bner basis (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999).","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"48_CR34","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383. ACM, New York (2002).","DOI":"10.1145\/780506.780516"},{"key":"48_CR35","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.-C., Gianni P.M., Lazard D., Mora T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16, 329\u2013344 (1993).","DOI":"10.1006\/jsco.1993.1051"},{"key":"48_CR36","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.-C., Joux A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gr\u00f6bner bases. In: Boneh D. (ed.) Advances in Cryptology-CRYPTO 2003. Lecture Notes in Computer Science, vol. 2729. Springer, Berlin (2003).","DOI":"10.1007\/978-3-540-45146-4_3"},{"key":"48_CR37","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.-C., Rahmany S.: Solving systems of polynomial equations with symmetries using SAGBI-Gr\u00f6bner bases. In: ISSAC \u201909: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201909, pp. 151\u2013158. ACM, New York (2009).","DOI":"10.1145\/1576702.1576725"},{"key":"48_CR38","doi-asserted-by":"crossref","unstructured":"Fellows M., Koblitz N.: Combinatorial cryptosystems galore! In: Mullen G.L., Shiue P.J.-S. (eds.) Finite Fields: Theory, Applications, and Algorithms. Contemporary Mathematics, vol. 168, pp. 51\u201361. AMS, New York (1994).","DOI":"10.1090\/conm\/168\/01688"},{"key":"48_CR39","doi-asserted-by":"crossref","unstructured":"Gentry C.: A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford University. http:\/\/crypto.stanford.edu\/craig (2009).","DOI":"10.1145\/1536414.1536440"},{"key":"48_CR40","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher M. (ed.) STOC, pp. 169\u2013178. ACM, New York (2009).","DOI":"10.1145\/1536414.1536440"},{"key":"48_CR41","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: Ostrovsky R. (ed.) FOCS, pp. 107\u2013109. IEEE (2011).","DOI":"10.1109\/FOCS.2011.94"},{"key":"48_CR42","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S.: Implementing Gentry\u2019s fully-homomorphic encryption scheme. In: Paterson K. (ed.) Advances in Cryptology-EUROCRYPT 2010. Lecture Notes in Computer Science, vol. 6632, pp. 129\u2013148. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"48_CR43","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S., Smart N.P.: Better bootstrapping in fully homomorphic encryption. In: Fischlin M., Buchmann J., Manulis M. (eds.) Public Key Cryptography-PKC 2012. Lecture Notes in Computer Science, vol. 7293. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"48_CR44","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S., Smart N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini R., Canetti R. (eds.) Advances in Cryptology-CRYPTO 2012\u2014Proceedings of the 32nd Annual Cryptology Conference, Santa Barbara, CA, 19\u201323 August, 2012. Lecture Notes in Computer Science, vol. 7417, pp. 850\u2013867. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"48_CR45","doi-asserted-by":"crossref","unstructured":"H\u00e5stad J., Phillips S., Safra S.: A well-characterized approximation problem. Inf. Process. Lett. 47, 301\u2013305 (1993).","DOI":"10.1016\/0020-0190(93)90076-L"},{"key":"48_CR46","doi-asserted-by":"crossref","unstructured":"Herold G.: Polly cracker, revisited, revisited. In: Public Key Cryptography-PKC 2012. Lecture Notes in Computer Science, vol. 7293, pp. 17\u201333. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-30057-8_2"},{"key":"48_CR47","doi-asserted-by":"crossref","unstructured":"Koblitz N., Menezes A.J., Yi-Hong W., Zuccherato R.J.: Algebraic Aspects of Cryptography. Springer, Berlin (1998).","DOI":"10.1007\/978-3-662-03642-6"},{"key":"48_CR48","unstructured":"Lazard D.: Gr\u00f6bner-bases, Gaussian elimination and resolution of systems of algebraic equations. In: Proceedings of the European Computer Algebra Conference on Computer Algebra. Lecture Notes in Computer Science, vol. 162. Springer, Berlin (1983)."},{"key":"48_CR49","doi-asserted-by":"crossref","unstructured":"Lindner R., Peikert C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias A. (ed.) CT-RSA. Lecture Notes in Computer Science, vol. 6558, pp. 319\u2013339. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"48_CR50","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V., Peikert C., Regev O.: On ideal lattices and learning with errors over rings. In: Gilbert H. (ed.) Advances in Cryptology-EUROCRYPT 2010. Lecture Notes in Computer Science, vol. 6110. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"48_CR51","doi-asserted-by":"crossref","unstructured":"Melchor C.A., Gaborit P., Herranz J.: Additively homomorphic encryption with $$d$$ d -operand multiplications. In: Advances in Cryptology-CRYPTO 2010. Lecture Notes in Computer Science, vol. 6223, pp. 138\u2013154. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-14623-7_8"},{"key":"48_CR52","doi-asserted-by":"crossref","unstructured":"Micciancio D., Regev O.: Lattice-based cryptography. In: Bernstein D.J., Buchmann J., Dahmen E. (eds.) Post-quantum Cryptography, pp. 147\u2013191. Springer, Berlin (2009).","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"48_CR53","doi-asserted-by":"crossref","unstructured":"Mora F.: De Nugis Groebnerialium 2: applying Macaulay\u2019s trick in order to easily write a Gr\u00f6bner basis. Appl. Algebra Eng. Commun. Comput. 13(6), 437\u2013446 (2003).","DOI":"10.1007\/s00200-002-0112-2"},{"key":"48_CR54","doi-asserted-by":"crossref","unstructured":"Naehrig M., Lauter K., Vaikuntanathan V.: Can homomorphic encryption be practical? In: Cachin C., Ristenpart T. (eds.) CCSW, pp. 113\u2013124. ACM, New York (2011).","DOI":"10.1145\/2046660.2046682"},{"key":"48_CR55","doi-asserted-by":"crossref","unstructured":"Peikert C., Vaikuntanathan V., Waters B.: A framework for efficient and composable oblivious transfer. In: Advances in Cryptology-CRYPTO 2008, pp. 554\u2013571. Springer, Berlin (2008).","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"48_CR56","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56, 34:1\u201334:40 (2009)."},{"key":"48_CR57","doi-asserted-by":"crossref","unstructured":"Regev O.: The learning with errors problem. In: IEEE Conference on Computational Complexity 2010, pp. 191\u2013204 (2010).","DOI":"10.1109\/CCC.2010.26"},{"key":"48_CR58","doi-asserted-by":"crossref","unstructured":"Rothblum R.: Homomorphic encryption: From private-key to public-key. In: Ishai Y. (ed.) TCC. Lecture Notes in Computer Science, vol. 6597, pp. 219\u2013234. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-19571-6_14"},{"key":"48_CR59","doi-asserted-by":"crossref","unstructured":"Sala M., Mora T., Perret L., Sakata S., Traverso C.: Gr\u00f6bner Bases, Coding, and Cryptography. Springer, Berlin (2009).","DOI":"10.1007\/978-3-540-93806-4"},{"key":"48_CR60","doi-asserted-by":"crossref","unstructured":"Smart N.P., Vercauteren F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen P.Q., Pointcheval D. (eds.) Public Key Cryptography. Lecture Notes in Computer Science, vol. 6056, pp. 420\u2013443. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"48_CR61","unstructured":"Stein W. et al.: SAGE Mathematics Software. The Sage Development Team (Version 4.7.0). http:\/\/www.sagemath.org (2011)."},{"key":"48_CR62","unstructured":"Stothers A.J.: On the complexity of matrix multiplication. Ph.D. thesis, University of Edinburgh (2010)."},{"key":"48_CR63","doi-asserted-by":"crossref","unstructured":"van Dijk M., Gentry C., Halevi S., Vaikuntanathan V.: Fully homomorphic encryption over the integers. In: Gilbert H. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 6110, pp. 24\u201343. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"48_CR64","unstructured":"von zur Gathen J., Gerhard J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)."},{"key":"48_CR65","doi-asserted-by":"crossref","unstructured":"Williams V.V.: Multiplying matrices faster than Coppersmith\u2013Winograd. In: Karloff H.J., Pitassi T. (eds.) Proceedings of STOC, pp. 887\u2013898. ACM, New York (2012).","DOI":"10.1145\/2213977.2214056"},{"key":"48_CR66","doi-asserted-by":"crossref","unstructured":"Zhao S.-W., Gao X.-S.: Minimal achievable approximation ratio for MAX-MQ in finite fields. Theor. Comput. Sci. 410(21\u201323), 2285\u20132290 (2009).","DOI":"10.1016\/j.tcs.2009.02.003"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0048-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0048-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0048-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T13:46:43Z","timestamp":1651585603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0048-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,20]]},"references-count":66,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0048-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,20]]}}}