{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T17:03:24Z","timestamp":1785258204766,"version":"3.55.0"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,7]],"date-time":"2013-03-07T00:00:00Z","timestamp":1362614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s13389-013-0057-3","type":"journal-article","created":{"date-parts":[[2013,3,6]],"date-time":"2013-03-06T19:16:53Z","timestamp":1362597413000},"page":"111-128","source":"Crossref","is-referenced-by-count":579,"title":["Charm: a framework for rapidly prototyping cryptosystems"],"prefix":"10.1007","volume":"3","author":[{"given":"Joseph A.","family":"Akinyele","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christina","family":"Garman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian","family":"Miers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew W.","family":"Pagano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Rushanan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Green","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aviel D.","family":"Rubin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,3,7]]},"reference":[{"key":"57_CR1","unstructured":"The Advanced Crypto Software Collection. http:\/\/acsc.cs.utexas.edu\/"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Acar, T., Belenkiy, M., Bellare, M., Cash, D.: Cryptographic agility and its relation to circular encryption. In: EUROCRYPT (2010)","DOI":"10.1007\/978-3-642-13190-5_21"},{"key":"57_CR3","unstructured":"Acar, T., Fournet, C., Shumow, D.: Design and verication of a crypto-agile distributed key manager (2011)"},{"key":"57_CR4","unstructured":"Akinyele, J.A., Green, M., Rubin, A.: Charm-crypto framework. http:\/\/eprint.iacr.org\/2011\/617"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Almeida, J.B., Bangerter, E., Barbosa, M., Krenn, S., Sadeghi, A.-R., Schneider, T.A.: Certifying compiler for zero-knowledge proofs of knowledge based on $$\\Sigma $$ -protocols. In: Proceedings of the 15th European conference on Research in Computer Security, ESORICS, pp. 151\u2013167. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15497-3_10"},{"key":"57_CR6","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an efficient library for cryptography. http:\/\/code.google.com\/p\/relic-toolkit\/"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Ateniese, G., de Medeiros, B.: On the key exposure problem in chameleon hashes. In: SCN. LNCS vol. 3352, pp. 165\u2013179. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30598-9_12"},{"key":"57_CR8","unstructured":"Bangerter, E., Barzan, S., Sadeghi, A., Schneider, T., Tsay, J.: Bringing zero-knowledge proofs of knowledge to practice. In: 17th International Workshop on Security Protocols (2009)"},{"key":"57_CR9","unstructured":"Bangerter, E., Camenisch, J., Krenn, S., Sadeghi, A.-R., Schneider, T.: Automatic generation of sound zero-knowledge protocols. Cryptology ePrint Archive, Report 2008\/471 (2008). http:\/\/eprint.iacr.org\/"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption padding\u2014how to encrypt with rsa. In: EUROCRYPT, pp. 92\u2013111 (1994)","DOI":"10.1007\/BFb0053428"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures: how to sign with RSA and Rabin. In: Maurer, U (ed.) EUROCRYPT. LNCS, vol. 1070. Springer, Berlin (1996)","DOI":"10.1007\/3-540-68339-9_34"},{"key":"57_CR12","unstructured":"Bernstein, D.J., Lange, T., Schwabe, P.: The security impact of a new cryptographic library. In: Hevia, A., Neven, G. (eds.) Progress in cryptology\u2014LATINCRYPT. Lecture Notes in Computer Science. Springer, Berlin (2012, to appear). Document ID: 5f6fc69cc5a319aecba43760c56fab04, http:\/\/cryptojedi.org\/papers\/"},{"key":"57_CR13","unstructured":"Bethencourt, J.: Libpaillier (2006)"},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: Proceedings of the 2007 IEEE Symposium on Security and Privacy, pp. 321\u2013334. IEEE Computer Society, New York (2007)","DOI":"10.1109\/SP.2007.11"},{"key":"57_CR15","unstructured":"Bethencourt, J., Song, D., Waters, B.: Analysis-resistant malware. In: NDSS (2008)"},{"key":"57_CR16","unstructured":"Blakley, G., Chaum, D., ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, vol. 196, pp. 10\u201318. Springer, Berlin (1985)"},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: EUROCRYPT. LNCS, vol. 3027, pp. 223\u2013238 (2004)","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"57_CR18","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: CRYPTO. LNCS, vol. 3152, pp. 45\u201355 (2004)"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil Pairing. In: CRYPTO. LNCS, vol. 2139, pp. 213\u2013229 (2001)","DOI":"10.1007\/3-540-44647-8_13"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Boneh, D., Katz, J.: Improved efficiency for cca-secure cryptosystems built using identity based encryption. In: CT-RSA. LNCS, vol. 3376. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-30574-3_8"},{"key":"57_CR21","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil Pairing. In: ASIACRYPT. LNCS, vol. 2248, pp. 514\u2013532 (2001)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"57_CR22","doi-asserted-by":"crossref","unstructured":"Boyen, X.: Mesh signatures: how to leak a secret with unwitting and unwilling participants. In: EUROCRYPT. LNCS, vol. 4515, pp. 210\u2013227. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72540-4_12"},{"key":"57_CR23","doi-asserted-by":"crossref","unstructured":"Brassard, G., Schnorr, C.: Efficient Identification and Signatures for Smart Cards, vol. 435, pp. 239\u2013252. Springer, Berlin (1990)","DOI":"10.1007\/0-387-34805-0_22"},{"key":"57_CR24","doi-asserted-by":"crossref","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS, pp. 132\u2013145. ACM, New York (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"57_CR25","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Groth, J.: Group signatures: better efficiency and new theoretical aspects. In: Blundo, C., Cimato, S. (eds.) Security in Communication Networks. Lecture Notes in Computer Science, vol. 3352, pp. 120\u2013133. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-30598-9_9"},{"key":"57_CR26","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Hohenberger, S., Stergaard Pedersen, M.: Batch verification of short signatures. In: EUROCRYPT. LNCS, vol. 4515. Springer, Berlin, pp. 246\u2013263 (2007)","DOI":"10.1007\/978-3-540-72540-4_14"},{"key":"57_CR27","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Kohlweiss, M., Rial, A., Sheedy, C.: Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data. In: PKC, Irvine, pp. 196\u2013214. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-00468-1_12"},{"key":"57_CR28","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: EUROCRYPT. LNCS, vol. 2045, pp. 93\u2013118. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44987-6_7"},{"key":"57_CR29","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Proceedings of the 3rd International Conference on Security in Communication Networks, SCN, pp. 268\u2013289. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36413-7_20"},{"key":"57_CR30","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature Schemes and Anonymous Credentials from Bilinear Maps, pp. 56\u201372. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"57_CR31","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: EUROCRYPT. LNCS, vol. 4515, pp. 573\u2013590 (2007)","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"57_CR32","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: CRYPTO. LNCS, vol. 1296, pp. 410\u2013424 (1997)","DOI":"10.1007\/BFb0052252"},{"key":"57_CR33","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS, pp. 21\u201330. ACM, New York (2002)","DOI":"10.1145\/586110.586114"},{"key":"57_CR34","doi-asserted-by":"crossref","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity based encryption. In: EUROCRYPT. LNCS, vol. 3027, pp. 207\u2013222 (2004)","DOI":"10.1007\/978-3-540-24676-3_13"},{"key":"57_CR35","doi-asserted-by":"crossref","unstructured":"Cha, J.C., Cheon, J.H.: An identity-based signature from gap Diffie-Hellman groups. In: PKC. LNCS, vol. 2139, pp. 18\u201330. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36288-6_2"},{"key":"57_CR36","doi-asserted-by":"crossref","unstructured":"Chow, S.S.M., Yiu, S.M., Hui, L.C.K.: Efficient identity based ring signature. In: Applied Crypto and Network Security\u2014ACNS. LNCS, vol. 3531, pp. 499\u2013512. Springer, Berlin (2005)","DOI":"10.1007\/11496137_34"},{"key":"57_CR37","unstructured":"Condra, G.: pypbc. http:\/\/www.gitorious.org\/pypbc"},{"key":"57_CR38","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: CRYPTO, pp. 13\u201325. Springer, London (1998)","DOI":"10.1007\/BFb0055717"},{"key":"57_CR39","unstructured":"Denis, T.S.: LibTomCrypt Project. http:\/\/libtom.org"},{"key":"57_CR40","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. Comput. 542\u2013552 (2000)","DOI":"10.1137\/S0097539795291562"},{"key":"57_CR41","unstructured":"Dufour, M.: Shedskin (2009). http:\/\/code.google.com\/p\/shedskin"},{"key":"57_CR42","doi-asserted-by":"crossref","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Proceedings of Crypto, pp. 10\u201318 (1984)","DOI":"10.1007\/3-540-39568-7_2"},{"key":"57_CR43","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: CRYPTO. LNCS, vol. 263, pp. 186\u2013194 (1986)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"57_CR44","doi-asserted-by":"crossref","unstructured":"Freeman, D.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: EUROCRYPT, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 44\u201361 (2010)","DOI":"10.1007\/978-3-642-13190-5_3"},{"key":"57_CR45","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC, pp. 169\u2013178. ACM, New York (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"57_CR46","unstructured":"GNU. The GNU Multiple Precision Arithmetic Library. http:\/\/www.gmplib.org"},{"issue":"3","key":"57_CR47","doi-asserted-by":"crossref","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. J. ACM 38(3), 690\u2013728 (1991)","journal-title":"J. ACM"},{"key":"57_CR48","doi-asserted-by":"crossref","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: EUROCRYPT. LNCS, vol. 4965, pp. 415\u2013432. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"57_CR49","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: Tasty: tool for automating secure two-party computations. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS, pp. 451\u2013462. ACM, New York (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"57_CR50","doi-asserted-by":"crossref","unstructured":"Hess, F.: Efficient identity based signature schemes based on pairings. In: SAC, LNCS 2595, pp. 310\u2013324. Springer, Berlin (2002)","DOI":"10.1007\/3-540-36492-7_20"},{"key":"57_CR51","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Waters, B.: Realizing hash-and-sign signatures under standard assumptions. In: Advances in Cryptology\u2014EUROCRYPT (2009)","DOI":"10.1007\/978-3-642-01001-9_19"},{"key":"57_CR52","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Waters, B.: Constructing verifiable random functions with large input spaces. In: EUROCRYPT, 29th Annual International Conference on the Theory and Applications of Cryptographic, Techniques, pp. 656\u2013672 (2010)","DOI":"10.1007\/978-3-642-13190-5_33"},{"key":"57_CR53","doi-asserted-by":"crossref","unstructured":"Iovino, V., Persiano, G.: Hidden-vector encryption with groups of prime order. In: Proceedings of the 2nd International Conference on Pairing-Based Cryptography, Pairing \u201908, pp. 75\u201388. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85538-5_5"},{"key":"57_CR54","unstructured":"Lacy, J.B.: CryptoLib: Cryptography in software. USENIX Security Conference IV, pp. 1\u201318 (1993)"},{"key":"57_CR55","unstructured":"Laurie, B., Clifford, B.: The Stupid programming language. Source code available at http:\/\/code.google.com\/p\/stupid-crypto\/"},{"key":"57_CR56","unstructured":"Lewis, J.R., Martin, B.: CRYPTOL: High Assurance, Retargetable Crypto Development and Validation (2003). http:\/\/www.galois.com\/files\/Cryptol_Whitepaper.pdf"},{"key":"57_CR57","doi-asserted-by":"crossref","unstructured":"Lewko, A., Sahai, A., Waters, B.: Revocation systems with very small private keys. In: Proceedings of the IEEE Symposium on Security and Privacy, SP, pp. 273\u2013285. IEEE Computer Society, Washington, DC (2010)","DOI":"10.1109\/SP.2010.23"},{"key":"57_CR58","doi-asserted-by":"crossref","unstructured":"Lewko, A., Waters, B.: Decentralizing attribute-based encryption. In: Patterson, K.G. (ed.) EUROCRYPT. LNCS, vol. 6632, pp. 568\u2013588. Springer, Berlin. http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-20465-4_31"},{"key":"57_CR59","doi-asserted-by":"crossref","unstructured":"Lewko, A.B.: Tools for simulating features of composite order bilinear groups in the prime order setting. IACR Cryptol. ePrint Archive 2011, 490 (2011)","DOI":"10.1007\/978-3-642-29011-4_20"},{"key":"57_CR60","unstructured":"Litzenberger, D.C.: PyCrypto\u2014The Python Cryptography Toolkit. http:\/\/www.dlitz.net\/software\/pycrypto\/"},{"key":"57_CR61","unstructured":"Lynn, B.: The Stanford Pairing Based Crypto Library. http:\/\/crypto.stanford.edu\/pbc"},{"key":"57_CR62","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay\u2014a secure two-party computation system. In: Proceedings of the 13th USENIX Security Symposium, pp. 287\u2013302. USENIX Association, Berkeley (2004)"},{"key":"57_CR63","unstructured":"Meiklejohn, S., Erway, C.C., K\u00fcp\u00e7\u00fc, A., Hinkle, T., Lysyanskaya, A.: ZKPDL: a language-based system for efficient zero-knowledge proofs and electronic cash. In: Proceedings of the 19th USENIX Conference on Security, USENIX Security, pp. 13\u201313. USENIX Association, Berkeley (2010)"},{"key":"57_CR64","unstructured":"Meiklejohn, S., Mowery, K., Checkoway, S., Shacham, H.: The phantom tollbooth: privacy-preserving electronic toll collection in the presence of driver collusion. In: Proceedings of the 20th USENIX conference on Security, SEC, pp. 32\u201332. USENIX Association, Berkeley (2011)"},{"key":"57_CR65","unstructured":"NIST.: Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186 (1994)"},{"key":"57_CR66","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: CRYPTO. LNCS, vol. 576, pp. 129\u2013140 (1992)","DOI":"10.1007\/3-540-46766-1_9"},{"key":"57_CR67","unstructured":"Regev, O.: Lattice-based cryptography. In: Dwork, C. (ed.) Advances in Cryptology\u2014CRYPTO 2006. Lecture Notes in Computer Science, vol. 4117, pp. 131\u2013141 Springer Berlin Heidelberg (2006)."},{"key":"57_CR68","doi-asserted-by":"crossref","unstructured":"Rouselakis, Y., Waters, B.: New constructions and proof methods for large universe attribute-based encryption. Cryptology ePrint Archive Report 2012\/583 (2012) http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2508859.2516672"},{"key":"57_CR69","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: EUROCRYPT, pp. 457\u2013473 (2005)","DOI":"10.1007\/11426639_27"},{"key":"57_CR70","unstructured":"Scott, M.: MIRACL library. Indigo Software. http:\/\/indigo.ie\/mscott\/download"},{"key":"57_CR71","unstructured":"Stein, W., et al.: Sage Mathematics Software (Version 5.0.1). The Sage Development Team. http:\/\/www.sagemath.org"},{"key":"57_CR72","doi-asserted-by":"crossref","unstructured":"Stern, J., Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, vol. 1592, pp. 223\u2013238. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"57_CR73","unstructured":"The OpenSSL Project. OpenSSL: The open source toolkit for SSL\/TLS (2010). http:\/\/www.openssl.org"},{"key":"57_CR74","doi-asserted-by":"crossref","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full sha-1. In: Proceedings of Crypto, pp. 17\u201336. Springer, Berlin (2005)","DOI":"10.1007\/11535218_2"},{"key":"57_CR75","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to break md5 and other hash functions. In: EUROCRYPT. Springer, Berlin (2005)","DOI":"10.1007\/11426639_2"},{"key":"57_CR76","doi-asserted-by":"crossref","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: EUROCRYPT. LNCS, vol. 3494, pp. 114\u2013127 (2005)","DOI":"10.1007\/11426639_7"},{"key":"57_CR77","unstructured":"Waters, B.: Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. Cryptology ePrint Archive Report 2008\/290 (2008). http:\/\/eprint.iacr.org\/"},{"key":"57_CR78","doi-asserted-by":"crossref","unstructured":"Waters, B.: Functional encryption for regular languages. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology CRYPTO 2012. Lecture Notes in Computer Science, vol. 7417, pp. 218\u2013235. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32009-5_14"},{"key":"57_CR79","unstructured":"Wustrow, E., Wolchok, S., Goldberg, I., Halderman, J.A.: Telex: Anticensorship in the network infrastructure. In: Proceedings of the 20th USENIX Security Symposium (2011)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-013-0057-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-013-0057-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-013-0057-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T23:22:54Z","timestamp":1745968974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-013-0057-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,7]]},"references-count":79,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["57"],"URL":"https:\/\/doi.org\/10.1007\/s13389-013-0057-3","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,7]]}}}