{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:08:25Z","timestamp":1743098905500,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401596"},{"type":"electronic","value":"9783642401602"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40160-2_19","type":"book-chapter","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T23:17:24Z","timestamp":1377040644000},"page":"241-254","source":"Crossref","is-referenced-by-count":6,"title":["Allowing Non-identifying Information Disclosure in Citizen Opinion Evaluation"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Buccafurri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidia","family":"Fotia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Lax","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0034851","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"M. Abe","year":"1996","unstructured":"Abe, M., Fujisaki, E.: How to date blind signatures. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 244\u2013251. Springer, Heidelberg (1996)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"G. Ateniese","year":"2000","unstructured":"Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 255\u2013270. Springer, Heidelberg (2000)"},{"key":"19_CR3","unstructured":"Bach, E.: Discrete logarithms and factoring. Computer Science Division, University of California (1984)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11423409_18","volume-title":"Privacy Enhancing Technologies","author":"E. Bertino","year":"2005","unstructured":"Bertino, E., Ferrari, E., Squicciarini, A.C.: Privacy-preserving trust negotiations. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol.\u00a03424, pp. 283\u2013301. Springer, Heidelberg (2005)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M. Blum","year":"1983","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. ACM SIGACT News\u00a015(1), 23\u201327 (1983)","journal-title":"ACM SIGACT News"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"19_CR7","unstructured":"Brands, S.A.: An efficient off-line electronic cash system based on the representation problem (1993)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Brands, S.A.: Rethinking public key infrastructures and digital certificates: building in privacy. MIT Press (2000)","DOI":"10.7551\/mitpress\/5931.001.0001"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences\u00a037(2), 156\u2013189 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-32701-8_21","volume-title":"Advancing Democracy, Government and Governance","author":"F. Buccafurri","year":"2012","unstructured":"Buccafurri, F., Fotia, L., Lax, G.: Allowing continuous evaluation of citizen opinions through social networks. In: K\u0151, A., Leitner, C., Leitold, H., Prosser, A. (eds.) EDEM 2012 and EGOVIS 2012. LNCS, vol.\u00a07452, pp. 242\u2013253. Springer, Heidelberg (2012)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Buccafurri, F., Fotia, L., Lax, G.: Privacy-preserving resource evaluation in social networks. In: Proceedings of the 2012 Tenth Annual International Conference on Privacy, Security and Trust, PST 2012, pp. 51\u201358. IEEE Computer Society (2012)","DOI":"10.1109\/PST.2012.6297919"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-642-33486-3_30","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"F. Buccafurri","year":"2012","unstructured":"Buccafurri, F., Lax, G., Nocera, A., Ursino, D.: Discovering links among social networks. In: Flach, P.A., De Bie, T., Cristianini, N. (eds.) ECML PKDD 2012, Part II. LNCS, vol.\u00a07524, pp. 467\u2013482. Springer, Heidelberg (2012)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Burmester, M., Magkos, E.: Towards secure and practical e-elections in the new era. Secure Electronic Voting, 63\u201376 (2003)","DOI":"10.1007\/978-1-4615-0239-5_5"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/11426639_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Camenisch","year":"2005","unstructured":"Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact E-cash. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 302\u2013321. Springer, Heidelberg (2005)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM\u00a024(2), 84\u201390 (1981)","journal-title":"Communications of the ACM"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-1-4757-0602-4_18","volume-title":"Advances in Cryptology","author":"David Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol.\u00a01440, pp. 199\u2013203. Springer, Heidelberg (1999)"},{"issue":"10","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"Chaum, D.: Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM\u00a028(10), 1030\u20131044 (1985)","journal-title":"Communications of the ACM"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45961-8_15","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 177\u2013182. Springer, Heidelberg (1988)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-48184-2_7","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Damg\u00e5rd, I.B., van de Graaf, J.: Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 87\u2013119. Springer, Heidelberg (1988)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-47721-7_10","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"D. Chaum","year":"1987","unstructured":"Chaum, D., Evertse, J.-H.: A secure and privacy-protecting protocol for transmitting personal information between organizations. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 118\u2013167. Springer, Heidelberg (1987)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"D. Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 257\u2013265. Springer, Heidelberg (1991)"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1057\/palgrave.jit.2000105","volume":"22","author":"A. Cordella","year":"2007","unstructured":"Cordella, A.: E-government: towards the e-bureaucratic form? Journal of Information Technology\u00a022(3), 265\u2013274 (2007)","journal-title":"Journal of Information Technology"},{"issue":"5","key":"19_CR25","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/ett.4460080506","volume":"8","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. European Transactions on Telecommunications\u00a08(5), 481\u2013490 (1997)","journal-title":"European Transactions on Telecommunications"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-60865-6_44","volume-title":"Fast Software Encryption","author":"H. Dobbertin","year":"1996","unstructured":"Dobbertin, H., Bosselaers, A., Preneel, B.: RIPEMD-160: A strengthened version of RIPEMD. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 71\u201382. Springer, Heidelberg (1996)"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Dunleavy, P., Margetts, H., Bastow, S., Tinkler, J.: Digital era governance: IT corporations, the state, and e-government. OUP Catalogue (2006)","DOI":"10.1093\/acprof:oso\/9780199296194.001.0001"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Eastlake, D., Jones, P.: US secure hash algorithm 1 (SHA1). Technical report, RFC 3174 (September 2001)","DOI":"10.17487\/rfc3174"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013104. Springer, Heidelberg (2001)"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-49649-1_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"Y. Frankel","year":"1998","unstructured":"Frankel, Y., Tsiounis, Y., Yung, M.: Fair off-line e-cash made easy. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 257\u2013270. Springer, Heidelberg (1998)"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-57220-1_66","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"A. Fujioka","year":"1993","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 244\u2013251. Springer, Heidelberg (1993)"},{"issue":"3","key":"19_CR33","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM (JACM)\u00a038(3), 690\u2013728 (1991)","journal-title":"Journal of the ACM (JACM)"},{"key":"19_CR34","unstructured":"Goldwasser, S., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with an honest majority. In: Proc. of the Nienteenth Annual ACM STOC, vol.\u00a087, pp. 218\u2013229 (1987)"},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 539\u2013556. Springer, Heidelberg (2000)"},{"key":"19_CR36","unstructured":"Holt, J.E., Seamons, K.E.: Selective disclosure credential sets (2002), Accessible as \n                    \n                      http:\/\/citeseer.nj.nec.com\/541329.html"},{"key":"19_CR37","unstructured":"Jarvis, R.: Selective disclosure of credential content during trust negotiation. Master of Science Thesis, Brigham Young University, Provo, Utah (2003)"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-24676-3_34","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A. Kiayias","year":"2004","unstructured":"Kiayias, A., Tsiounis, Y., Yung, M.: Traceable signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 571\u2013589. Springer, Heidelberg (2004)"},{"issue":"1","key":"19_CR39","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1504\/IJSN.2006.010821","volume":"1","author":"A. Kiayias","year":"2006","unstructured":"Kiayias, A., Yung, M.: Secure scalable group signature with dynamic joins and separable authorities. International Journal of Security and Networks\u00a01(1), 24\u201345 (2006)","journal-title":"International Journal of Security and Networks"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Medaglia, R.: eParticipation research: Moving characterization forward (2006\u20132011). Government Information Quarterly (2012)","DOI":"10.1016\/j.giq.2012.02.010"},{"issue":"2","key":"19_CR41","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 129\u2013139. ACM (1999)","DOI":"10.1145\/336992.337028"},{"key":"19_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all\/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 248\u2013259. Springer, Heidelberg (1994)"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Persiano, P., Visconti, I.: User privacy issues regarding certificates and the TLS protocol: the design and implementation of the SPSL protocol. In: Proceedings of the 7th ACM Conference on Computer and Communications Security, pp. 53\u201362. ACM (2000)","DOI":"10.1145\/352600.352609"},{"issue":"1","key":"19_CR45","first-page":"4","volume":"27","author":"A. Persson","year":"2010","unstructured":"Persson, A., Goldkuhl, G.: Government value paradigms-bureaucracy, new public management, and e-government. Communications of the Association for Information Systems\u00a027(1), 4 (2010)","journal-title":"Communications of the Association for Information Systems"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of computer security. Springer (2003)","DOI":"10.1007\/978-3-662-07324-7"},{"key":"19_CR47","unstructured":"Rose, J., S\u00e6b\u00f8, \u00d8.: Establishing political deliberation systems: Key problems (2008)"},{"issue":"3","key":"19_CR48","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.giq.2007.04.007","volume":"25","author":"\u00d8. S\u00e6b\u00f8","year":"2008","unstructured":"S\u00e6b\u00f8, \u00d8., Rose, J., Skiftenes Flak, L.: The shape of eParticipation: Characterizing an emerging research area. Government Information Quarterly\u00a025(3), 400\u2013428 (2008)","journal-title":"Government Information Quarterly"},{"key":"19_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"K. Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-free mix-type voting scheme. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Susha, I., Gr\u00f6nlund, \u00c5.: eParticipation research: Systematizing the field. Government Information Quarterly (2012)","DOI":"10.1016\/j.giq.2011.11.005"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Viscusi, G., Mecella, M.: Information systems for eGovernment: A quality-of-service perspective. Springer (2011)","DOI":"10.1007\/978-3-642-13571-2"},{"key":"19_CR52","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.entcs.2006.12.004","volume":"168","author":"A. Zwierko","year":"2007","unstructured":"Zwierko, A., Kotulski, Z.: A light-weight e-voting system with distributed trust. Electronic Notes in Theoretical Computer Science\u00a0168, 109\u2013126 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Technology-Enabled Innovation for Democracy, Government and Governance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40160-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:10:36Z","timestamp":1558019436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40160-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401596","9783642401602"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40160-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}