{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T04:01:33Z","timestamp":1746504093145,"version":"3.40.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319121598"},{"type":"electronic","value":"9783319121604"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12160-4_20","type":"book-chapter","created":{"date-parts":[[2014,10,18]],"date-time":"2014-10-18T11:14:47Z","timestamp":1413630887000},"page":"325-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ambiguous One-Move Nominative Signature Without Random Oracles"],"prefix":"10.1007","author":[{"given":"Dennis Y. W.","family":"Liu","sequence":"first","affiliation":[]},{"given":"Duncan S.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Qiong","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,19]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: FOCS 2004, pp. 186\u2013195. IEEE Computer Society, (2004)","DOI":"10.1109\/FOCS.2004.71"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"20_CR3","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. 3152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45811-5_21","volume-title":"Information Security","author":"E Bresson","year":"2002","unstructured":"Bresson, E., Stern, J.: Proofs of knowledge for non-monotone discrete-log formulae and applications. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 272\u2013288. Springer, Heidelberg (2002)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"JL Camenisch","year":"2003","unstructured":"Camenisch, J.L., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-46588-1_24","volume-title":"Public Key Cryptography","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., MacKenzie, P.D.: Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 354\u2013373. Springer, Heidelberg (2000)"},{"key":"20_CR7","unstructured":"Guo, L., Wang, G., Wong, D.S., Hu, L.: Further discussions on the security of a nominative signature scheme. In: SAM 2007, pp. 566\u2013572. CSREA Press, June 2007"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-85174-5_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D Hofheinz","year":"2008","unstructured":"Hofheinz, D., Kiltz, E.: Programmable hash functions and their applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 21\u201338. Springer, Heidelberg (2008)"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1504\/IJACT.2008.021086","volume":"1","author":"Q Huang","year":"2008","unstructured":"Huang, Q., Liu, D.Y.W., Wong, D.S.: An efficient one-move nominative signature scheme. IJACT 1(2), 133\u2013143 (2008)","journal-title":"IJACT"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2013.01.010","volume":"476","author":"Q Huang","year":"2013","unstructured":"Huang, Q., Wong, D.S.: Short and efficient convertible undeniable signature schemes without random oracles. Theor. Comput. Sci. 476, 67\u201383 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-89255-7_6","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"Q Huang","year":"2008","unstructured":"Huang, Q., Yang, G., Wong, D.S., Susilo, W.: Ambiguous optimistic fair exchange. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 74\u201389. Springer, Heidelberg (2008)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-27800-9_30","volume-title":"Information Security and Privacy","author":"Z Huang","year":"2004","unstructured":"Huang, Z., Wang, Y.-M.: Convertible nominative signatures. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 348\u2013357. Springer, Heidelberg (2004)"},{"key":"20_CR13","unstructured":"Kim, S.J., Park, S.J., Won, D.H.: Zero-knowledge nominative signatures. In: PragoCrypt\u201996, pp. 380\u2013392 (1996)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Liu, D.Y.W., Chang, S., Wong, D.S.: A more efficient convertible nominative signature. In: SECRYPT 2007, pp. 214\u2013221. INSTICC Press (2007)","DOI":"10.5220\/0002124402140221"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-75651-4_27","volume-title":"Advances in Information and Computer Security","author":"DYW Liu","year":"2007","unstructured":"Liu, D.Y.W., Chang, S., Wong, D.S., Mu, Y.: Nominative signature from ring signature. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds.) IWSEC 2007. LNCS, vol. 4752, pp. 396\u2013411. Springer, Heidelberg (2007)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-33272-2_2","volume-title":"Provable Security","author":"DYW Liu","year":"2012","unstructured":"Liu, D.Y.W., Wong, D.S.: One-move convertible nominative signature in the standard model. In: Takagi, T., Wang, G., Qin, Z., Jiang, S., Yu, Y. (eds.) ProvSec 2012. LNCS, vol. 7496, pp. 2\u201320. Springer, Heidelberg (2012)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Liu, D.Y.W., Wong, D.S.: One-move convertible nominative signature in the standard model. Security and Communication Networks, July 2013. http:\/\/dx.doi.org\/10.1002\/sec.812","DOI":"10.1002\/sec.812"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Liu, D.Y.W., Wong, D.S., Huang, Q.: Ambiguous one-move nominative signature without random oracles. Cryptology ePrint Archive, Report 2013\/711, 2013. http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-319-12160-4_20"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-77048-0_5","volume-title":"Information and Communications Security","author":"DYW Liu","year":"2007","unstructured":"Liu, D.Y.W., Wong, D.S., Huang, X., Wang, G., Huang, Q., Mu, Y., Susilo, W.: Formal definition and construction of nominative signature. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 57\u201368. Springer, Heidelberg (2007)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-21554-4_24","volume-title":"Applied Cryptography and Network Security","author":"JCN Schuldt","year":"2011","unstructured":"Schuldt, J.C.N., Hanaoka, G.: Non-transferable user certification secure against authority information leaks and impersonation attacks. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 413\u2013430. Springer, Heidelberg (2011)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11506157_28","volume-title":"Information Security and Privacy","author":"W Susilo","year":"2005","unstructured":"Susilo, W., Mu, Y.: On the security of nominative signatures. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 329\u2013335. Springer, Heidelberg (2005)"},{"key":"20_CR22","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-0-387-72367-9_23","volume-title":"New Approaches for Security, Privacy and Trust in Complex Environments","author":"G Wang","year":"2007","unstructured":"Wang, G., Bao, F.: Security remarks on a convertible nominative signature scheme. In: Venter, H., Eloff, M., Labuschagne, L., Eloff, J., von Solms, R. (eds.) SEC 2007. IFIP, vol. 232, pp. 265\u2013275. Springer, US (2007)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-01440-6_4","volume-title":"Information Security and Cryptology","author":"W Zhao","year":"2009","unstructured":"Zhao, W., Lin, C., Ye, D.: Provably secure convertible nominative signature scheme. In: Yung, M., Liu, P., Lin, D. (eds.) Inscrypt 2008. LNCS, vol. 5487, pp. 23\u201340. Springer, Heidelberg (2009)"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-16342-5_5","volume-title":"Information Security and Cryptology","author":"W Zhao","year":"2010","unstructured":"Zhao, W., Ye, D.: Pairing-based nominative signatures with selective and universal convertibility. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds.) Inscrypt 2009. LNCS, vol. 6151, pp. 60\u201374. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology -- ICISC 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12160-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T06:21:03Z","timestamp":1746426063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12160-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319121598","9783319121604"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12160-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"19 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}