{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:36:24Z","timestamp":1760142984129,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62032005","62172096","62272104","2020J02016"],"award-info":[{"award-number":["62032005","62172096","62272104","2020J02016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Fujian Province, China","award":["62032005","62172096","62272104","2020J02016"],"award-info":[{"award-number":["62032005","62172096","62272104","2020J02016"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>A transitive signature scheme enables anyone to obtain the signature on edge (i,k) by combining the signatures on edges (i,j) and (j,k), but it suffers from signature theft and signature abuse. The existing work has solved these problems using a universal designated verifier transitive signature (UDVTS). However, the UDVTS scheme only enables the designated verifier to authenticate signatures, which provides a simple way for the signer to deny having signed some messages. The fact that the UDVTS is not publicly verifiable prevents the verifier from seeking help arbitrating the source of signatures. Based on this problem, this paper proposes a traceable universal designated verifier transitive signature (TUDVTS) and its security model. We introduce a tracer into the system who will trace the signature back to its true source after the verifier has submitted an application for arbitration. To show the feasibility of our primitive, we construct a concrete scheme from a bilinear group pair (G,GT) of prime order and prove that the scheme satisfies unforgeability, privacy, and traceability.<\/jats:p>","DOI":"10.3390\/info15010043","type":"journal-article","created":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T07:47:16Z","timestamp":1705045636000},"page":"43","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Traceable Universal Designated Verifier Transitive Signature Scheme"],"prefix":"10.3390","volume":"15","author":[{"given":"Shaonan","family":"Hou","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Fujian Normal University, Fuzhou 350117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengjun","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Fujian Normal University, Fuzhou 350117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojun","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Fujian Normal University, Fuzhou 350117, China"},{"name":"Key Laboratory of Analytical Mathematics and Applications, Fujian Normal University, Ministry of Education, Fuzhou 350117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Preneel, B. (2002). Topics in Cryptology\u2014CT-RSA 2002, Springer.","DOI":"10.1007\/3-540-45760-7"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.ins.2015.02.033","article-title":"Universal Designated Verifier Transitive Signatures for Graph-Based Big Data","volume":"318","author":"Hou","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Zheng, Y. (2002). Advances in Cryptology\u2014ASIACRYPT 2002, Springer.","DOI":"10.1007\/3-540-36178-2"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1109\/TIT.2005.847697","article-title":"Transitive Signatures: New Schemes and Proofs","volume":"51","author":"Bellare","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","unstructured":"Wang, L., Cao, Z., Zheng, S., Huang, X., and Yang, Y. (2007). Progress in Cryptology\u2014INDOCRYPT 2007, Springer. INDOCRYPT\u201907."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Chen, J., Piuri, V., Su, C., and Yung, M. (2016). Network and System Security, Springer.","DOI":"10.1007\/978-3-319-46298-1"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Chen, X., Lin, D., and Yung, M. (2018). Information Security and Cryptology, Springer.","DOI":"10.1007\/978-3-319-75160-3"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.jcss.2016.06.003","article-title":"A New Universal Designated Verifier Transitive Signature Scheme for Big Graph Data","volume":"83","author":"Lin","year":"2017","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_9","first-page":"3316","article-title":"Transitive Signature Schemes for Undirected Graphs from Lattices","volume":"13","author":"Noh","year":"2019","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_10","first-page":"509","article-title":"Identity-Based Transitive Signature Scheme from Lattices","volume":"31","author":"Noh","year":"2021","journal-title":"J. Korea Inst. Inf. Secur. Cryptol."},{"key":"ref_11","unstructured":"Rivest, R., and Hohenberger, S. (2003). The Cryptographic Impact of Groups with Infeasible Inversion. [Doctoral Dissertation, Massachusetts Institute of Technology]."},{"key":"ref_12","first-page":"1120","article-title":"Transitive Signature Scheme for Directed Trees","volume":"86-A","author":"Kuwakado","year":"2003","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_13","first-page":"129","article-title":"Directed Transitive Signature Scheme","volume":"Volume 4377","author":"Abe","year":"2007","journal-title":"Topics in Cryptology\u2014CT-RSA 2007, The Cryptographers\u2019 Track at the RSA Conference 2007, San Francisco, CA, USA, 5\u20139 February 2007, Proceedings"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.tcs.2008.01.042","article-title":"A Simple Transitive Signature Scheme for Directed Trees","volume":"396","author":"Neven","year":"2008","journal-title":"Theor. Comput. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-642-27954-6_3","article-title":"Short Transitive Signatures for Directed Trees","volume":"Volume 7178","author":"Dunkelman","year":"2012","journal-title":"Topics in Cryptology\u2014CT-RSA 2012"},{"key":"ref_16","first-page":"91","article-title":"Directed Transitive Signature on Directed Tree","volume":"Volume 14","author":"Mathur","year":"2016","journal-title":"Proceedings of the Singapore Cyber-Security Conference (SG-CRC) 2016-Cyber-Security by Design"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-540-40061-5_33","article-title":"Universal Designated-Verifier Signatures","volume":"Volume 2894","author":"Laih","year":"2003","journal-title":"Advances in Cryptology\u2014ASIACRYPT 2003"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Boyd, C. (2001). Advances in Cryptology\u2014ASIACRYPT 2001, Springer.","DOI":"10.1007\/3-540-45682-1"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-24632-9_7","article-title":"Efficient Extension of Standard Schnorr\/RSA Signatures into Universal Designated-Verifier Signatures","volume":"Volume 2947","author":"Bao","year":"2004","journal-title":"Public Key Cryptography-PKC 2004, 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, 1\u20134 March 2004"},{"key":"ref_20","unstructured":"Ng, C.Y., Susilo, W., and Mu, Y. (2005, January 20\u201322). Universal Designated Multi Verifier Signature Schemes. Proceedings of the 11th International Conference on Parallel and Distributed Systems, ICPADS 2005, Fuduoka, Japan."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1007\/11596042_85","article-title":"Identity-Based Universal Designated Verifier Signatures","volume":"Volume 3823","author":"Enokido","year":"2005","journal-title":"Embedded and Ubiquitous Computing-EUC 2005 Workshops, EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES, Nagasaki, Japan, 6\u20139 December 2005, Proceedings"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/11496137_33","article-title":"Short Signature and Universal Designated Verifier Signature Without Random Oracles","volume":"Volume 3531","author":"Ioannidis","year":"2005","journal-title":"Applied Cryptography and Network Security, Third International Conference, ACNS 2005, New York, NY, USA, 7\u201310 June 2005, Proceedings"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1049\/iet-ifs.2009.0036","article-title":"Generic Constructions for Universal Designated-Verifier Signatures and Identitybased Signatures from Standard Signatures","volume":"3","author":"Shahandashti","year":"2009","journal-title":"IET Inf. Secur."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1016\/j.ic.2011.03.002","article-title":"An ID-Based Multi-Signer Universal Designated Multi-Verifier Signature Scheme","volume":"209","author":"Chang","year":"2011","journal-title":"Inf. Comput."},{"key":"ref_25","first-page":"479","article-title":"Universal Designated Verifier Signature Without Delegatability","volume":"Volume 4307","author":"Ning","year":"2006","journal-title":"Information and Communications Security, 8th International Conference, ICICS 2006, Raleigh, NC, USA, 4\u20137 December 2006, Proceedings"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/11807964_34","article-title":"Universal Designated Verifier Ring Signature (Proof) Without Random Oracles","volume":"Volume 4097","author":"Zhou","year":"2006","journal-title":"Emerging Directions in Embedded and Ubiquitous Computing, EUC 2006 Workshops: NCUS, SecUbiq, USN, TRUST, ESO, and MSA, Seoul, Korea, 1\u20134 August 2006, Proceedings"},{"key":"ref_27","first-page":"49","article-title":"A Universal Designated Multi Verifiers Content Extraction Signature Scheme","volume":"21","author":"Wang","year":"2020","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Li, B.H., Liu, Y.Z., and Yang, S. (2018, January 12\u201314). Lattice-Based Universal Designated Verifier Signatures. Proceedings of the 15th International Conference on e-Business Engineering, ICEBE, Xi\u2019an, China. IEEE Computer Society.","DOI":"10.1109\/ICEBE.2018.00062"},{"key":"ref_29","first-page":"4305","article-title":"Traceable Universal Designated Verifier Signature Proof Scheme","volume":"33","author":"Tang","year":"2022","journal-title":"Ruan Jian Xue Bao\/J. Softw."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"909","DOI":"10.4304\/jcm.7.12.909-920","article-title":"Round-Optimal ID-Based Blind Signature Schemes without ROS Assumption","volume":"7","author":"Gao","year":"2012","journal-title":"J. Commun."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/1\/43\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:45:33Z","timestamp":1760103933000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/1\/43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["info15010043"],"URL":"https:\/\/doi.org\/10.3390\/info15010043","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2024,1,12]]}}}