{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:25:33Z","timestamp":1722943533741},"reference-count":38,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2016]]},"DOI":"10.12720\/jcm.11.6.564-572","type":"journal-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T04:01:16Z","timestamp":1480564876000},"source":"Crossref","is-referenced-by-count":0,"title":["Generic Construction of Chameleon Hash to Group Elements"],"prefix":"10.12720","author":[{"name":"Department of Computer Science, Guangdong University of Finance, Guangzhou 510521, P.R. China","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhui","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueling","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4977","published-online":{"date-parts":[[2016]]},"reference":[{"key":"ref0","unstructured":"[1] H. Krawczyk and T. Rabin, \"Chameleon hashing and signatures,\" in Proc. Network and Distributed System Security, 2000, pp. 143\u2013154."},{"key":"ref1","doi-asserted-by":"crossref","unstructured":"[2] A. Shamir and Y. Tauman, \"Improved Online\/Offline signature schemesm,\" Lecture Notes in Computer Science, pp. 355\u2013367, 2001.","DOI":"10.1007\/3-540-44647-8_21"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[3] G. Ateniese and B. de Medeiros, \"Identity-based chameleon hash and applications,\" in FC, LNCS, Springer-Verlag, 2004, pp. 164\u2013180.","DOI":"10.1007\/978-3-540-27809-2_19"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"[4] B. Libert, et al., \"Linearly homomorphic structure preserving signatures and their applications,\" in Advances in Cryptology-CRYPTO, LNCS, Springer-Verlag, 2013, pp. 289\u2013307.","DOI":"10.1007\/978-3-642-40084-1_17"},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"[5] P. Mohassel, \"One-Time signatures and chameleon hash functions,\" Lecture Notes in Computer Science, vol. 6544, pp. 302\u2013319, 2011.","DOI":"10.1007\/978-3-642-19574-7_21"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"[6] E. Fujisaki, \"New constructions of efficient simulation-sound commitments using encryption and their applications.\" Lecture Notes in Computer Science, vol. 7178, pp. 136\u2013155, 2012.","DOI":"10.1007\/978-3-642-27954-6_9"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[7] Y. Zhang, et al., \"Generic construction for secure and efficient handoff authentication schemes in EAP-based wireless networks,\" Computer Networks, vol. 75, pp. 192\u2013211, 2014.","DOI":"10.1016\/j.comnet.2014.10.009"},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"[8] G. Brassard, D. Chaum, and C. Crepeau. \"Minimum disclosure proofs of knowledge,\" Journal of Computer and Systems Sciences, vol. 37, no. 2, pp. 156\u2013189, 1988.","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"[9] T. ElGamal, \"On computing logarithms over finite fields,\" Lecture Notes in Computer Science, vol. 218, pp. 396\u2013402, 1986.","DOI":"10.1007\/3-540-39799-X_28"},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"[10] D. Boneh, X. Boyen, and H. Shacham, \"Short group signatures,\" Lecture Notes in Computer Science, vol. 3152, pp. 41\u201355, 2004.","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[11] I. Damg ard and J. B. Nielsen, \"Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor,\" Lecture Notes in Computer Science, vol. 2442, pp. 581\u2013596, 2002.","DOI":"10.1007\/3-540-45708-9_37"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"[12] L. Guillou and J. Quisquater, \"A practical zeroknowledge protocol fitted to security microprocessor minimizing both trasmission and memory,\" Lecture Notes in Computer Science, vol. 330, pp. 123\u2013128, 1988.","DOI":"10.1007\/3-540-45961-8_11"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"[13] T. Pedersen, \"Non-interactive and information-theoretic secure verifiable secret sharing,\" Lecture Notes in Computer Science, vol. 576, pp. 129\u2013140, 1992.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"[14] J. Garay, P. MacKenzie, and K. Yang, \"Strengthening zero-knowledge protocols using signatures,\" Lecture Notes in Computer Science, vol. 2656, pp. 177\u2013194, 2003.","DOI":"10.1007\/3-540-39200-9_11"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"[15] X. Chen, F. Zhang, and K. Kim. \"Chameleon hashing without key exposure,\" Lecture Notes in Computer Science, vol. 3225, pp. 87\u201398, 2004.","DOI":"10.1007\/978-3-540-30144-8_8"},{"key":"ref15","unstructured":"[16] F. Zhang, R. Safavi-Naini, and W. Susilo, \"ID-Based chameleon hashes from bilinear pairings,\" Cryptology ePrint Archive: Report 2003\/208. 2003."},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"[17] X. Chen, et al., \"Identity-based chameleon hashing and signatures without key exposure,\" Information Sciences, vol. 265, pp. 198\u2013210, 2014.","DOI":"10.1016\/j.ins.2013.12.020"},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"[18] J. Groth, \"Simulation-Sound NIZK proofs for a practical language and constant size group signatures,\" Lecture Notes in Computer Science, vol. 4284, pp. 444\u2013459, 2006.","DOI":"10.1007\/11935230_29"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"[19] J. Cathalo, B. Libert, and M. Yung, \"Group encryption: non-interactive realization in the standard model,\" Lecture Notes in Computer Science, vol. 5912, pp. 179\u2013196, 2009.","DOI":"10.1007\/978-3-642-10366-7_11"},{"key":"ref19","unstructured":"[20] G. Fuchsbauer, \"Automorphic signatures in bilinear groups and an application to round-optimal blind signatures,\" Cryptology ePrint Archive: Report 2009\/320. 2009."},{"key":"ref20","unstructured":"[21] M. Abe, K. Haralambiev, and M. Ohkubo, \"Signing on elements in bilinear groups for modular protocol design,\" Cryptology ePrint Archive: Report 2010\/133. 2010."},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"[22] M. Abe, et al., \"Structure-Preserving signatures and commitments to group elements,\" Lecture Notes in Computer Science, vol. 6223, pp. 209\u2013236, 2010.","DOI":"10.1007\/978-3-642-14623-7_12"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"[23] M. Abe, et al., \"Optimal structure-preserving signatures in asymmetric bilinear groups,\" Lecture Notes in Computer Science, vol. 6841, pp. 649\u2013666, 2011.","DOI":"10.1007\/978-3-642-22792-9_37"},{"key":"ref23","doi-asserted-by":"crossref","unstructured":"[24] M. Abe, J. Groth, and M. Ohkubo, \"Separating short structure-preserving signatures from non-interactive assumptions,\" Lecture Notes in Computer Science, vol. 7073, pp. 628\u2013646, 2011.","DOI":"10.1007\/978-3-642-25385-0_34"},{"key":"ref24","doi-asserted-by":"crossref","unstructured":"[25] C. Hanser and D. Slamanig. \"Structure-Preserving signatures on equivalence classes and their application to anonymous credentials,\" Lecture Notes in Computer Science, vol. 8873, pp. 491\u2013511, 2014.","DOI":"10.1007\/978-3-662-45611-8_26"},{"key":"ref25","doi-asserted-by":"crossref","unstructured":"[26] G. Barthe, et al., \"Strongly-Optimal structure preserving signatures from type II pairings: Synthesis and lower bounds,\" Lecture Notes in Computer Science, vol. 9020, pp. 355\u2013376, 2015.","DOI":"10.1007\/978-3-662-46447-2_16"},{"key":"ref26","doi-asserted-by":"crossref","unstructured":"[27] M. Abe, et al., \"Unified, minimal and selectively randomizable structure-preserving signatures,\" Lecture Notes in Computer Science, vol. 8349, pp. 688\u2013712, 2014.","DOI":"10.1007\/978-3-642-54242-8_29"},{"key":"ref27","doi-asserted-by":"crossref","unstructured":"[28] M. Abe, et al., \"Structure-Preserving signatures from type II pairings,\" Lecture Notes in Computer Science, vol. 8616, pp. 390\u2013407, 2014.","DOI":"10.1007\/978-3-662-44371-2_22"},{"key":"ref28","doi-asserted-by":"crossref","unstructured":"[29] B. Libert, T. Peters, and M. Yung, \"Short group signatures via structure-preserving signatures: Standard model security from simple assumptions,\" Lecture Notes in Computer Science, vol. 9216, pp. 296\u2013316, 2015.","DOI":"10.1007\/978-3-662-48000-7_15"},{"key":"ref29","doi-asserted-by":"crossref","unstructured":"[30] E. Kiltz, J. Pan, and H. Wee, \"Structure-Preserving signatures from standard assumptions, revisited,\" Lecture Notes in Computer Science, vol. 9216, pp. 275\u2013295, 2015.","DOI":"10.1007\/978-3-662-48000-7_14"},{"key":"ref30","doi-asserted-by":"crossref","unstructured":"[31] J. Groth, \"Efficient fully structure-preserving signatures for large messages,\" Lecture Notes in Computer Science, vol. 9452, pp. 239\u2013259, 2015.","DOI":"10.1007\/978-3-662-48797-6_11"},{"key":"ref31","doi-asserted-by":"crossref","unstructured":"[32] M. Abe, et al., \"Fully structure-preserving signatures and shrinking commitments,\" Lecture Notes in Computer Science, vol. 9057, pp. 35\u201365, 2015.","DOI":"10.1007\/978-3-662-46803-6_2"},{"key":"ref32","doi-asserted-by":"crossref","unstructured":"[33] Y. Desmedt, \"Computer security by redefining what a computer is,\" in Proc. New Security Paradigms Workshop, 1993, pp. 160\u2013166.","DOI":"10.1145\/283751.283834"},{"key":"ref33","doi-asserted-by":"crossref","unstructured":"[34] R. Johnson, et al., \"Homomorphic signature schemes,\" Lecture Notes in Computer Science, pp. 244\u2013262, 2002.","DOI":"10.1007\/3-540-45760-7_17"},{"key":"ref34","doi-asserted-by":"crossref","unstructured":"[35] G. Ateniese, et al., \"Provable data possession at untrusted stores,\" in Proc. 14th ACM Conference on Computer and Communications Security, 2007, pp. 598\u2013609.","DOI":"10.1145\/1315245.1315318"},{"key":"ref35","doi-asserted-by":"crossref","unstructured":"[36] D. Boneh, et al., \"Signing a linear subspace: Signature schemes for network coding,\" Lecture Notes in Computer Science, vol. 5443, pp. 68\u201387, 2009.","DOI":"10.1007\/978-3-642-00468-1_5"},{"key":"ref36","doi-asserted-by":"crossref","unstructured":"[37] G. Ateniese, S. Kamara, and J. Katz, \"Proofs of storage from homomorphic identification protocols,\" Lecture Notes in Computer Science, vol. 5912, pp. 319\u2013333, 2009.","DOI":"10.1007\/978-3-642-10366-7_19"},{"key":"ref37","doi-asserted-by":"crossref","unstructured":"[38] G. Ateniese and B. de Medeiros, \"On the key exposure problem in chameleon hashes,\" Lecture Notes in Computer Science, vol. 3352, pp. 165\u2013179, 2004.","DOI":"10.1007\/978-3-540-30598-9_12"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2016\/0624\/20160624031118938.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T00:25:24Z","timestamp":1568593524000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=162&id=989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":38,"URL":"https:\/\/doi.org\/10.12720\/jcm.11.6.564-572","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2016]]}}}