{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:42:42Z","timestamp":1758267762447,"version":"3.37.3"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T00:00:00Z","timestamp":1470182400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370203"],"award-info":[{"award-number":["61370203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Luan commis- sion directed city-level key research","award":["2010LWA 004"],"award-info":[{"award-number":["2010LWA 004"]}]},{"name":"Luan commission directed city-level research","award":["2012LW022"],"award-info":[{"award-number":["2012LW022"]}]},{"name":"Innovation Project of GUET Graduate Education","award":["XJYC2012020"],"award-info":[{"award-number":["XJYC2012020"]}]},{"name":"the Doctoral Fund","award":["20130181120076"],"award-info":[{"award-number":["20130181120076"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00500-016-2296-6","type":"journal-article","created":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T02:53:19Z","timestamp":1470192799000},"page":"7473-7483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Statistical learning based fully homomorphic encryption on encrypted data"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8320-0168","authenticated-orcid":false,"given":"Linzhi","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,3]]},"reference":[{"key":"2296_CR1","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J, Peikert C (2013) Practical bootstrapping in quasilinear time. In: Advances in cryptology\u2014CRYPTO 2013. Springer, Berlin, pp 1\u201320","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"2296_CR2","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J, Peikert C (2014) Faster bootstrapping with polynomial error. In: Advances in cryptology\u2014CRYPTO 2014. Springer, Berlin, pp 297\u2013314","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"2296_CR3","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh EJ, Nissim K (2005) Evaluating 2-DNF formulas on ciphertexts. In: Tcc, pp 325\u2013341","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"2296_CR4","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume":"7417","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. Lect Notes Comput Sci 7417:868\u2013886","journal-title":"Lect Notes Comput Sci"},{"key":"2296_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011a) Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science. IEEE Computer Society, pp 97\u2013106","DOI":"10.1109\/FOCS.2011.12"},{"key":"2296_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011b) Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Advances in cryptology\u2014CRYPTO 2011. Springer, Berlin, pp 505\u2013524","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"2296_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Lattice-based FHE as secure as PKE. In: Proc. of ITCS, ACM, pp 1\u201312","DOI":"10.1145\/2554797.2554799"},{"key":"2296_CR8","first-page":"169","volume":"18","author":"Z Brakerski","year":"2011","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2011) (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory 18:169\u2013178","journal-title":"ACM Trans Comput Theory"},{"key":"2296_CR9","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Halevi S (2013a) Packed ciphertexts in LWE-based homomorphic encryption. In: Public-key cryptography\u2014PKC 2013. Springer, Berlin, pp 1\u201313","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"2296_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Langlois A, Peikert C, et al (2013b) Classical Hardnessof Learning with Errors. In: Proceedings of Stoc. ACM, NY, pp575\u2013584","DOI":"10.1145\/2488608.2488680"},{"key":"2296_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011b) Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Advances in cryptology\u2014CRYPTO 2011. Springer, Berlin, pp 505\u2013524","DOI":"10.1007\/978-3-642-22792-9_29"},{"issue":"11","key":"2296_CR12","doi-asserted-by":"crossref","first-page":"4593","DOI":"10.1109\/TIP.2012.2204272","volume":"21","author":"H Chao-Yung","year":"2012","unstructured":"Chao-Yung H, Chun-Shien L, Soo-Chang P (2012) Image feature extraction in encrypted domain with privacy-preserving SIFT. IEEE Trans Image Process Publ IEEE Sig Process Soc 21(11):4593\u20134607","journal-title":"IEEE Trans Image Process Publ IEEE Sig Process Soc"},{"key":"2296_CR13","doi-asserted-by":"crossref","unstructured":"Chen Y, Nguyen PQ (2012) Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers. In: Advances in cryptology\u2014EUROCRYPT 2012. Springer, Berlin, pp 502\u2013519","DOI":"10.1007\/978-3-642-29011-4_30"},{"key":"2296_CR14","doi-asserted-by":"crossref","unstructured":"Cheon JH, Stehl D (2015) Fully homomophic encryption over the integers revisited. In: Advances in cryptology\u2014EUROCRYPT 2015. Springer, Berlin, pp 513\u2013536","DOI":"10.1007\/978-3-662-46800-5_20"},{"key":"2296_CR15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","volume":"7881","author":"JH Cheon","year":"2013","unstructured":"Cheon JH, Coron JS, Kim J et al (2013) Batch fully homomorphic encryption over the integers. Lect Notes Comput Sci 7881:315\u2013335","journal-title":"Lect Notes Comput Sci"},{"key":"2296_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.ins.2015.03.019","volume":"310","author":"JH Cheon","year":"2015","unstructured":"Cheon JH, Kim J, Lee MS et al (2015) CRT-based fully homomorphic encryption over the integers. Inf Sci 310:149\u2013162","journal-title":"Inf Sci"},{"key":"2296_CR17","first-page":"487","volume":"7881","author":"JS Coron","year":"2011","unstructured":"Coron JS, Mandal A, Naccache D et al (2011) Fully homomorphic encryption over the integers with shorter public keys. Crypto 7881:487\u2013504","journal-title":"Crypto"},{"key":"2296_CR18","doi-asserted-by":"crossref","unstructured":"Coron JS, Naccache D, Tibouchi M (2012) Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Advances in cryptology\u2014EUROCRYPT 2012. Springer, Berlin, pp 446\u2013464","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"2296_CR19","doi-asserted-by":"crossref","unstructured":"Coron JS, Lepoint T, Tibouchi M (2014) Scale-invariant fully homomorphic encryption over the integers. In: Public-key cryptography\u2014PKC 2014. Springer, Berlin, pp 311\u2013328","DOI":"10.1007\/978-3-642-54631-0_18"},{"key":"2296_CR20","doi-asserted-by":"crossref","unstructured":"Dowlin N, Gilad-Bachrach R, Laine K, Lauter K, Naehrig M, Wernsing J (2016) CryptoNets: applying neural networks to encrypted data with high throughput and accuracy, pp 1\u201312 http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id","DOI":"10.1109\/JPROC.2016.2622218"},{"key":"2296_CR21","unstructured":"Ducas L, Micciancio D (2014) Implementation of FHEW. https:\/\/github.com\/lducas\/FHEW.2014"},{"key":"2296_CR22","doi-asserted-by":"crossref","unstructured":"Ducas L, Micciancio D (2015a) FHEW: bootstrapping homomorphic encryption in less than a second. In: Advances in cryptology\u2014EUROCRYPT 2015. Springer, Berlin, pp 617\u2013640","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"2296_CR23","doi-asserted-by":"crossref","unstructured":"Ducas L, Micciancio D (2015b) FHEW: bootstrapping homomorphic encryption in less than a second. In: Advances in cryptology\u2014EUROCRYPT 2015. Springer, Berlin, pp 717\u2013722","DOI":"10.1007\/978-3-662-46800-5_24"},{"issue":"4","key":"2296_CR24","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T Elgamal","year":"1985","unstructured":"Elgamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469\u2013472","journal-title":"IEEE Trans Inf Theory"},{"key":"2296_CR25","doi-asserted-by":"crossref","unstructured":"Elias Y, Lauter KE, Ozman E et al (2015) Provably weak instances of ring-LWE. In: Advances in cryptology\u2014CRYPTO 2015. Springer, Berlin, pp 63\u201392","DOI":"10.1007\/978-3-662-47989-6_4"},{"key":"2296_CR26","doi-asserted-by":"crossref","unstructured":"Feigenbaum J, Merritt M (1991) DIMACS series in discrete mathematics and theoretical computer science, vol 2, chapter Open questions, talk abstracts, and summary of discussions, ACM, pp 1\u201345","DOI":"10.1090\/dimacs\/002\/01"},{"key":"2296_CR27","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. Dissertations theses\u2014gradworks","DOI":"10.1145\/1536414.1536440"},{"issue":"3","key":"2296_CR28","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry C (2010) Computing arbitrary functions of encrypted data. Commun ACM 53(3):97\u2013105","journal-title":"Commun ACM"},{"issue":"4","key":"2296_CR29","first-page":"169","volume":"2009","author":"C Gentry","year":"2011","unstructured":"Gentry C (2011) Fully homomorphic encryption using ideal lattices. Proc Stoc 2009(4):169\u2013178","journal-title":"Proc Stoc"},{"key":"2296_CR30","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S (2011) Implementing gentrys fully-homomorphic encryption scheme. In: Advances in cryptology\u2014EUROCRYPT 2011. Springer, Berlin, pp 129\u2013148","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"2296_CR31","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP (2012a) Better bootstrapping in fully homomorphic encryption. In: Public key cryptography\u2014PKC 2012. Springer, Berlin, pp 1\u201316","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"2296_CR32","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP (2012b) Fully homomorphic encryption with polylog overhead. In: Advances in cryptology\u2014EUROCRYPT 2012. LNCS, vol 7237, pp 465\u2013482","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"2296_CR33","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP (2012c) Homomorphic evaluation of the AES circuit. In: Advances in cryptology\u2014CRYPTO 2012. Springer, Berlin, pp 850\u2013867","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"2296_CR34","doi-asserted-by":"crossref","unstructured":"Gentry C, Sahai A, Waters B (2013a) Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. Lect Notes Comput Sci 8042:75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"2296_CR35","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Peikert C et al (2013b) Field switching in BGV-style homomorphic encryption. J Comput Secur 21(5):663\u2013684","DOI":"10.3233\/JCS-130480"},{"key":"2296_CR36","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Peikert C et al (2013c) Field switching in BGV-style homomorphic encryption. J Comput Secur 21(5):663\u2013684","DOI":"10.3233\/JCS-130480"},{"issue":"84","key":"2296_CR37","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser S, Micali S (1984) Probabilistic encryption. J Comput Syst Sci 28(84):270\u2013299","journal-title":"J Comput Syst Sci"},{"key":"2296_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-37682-5_1","volume":"7839","author":"T Graepel","year":"2013","unstructured":"Graepel T, Lauter K, Naehrig M (2013) ML confidential: machine learning on encrypted data. Lect Notes Comput Sci 7839:1\u201321","journal-title":"Lect Notes Comput Sci"},{"issue":"7","key":"2296_CR39","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1109\/TNNLS.2014.2342533","volume":"26","author":"B Gu","year":"2014","unstructured":"Gu B, Sheng VS, Tay KY et al (2014) Incremental support vector learning for ordinal regression. IEEE Trans Neural Netw Learn Syst 26(7):1403\u20131416","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2296_CR40","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2014a) Algorithms in HElib. In: Advances in cryptology\u2014CRYPTO 2014. Springer, Berlin, pp 554\u2013571","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"2296_CR41","unstructured":"Halevi S, Shoup V (2014b) HElib\u2014an implementation of homomorphic encryption. https:\/\/github.com\/shaih\/HElib\/ . Accessed Sept 2014"},{"key":"2296_CR42","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2015) Bootstrapping for HElib. In: Advances in cryptology\u2014EUROCRYPT 2015. Springer, Berlin, pp 641\u2013670","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"2296_CR43","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham N (2001) Approximate integer common divisors. In: Cryptography and lattices. Springer, Berlin, pp 51\u201366","DOI":"10.1007\/3-540-44670-2_6"},{"key":"2296_CR44","doi-asserted-by":"crossref","unstructured":"Lauter K, Naehrig M, Vaikuntanathan V (2011) Can homomorphic encryption be practical? In: Proceedings of ACM CCSW ACM, pp 113\u2013124","DOI":"10.1145\/2046660.2046682"},{"key":"2296_CR45","first-page":"319","volume":"2010","author":"R Lindner","year":"2010","unstructured":"Lindner R, Peikert C (2010) Better key sizes (and attacks) for LWE-based encryption. Lect Notes Comput Sci 2010:319\u2013339","journal-title":"Lect Notes Comput Sci"},{"key":"2296_CR46","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Gilbert H (ed) EUROCRYPT 2010. LNCS, vol 6110. Springer, Heidelberg, pp 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"2296_CR47","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2013a) On ideal lattices and learning with errors over rings. Lect Notes Comput Sci 60(6):3","DOI":"10.1145\/2535925"},{"key":"2296_CR48","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2013b) A toolkit for ring-LWE cryptography. In: Advances in cryptology\u2014EUROCRYPT 2013. Springer, Berlin, pp 33\u201354","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"2296_CR49","volume-title":"Lattice-based cryptography post-quantum cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio D, Regev O (2009) Lattice-based cryptography post-quantum cryptography. Springer, Berlin pp 147\u2013191"},{"key":"2296_CR50","doi-asserted-by":"crossref","unstructured":"Naccache D, Stern J (1998) A new public key cryptosystem based on higher residues. In: Advances in cryptology eurocrypt96 saragossa lectures notes in computer science, pp 59\u201366","DOI":"10.1145\/288090.288106"},{"key":"2296_CR51","doi-asserted-by":"crossref","unstructured":"Nuida K, Kurosawa K (2015) (Batch) fully homomorphic encryption over integers for non-binary message spaces. In: Advances in cryptology\u2014EUROCRYPT 2015. Springer, Berlin, pp 537\u2013555","DOI":"10.1007\/978-3-662-46800-5_21"},{"issue":"1","key":"2296_CR52","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume":"547","author":"P Paillier","year":"1999","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. Adv Cryptol Eurocrypt 547(1):223\u2013238","journal-title":"Adv Cryptol Eurocrypt"},{"issue":"6","key":"2296_CR53","first-page":"84","volume":"56","author":"O Regev","year":"2005","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):84\u201393","journal-title":"J ACM"},{"issue":"6","key":"2296_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O, Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):1\u201340 (Preliminary version in STOC (2005))","journal-title":"J ACM"},{"key":"2296_CR55","doi-asserted-by":"crossref","unstructured":"Rivest RL, Shamir A, Adleman L (1978a) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(6):120\u2013126","DOI":"10.1145\/359340.359342"},{"key":"2296_CR56","unstructured":"Rivest RL, Adleman L, Dertouzos ML (1978b) On data banks and privacy homomorphisms. Found Secur Comput 4:169\u2013179"},{"issue":"6","key":"2296_CR57","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F Rosenblatt","year":"1958","unstructured":"Rosenblatt F (1958) The perceptron: a probabilistic model for information storage and organization in the brain. Psychol Rev 65(6):386\u2013408","journal-title":"Psychol Rev"},{"key":"2296_CR58","doi-asserted-by":"crossref","unstructured":"Schneider M, Schneider T (2014) Notes on non-interactive secure comparison in \u201cimage feature extraction in the encrypted domain with privacy-preserving SIFT\u201d. In: IH and MMSec\u201914 proceedings of the 2nd ACM workshop on information hiding and multimedia security. ACM, New York, pp 135\u2013140","DOI":"10.1145\/2600918.2600927"},{"key":"2296_CR59","doi-asserted-by":"crossref","unstructured":"Smart NP, Vercauteren F (2010) Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Public key cryptography\u2014PKC 2010. Springer, Berlin, pp 420\u2013443","DOI":"10.1007\/978-3-642-13013-7_25"},{"issue":"1","key":"2296_CR60","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart NP, Vercauteren F (2014) Fully homomorphic SIMD operations. Des Codes Cryptogr 71(1):57\u201381","journal-title":"Des Codes Cryptogr"},{"key":"2296_CR61","doi-asserted-by":"crossref","unstructured":"Stehl D, Steinfeld R (2010) Faster fully homomorphic encryption. In: Advances in cryptology\u2014ASIACRYPT 2010. Springer, Berlin, pp 377\u2013394","DOI":"10.1007\/978-3-642-17373-8_22"},{"key":"2296_CR62","doi-asserted-by":"crossref","unstructured":"van Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. In: Gilbert H (ed) EUROCRYPT 2010. LNCS, vol 6110, Springer, Heidelberg, pp 24\u201343","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"2296_CR63","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","volume":"295","author":"X Wen","year":"2015","unstructured":"Wen X, Shao L, Xue Y et al (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295:395\u2013406","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2296-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2296-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2296-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2296-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T23:10:01Z","timestamp":1568243401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2296-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,3]]},"references-count":63,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2296"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2296-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,8,3]]}}}