{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:42Z","timestamp":1764997002208,"version":"3.40.4"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319048512"},{"type":"electronic","value":"9783319048529"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04852-9_16","type":"book-chapter","created":{"date-parts":[[2014,2,18]],"date-time":"2014-02-18T09:02:08Z","timestamp":1392714128000},"page":"307-326","source":"Crossref","is-referenced-by-count":8,"title":["Practical Distributed Signatures in the Standard Model"],"prefix":"10.1007","author":[{"given":"Yujue","family":"Wang","sequence":"first","affiliation":[]},{"given":"Duncan S.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Qianhong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Sherman S. M.","family":"Chow","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Jianwei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for Key Management-Part 1: General (Revision 3). NIST Special Publication 800-57, 1-147 (2012), http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/sp800-57_part1_rev3_general.pdf"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ipl.2005.09.008","volume":"97","author":"A. Beimel","year":"2006","unstructured":"Beimel, A., Weinreb, E.: Monotone Circuits for Monotone Weighted Threshold Functions. Information Processing Letters\u00a097, 12\u201318 (2006)","journal-title":"Information Processing Letters"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/S0895480104445654","volume":"22","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discrete Math.\u00a022, 360\u2013397 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A. Beimel","year":"2011","unstructured":"Beimel, A.: Secret-Sharing Schemes: A Survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol.\u00a06639, pp. 11\u201346. Springer, Heidelberg (2011)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized Secret Sharing and Monotone Functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01388411","volume":"3","author":"A. Beutelspacher","year":"1993","unstructured":"Beutelspacher, A., Wettl, F.: On 2-level Secret Sharing. Designs, Codes and Cryptography\u00a03, 127\u2013134 (1993)","journal-title":"Designs, Codes and Cryptography"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: National Computer Conference, vol. 48, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"16_CR8","unstructured":"Bellare, M., Fuchsbauer, G.: Policy-based Signatures. Cryptology ePrint Archive, Report 2013\/413 (2013)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-72540-4_12","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"X. Boyen","year":"2007","unstructured":"Boyen, X.: Mesh Signatures. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 210\u2013227. Springer, Heidelberg (2007)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"E.F. Brickell","year":"1990","unstructured":"Brickell, E.F.: Some Ideal Secret Sharing Schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 468\u2013475. Springer, Heidelberg (1990)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-30580-4_24","volume-title":"Public Key Cryptography - PKC 2005","author":"I. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Dupont, K.: Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 346\u2013361. Springer, Heidelberg (2005)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11745853_6","volume-title":"Public Key Cryptography - PKC 2006","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 75\u201390. Springer, Heidelberg (2006)"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10207-004-0043-y","volume":"3","author":"V. Daza","year":"2004","unstructured":"Daza, V., Herranz, J., S\u00e1ez, G.: Protocols Useful on the Internet from Distributed Signature Schemes. Int. J. Inf. Secur. 3, 61\u201369 (2004)","journal-title":"Int. J. Inf. Secur."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"Y. Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and Group Oriented Cryptography: A New Concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"issue":"4","key":"16_CR16","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"-31","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory IT-31(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory IT"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-642-25385-0_33","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"O. Farr\u00e0s","year":"2011","unstructured":"Farr\u00e0s, O., Padr\u00f3, C., Xing, C., Yang, A.: Natural Generalizations of Threshold Secret Sharing. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 610\u2013627. Springer, Heidelberg (2011)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-11799-2_14","volume-title":"Theory of Cryptography","author":"O. Farr\u00e0s","year":"2010","unstructured":"Farr\u00e0s, O., Padr\u00f3, C.: Ideal Hierarchical Secret Sharing Schemes. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 219\u2013236. Springer, Heidelberg (2010)"},{"issue":"3","key":"16_CR19","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s00145-011-9101-6","volume":"25","author":"O. Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s, O., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Ideal Multipartite Secret Sharing Schemes. Journal of Cryptology 25(3), 434\u2013463 (2012)","journal-title":"Journal of Cryptology"},{"issue":"16","key":"16_CR20","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for Cryptographers. Discrete Applied Mathematics\u00a0156(16), 3113\u20133121 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-78967-3_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Gennaro","year":"2008","unstructured":"Gennaro, R., Halevi, S., Krawczyk, H., Rabin, T.: Threshold RSA for Dynamic and Ad-Hoc Groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 88\u2013107. Springer, Heidelberg (2008)"},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s001459910011","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and Efficient Sharing of RSA Functions. J. Cryptol. 13, 273\u2013300 (2000)","journal-title":"J. Cryptol."},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1006\/inco.2000.2881","volume":"164","author":"R. Gennaro","year":"2001","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust Threshold DSS Signatures. Information and Computation 164, 54\u201384 (2001)","journal-title":"Information and Computation"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/10958513_10","volume-title":"Information Security","author":"J. Herranz","year":"2003","unstructured":"Herranz, J., Padr\u00f3, C., S\u00e1ez, G.: Distributed RSA Signature Schemes for General Access Structures. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol.\u00a02851, pp. 122\u2013136. Springer, Heidelberg (2003)"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-45126-6_21","volume-title":"Financial Cryptography","author":"J. Herranz","year":"2003","unstructured":"Herranz, J., S\u00e1ez, G.: Verifiable Secret Sharing for General Access Structures, with Application to Fully Distributed Proxy Signatures. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 286\u2013302. Springer, Heidelberg (2003)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-30556-9_28","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"J. Herranz","year":"2004","unstructured":"Herranz, J., S\u00e1ez, G.: Revisiting Fully Distributed Proxy Signature Schemes. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 356\u2013370. Springer, Heidelberg (2004)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-03356-8_38","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"S. Hohenberger","year":"2009","unstructured":"Hohenberger, S., Waters, B.: Short and Stateless Signatures from the RSA Assumption. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 654\u2013670. Springer, Heidelberg (2009)"},{"key":"16_CR28","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret Sharing Scheme Realizing General Access Structure. In: IEEE Global Telecommunications Conference, pp. 99\u2013102 (1987)"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-27954-6_4","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"J. Herranz","year":"2012","unstructured":"Herranz, J., Laguillaumie, F., Libert, B., R\u00e0fols, C.: Short Attribute-Based Signatures for Threshold Predicates. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol.\u00a07178, pp. 51\u201367. Springer, Heidelberg (2012)"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On Span Programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-75670-5_14","volume-title":"Provable Security","author":"J. Li","year":"2007","unstructured":"Li, J., Yuen, T.H., Kim, K.: Practical Threshold Signatures without Random Oracles. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol.\u00a04784, pp. 198\u2013207. Springer, Heidelberg (2007)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-19074-2_24","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"H.K. Maji","year":"2011","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Attribute-Based Signatures. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 376\u2013392. Springer, Heidelberg (2011)"},{"key":"16_CR33","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(99)00070-8","volume":"70","author":"P. Morillo","year":"1999","unstructured":"Morillo, P., Padr\u00f3, C., S\u00e1ez, G., Villar, J.L.: Weighted Threshold Secret Sharing Schemes. Information Processing Letters\u00a070, 211\u2013216 (1999)","journal-title":"Information Processing Letters"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-19379-8_3","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"T. Okamoto","year":"2011","unstructured":"Okamoto, T., Takashima, K.: Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 35\u201352. Springer, Heidelberg (2011)"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-36362-7_9","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"T. Okamoto","year":"2013","unstructured":"Okamoto, T., Takashima, K.: Decentralized Attribute-Based Signatures. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol.\u00a07778, pp. 125\u2013142. Springer, Heidelberg (2013)"},{"issue":"1","key":"16_CR36","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1023\/A:1008378426278","volume":"16","author":"C. Padr\u00f3","year":"1999","unstructured":"Padr\u00f3, C., S\u00e1ez, G., Villar, J.L.: Detection of Cheaters in Vector Space Secret Sharing Schemes. Designs, Codes and Cryptography\u00a016(1), 75\u201385 (1999)","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"16_CR37","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"},{"key":"16_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2012.04.038","volume":"210","author":"B. Qin","year":"2012","unstructured":"Qin, B., Wu, Q., Zhang, L., Farr\u00e0s, O., Domingo-Ferrer, J.: Provably Secure Threshold Public-Key Encryption with Adaptive Security and Short Ciphertexts. Information Sciences\u00a0210, 67\u201380 (2012)","journal-title":"Information Sciences"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Saxena, N., Tsudik, G., Yi, J.H.: Efficient Node Admission for Short-lived Mobile Ad Hoc Networks. In: 13th IEEE International Conference on Network Protocols, ICNP, pp. 269\u2013278 (2005)","DOI":"10.1109\/ICNP.2005.14"},{"key":"16_CR40","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient Signature Generation by Smart Cards. J. Cryptol.\u00a04, 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"16_CR41","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Commun. of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Commun. of the ACM"},{"key":"16_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 207\u2013220. Springer, Heidelberg (2000)"},{"key":"16_CR43","first-page":"71","volume":"1","author":"G.J. Simmons","year":"1991","unstructured":"Simmons, G.J., Jackson, W.-A., Martin, K.M.: The Geometry of Shared Secret Schemes. Bulletin of the Institute of Combinatorics and Its Applications\u00a01, 71\u201388 (1991)","journal-title":"Bulletin of the Institute of Combinatorics and Its Applications"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"G.J. Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (Really) Share a Secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 390\u2013448. Springer, Heidelberg (1990)"},{"key":"16_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-47719-5_33","volume-title":"Information Security and Privacy","author":"D.R. Stinson","year":"2001","unstructured":"Stinson, D.R., Strobl, R.: Provably Secure Distributed Schnorr Signatures and a (t,n) Threshold Scheme for Implicit Certificates. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol.\u00a02119, pp. 417\u2013434. Springer, Heidelberg (2001)"},{"key":"16_CR46","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T. Tassa","year":"2009","unstructured":"Tassa, T., Dyn, N.: Multipartite Secret Sharing by Bivariate Interpolation. J. Cryptol. 22, 227\u2013258 (2009)","journal-title":"J. Cryptol."},{"key":"16_CR47","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T. Tassa","year":"2007","unstructured":"Tassa T.: Hierarchical Threshold Secret Sharing. Journal of Cryptology 20, 237\u2013264 (2007)","journal-title":"Journal of Cryptology"},{"key":"16_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient Identity-based Encryption without Random Oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04852-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T21:42:37Z","timestamp":1746135757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04852-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319048512","9783319048529"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04852-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}