{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T14:59:59Z","timestamp":1705071599838},"reference-count":38,"publisher":"Engineering and Technology Publishing","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"DOI":"10.4304\/jcm.7.12.909-920","type":"journal-article","created":{"date-parts":[[2012,12,10]],"date-time":"2012-12-10T09:09:57Z","timestamp":1355130597000},"source":"Crossref","is-referenced-by-count":6,"title":["Round-Optimal ID-Based Blind Signature Schemes without ROS Assumption"],"prefix":"10.12720","volume":"7","author":[{"given":"Wei","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueli","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4977","published-online":{"date-parts":[[2012,12,1]]},"reference":[{"key":"ref1","first-page":"62","article-title":"Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols.","volume-title":"Proc of the 1st CCS","author":"Bellare","year":"1993","unstructured":"[7] M. Bellare, P. Rogaway, Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In: Proc. of the 1st CCS, pp. 62-73. ACM Press. New York, 1993."},{"key":"ref2","first-page":"199","article-title":"Blind Signatures for Untraceable Payments.","volume-title":"Proc of Advances in Cryptology - CRYPTO 82","author":"Chaum","year":"1983","unstructured":"[13] D. Chaum, Blind Signatures for Untraceable Payments. In: Proc. of Advances in Cryptology - CRYPTO'82, pp. 199-203. New York: Plenum Press, 1983."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2011.05.009"},{"issue":"8","key":"ref4","first-page":"1822","article-title":"New identity-based blind signature and blind decryption scheme in the standard model. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","volume":"92A","author":"Phong","year":"2009","unstructured":"[31] L. Phong, W. Ogata, New identity-based blind signature and blind decryption scheme in the standard model. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E92A(8), pp.1822-1835, 2009.","journal-title":"E","ISSN":"http:\/\/id.crossref.org\/issn\/1046-8021","issn-type":"print"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[1] J. Baek, Y. Zheng, Identity-based Threshold Signature Scheme From the Bilinear Pairings. In: Proc. of IAS'04 track of ITCC'04, pp. 124-128. IEEE Computer Society, 2004.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[2] D. Boneh, M. Franklin, Identity-based Encryption from the Weil Pairing. In: Proc. of Advances in Cryptology - CRYPTO 2001,LNCS 2139, pp. 213-229. Springer-Verlag, 2001.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[3] M. Bellare, C. Namprempre, G. Neven, Security Proofs for Identity-Based Identification and Signature Schemes. In: Proc. of Advances in Cryptology - EUROCRYPT 2004, LNCS 3027, pp.268\u2013286. Springer-Verlag, 2004.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[4] M.Bellare, G. Neven, Transitive Signatures Based on Factoring and RSA. In: Proc. of Advances in Cryptology - ASIACRYPT 2002, LNCS 2501, pp. 397-414. Springer-Verlag, 2002.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[5] M. Bellare, C.Namprempre, D. Pointcheval,M. Semanko,The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. Journal of Cryptology, 16(3): 185-215 (2003).Preliminary version of this paper appears in the Proc. of FC 2001,Springer-Verlag, 2001.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[6] M. Bellare, A. Palacio, GQ and Schnorr Identification Schemes:Proofs of Security against Impersonation under Active and Concurrent Attack. In: Proc. of Advances in Cryptology - CRYPTO 2002, LNCS 2442, pp. 162-177. Springer-Verlag, 2002.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[8] A. Boldyreva, Efficient Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-group Signature Scheme. In: Proc. of PKC 2003, LNCS 2567, pp. 31-46.Springer-Verlag, 2003.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[9] D. Boneh, B. Lynn, and H. Shacham, Short Signatures from the Weil Pairing. In: Proc. of Advances in Cryptology - ASIACRYPT 2001, LNCS 2248, pp. 514\u2013532. Springer-Verlag, 2002.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[10] E. Bresson, J. Monnerat, D Vergnaud, Separation Results on the \"One-More\" Computational Problems. In: Proc. of CT-RSA 2008,LNCS 4964, pp.71-87, Springer-Verlag, 2008.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[11] J. Camenisch, M. Koprowski, B. Warinschi, Efficient Blind Signatures Without Random Oracles. In: Proc. of Security in Communication Networks 2004, LNCS 3352, pp. 134-148. Springer-Verlag,2005.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[12] J. C.Cha,J. H. Cheon, An Identity-based Signature from Gap Diffie-Hellman Groups. In: Proc. of PKC 2003, LNCS 2567, pp.18-30. Springer-Verlag, 2003.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[14] L Chen, An interpretation of identity-based cryptography, in:Foundations of Security Analysis and Design V, LNCS 4677, pp.183-208. Springer-Verlag, 2007.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[15] J. H. Cheon. Security Analysis of the Strong Diffie-Hellman Problem. In: Proc. of Eurocrypt 2006, LNCS 4004, pp. 1-11.Springer-Verlag, 2006.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[16] S. M. Chow, Verifiable Pairing and its Applications. In: Proc. of WISA 2004, LNCS 3325, pp. 170-187. Springer-Verlag, 2004.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[17] Christodoulakis, D., Vaitis, M., Papadopoulos, A., Tzagarakis, M.: \"The Callimachus approach to distributed hypermedia\"; Proc. 10th ACM Conf. Hypert., ACM, New York (Feb 1999).","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[18] R. Dutta, R. Barua, P.Sarkar, Pairing-based Cryptography: a Survey. IACR preprint sever, submission 2004\/064, 2004.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[19] M. Fischlin, A Note on Security Proofs in the Generic Model. In:Proc. of Asiacrypt'00, LNCS 1976, pp. 458-469. Springer-Verlag,2000.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[20] M. Fischlin, Round-Optimal Composable Blind Signatures in the Common Reference String Model. In: Proc. of Advances in Cryptology - CRYPTO 2006, LNCS 4117, pp. 60-77. Springer-Verlag, 2006.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[21] D. Galindo, J. Herranz, E. Kiltz, On the Generic Construction of Identity-Based Signatures with Additional Properties. In: Proc.of Advances in Cryptology - ASIACRYPT 2006, LNCS 4284, pp.178-193. Springer-Verlag, 2006.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[22] W. Gao, G. Wang, X. Wang, F. Li, One-Round ID-based blind signature scheme without ROS assumption, in: Proceedings of Pairing'2008. LNCS 5209, pp. 316-331. Springer-Verlag, 2008.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[23] C. Gentry, Z. Ramzan, Identity-Based Aggregate Signatures. In:Proc. of PKC 2006, LNCS 3958, pp. 257-273. Springer-Verlag,2006.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[25] Z. Huang., K. Chen, Y. Wang, Efficient Identity-Based Signatures and Blind Signatures. In: Proc. of CANS 2005, LNCS 3810, pp.120-133. Springer-Verlag, 2005.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[26] A. Joux, A one-round protocol for tripartite diffie-hellman, in: ANTS-IV Conference, LNCS 1838, pp. 385-394. Springer-Verlag,2000.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[27] A. Joux, The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems. In: Proc. of Algorithm Number Theory Symposium - ANTS 2002, LNCS 2369, pp. 20-32. Springer-Verlag,2002.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[28] A. Kiayias, H. Zhou, Two-Round Concurrent Blind Signatures without Random Oracles. In: Proc. of Security and Cryptography for Networks 2006, LNCS 4116, pp. 49-62. Springer-Verlag, 2006.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[29] A. Lysyanskaya, R. Rivest, A. Sahai, and Wolf S. Pseudonym Systems. In: Prof. of 6th Annual Int. Workshop on Selected Areas in Cryptography, LNCS 1758, pp. 184-199.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[30] T. Okamoto, Efficient Blind and Partially Blind Signatures Without Random Oracles. In: Proc. of 3rd Theory of Cryptography (TCC 06), LNCS 3876, pp. 80-99. Springer-Verlag, 2006.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[34] A. Shamir, Identity-based Cryptosystems and Signature Schemes. In: Proc. of Advances in Cryptology - CRYPTO\u00a1\u00af84, LNCS 196,pp. 47-53. Springer-Verlag, 1984.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[35] C. P. Schnorr, Security of Blind Discrete Log Signatures against Interactive Attacks. In: Proc. of ICICS 2001, LNCS 2229, pp. 1-12.Springer-Verlag, 2001.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[36] D. Wagner, A Generalized Birthday Problem. In: Proc. of Advances in Cryptology - CRYPTO 2002, LNCS 2442, pp. 288-303.Springer-Verlag, 2002.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[37] F. Zhang, K. Kim, ID-based Blind Signature and Ring Signature from Pairings. In: Proc. of Advances in Cryptology - ASIACRYPT 2002, LNCS 2501, pp. 533-547. Springer-Verlag, 2002.","DOI":"10.1016\/j.amc.2004.12.050"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[38] F. Zhang, K. Kim, Efficient ID-based Blind Signature and Proxy Signature from Bilinear Pairings. In: Proc. of ACISP2003, LNCS 2727, pp. 312-323. Springer-Verlag, 2003.","DOI":"10.1016\/j.amc.2004.12.050"}],"container-title":["Journal of Communications"],"original-title":[],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T03:54:02Z","timestamp":1498017242000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=30&id=20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,1]]},"references-count":38,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2012,12,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcm.7.12.909-920","relation":{},"ISSN":["1796-2021"],"issn-type":[{"value":"1796-2021","type":"print"}],"subject":[],"published":{"date-parts":[[2012,12,1]]}}}