{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T03:49:30Z","timestamp":1790394570616,"version":"4.1.0"},"reference-count":37,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T00:00:00Z","timestamp":1508457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.<\/jats:p>","DOI":"10.3390\/sym9100242","type":"journal-article","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T04:32:19Z","timestamp":1508733139000},"page":"242","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Lattice-Based Revocable Certificateless Signature"],"prefix":"10.3390","volume":"9","author":[{"given":"Ying-Hao","family":"Hung","sequence":"first","affiliation":[{"name":"Department of Mathematics, National Changhua University of Education, Jin-De Campus, Chang-Hua 500, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuh-Min","family":"Tseng","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Changhua University of Education, Jin-De Campus, Chang-Hua 500, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sen-Shan","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Changhua University of Education, Jin-De Campus, Chang-Hua 500, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2017,10,20]]},"reference":[{"key":"ref_1","first-page":"47","article-title":"Identity-Based cryptosystems and signature schemes","volume":"LNCS Volume 196","author":"Shamir","year":"1985","journal-title":"Proceedings of the Cryptology 1984 (Crypto\u201984)"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","article-title":"Identity-based encryption from the Weil pairing","volume":"LNCS Volume 2139","author":"Boneh","year":"2001","journal-title":"Proceedings of the Cryptology 2001 (Crypto\u201901)"},{"key":"ref_3","first-page":"452","article-title":"Certificateless public key cryptography","volume":"LNCS Volume 2894","author":"Paterson","year":"2003","journal-title":"Proceedings of the Advances in Cryptology (ASIACRYPT\u201903)"},{"key":"ref_4","first-page":"398","article-title":"CBE from CL-PKE: A generic construction and efficient schemes","volume":"LNCS Volume 3386","author":"Paterson","year":"2005","journal-title":"Proceedings of the Public Key Cryptography (PKC\u201905)"},{"key":"ref_5","first-page":"474","article-title":"On constructing certificateless cryptosystems from identity based encryption","volume":"LNCS Volume 3958","author":"Libert","year":"2006","journal-title":"Proceedings of the Public Key Cryptography (PKC\u201906)"},{"key":"ref_6","first-page":"308","article-title":"Certificateless signature revisited","volume":"LNCS Volume 4586","author":"Huang","year":"2007","journal-title":"Proceedings of the Australasian Conference on Information Security and Privacy (ACISP\u201906)"},{"key":"ref_7","first-page":"463","article-title":"Certificateless public key encryption secure against malicious KGC attacks in the standard model","volume":"14","author":"Hwang","year":"2008","journal-title":"J. Universal Comput. Sci."},{"key":"ref_8","unstructured":"Chen, Y.C., Tso, R., Susilo, W., Huang, X., and Horng, G. (2013). Certificateless signatures: Structural extensions of security models and new provably secure schemes. Cryptology ePrint Archiv: Report 2013\/193, IACR."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"663","DOI":"10.15388\/Informatica.2015.70","article-title":"Certificateless signature with strong unforgeability in the standard model","volume":"26","author":"Hung","year":"2015","journal-title":"Informatica"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1093\/comjnl\/bxr098","article-title":"Efficient revocable ID-based encryption with a public channel","volume":"55","author":"Tseng","year":"2012","journal-title":"Comput. J."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3713","DOI":"10.1002\/sec.1294","article-title":"Efficient revocable certificateless public key encryption with a delegated revocation authority","volume":"8","author":"Tsai","year":"2015","journal-title":"Secur. Commun. Netw."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1093\/comjnl\/bxt040","article-title":"Efficient revocable certificateless encryption secure in the standard model","volume":"57","author":"Shen","year":"2014","journal-title":"Comput. J."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1843","DOI":"10.4304\/jcp.9.8.1843-1850","article-title":"A revocable certificateless signature scheme","volume":"9","author":"Sun","year":"2014","journal-title":"J. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"728591","DOI":"10.1155\/2014\/728591","article-title":"Secure certificateless signature with revocation in the standard model","volume":"2014","author":"Tsai","year":"2014","journal-title":"Math. Probl. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"549","DOI":"10.15388\/Informatica.2016.99","article-title":"A revocable certificateless short signature scheme and its authentication application","volume":"27","author":"Hung","year":"2016","journal-title":"Informatica"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J. (2009). Introduction to Post-Quantum Cryptography. Post-Quantum Cryptography, Springer.","DOI":"10.1007\/978-3-540-88702-7"},{"key":"ref_18","first-page":"112","article-title":"Public-key cryptosystems from lattice reduction problems","volume":"LNCS Volume 1294","author":"Goldreich","year":"1997","journal-title":"Proceedings of the Advances in Cryptology (CRYPTO\u201997)"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00145-008-9031-0","article-title":"Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures","volume":"22","author":"Nguyen","year":"2009","journal-title":"J. Cryptol."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17\u201320). How to use a short basis: Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the Annual Symposium on the Theory of Computing (STOC\u201908), Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_21","first-page":"598","article-title":"Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures","volume":"LNCS Volume 5912","author":"Lyubashevsky","year":"2009","journal-title":"Proceedings of the Advances in Cryptology (ASIACRYPT\u201909)"},{"key":"ref_22","first-page":"738","article-title":"Lattice signatures without trapdoors","volume":"LNCS Volume 7237","author":"Lyubashevsky","year":"2012","journal-title":"Proceedings of the Advances in Cryptology (EUROCRYPT\u201912)"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-642-12929-2_14","article-title":"Strongly unforgeable signatures and hierarchical identity-based signatures over lattices without random oracles","volume":"LNCS Volume 6061","author":"Ruckert","year":"2010","journal-title":"Proceedings of the Post-Quantum Cryptography (PQC\u201910)"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/sec.531","article-title":"Efficient and strongly unforgeable identity-based signature scheme over lattices in the standard model","volume":"6","author":"Liu","year":"2013","journal-title":"Secur. Commun. Netw."},{"key":"ref_25","unstructured":"Tian, M., and Huang, L. (2014, January 2\u20134). Efficient identity-based signature from lattices. Proceedings of the IFIP International Information Security Conference (SEC\u201914), Marrakech, Morocco."},{"key":"ref_26","first-page":"22","article-title":"Efficient identity-based encryption over NTRU lattices","volume":"LNCS Volume 8874","author":"Ducas","year":"2014","journal-title":"Proceedings of the Advances in Cryptology (ASIACRYPT\u201914)"},{"key":"ref_27","first-page":"126","article-title":"Adaptive secure revocable identity-based signature scheme over lattices","volume":"41","author":"Xiang","year":"2015","journal-title":"Comput. Eng."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Goyal, V., and Kumar, V. (2008, January 27\u201331). Identity-based encryption with efficient revocation. Proceedings of the ACM Conference on Computer and Communications Security (ACM CCS\u201908), Alexandria, VA, USA.","DOI":"10.1145\/1455770.1455823"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"7571201","DOI":"10.1155\/2017\/7571201","article-title":"Revocable ID-based signature with short size over lattices","volume":"2017","author":"Hung","year":"2017","journal-title":"Secur. Commun. Netw."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1002\/sec.1105","article-title":"Certificateless and certificate-based signatures from lattices","volume":"8","author":"Tian","year":"2105","journal-title":"Secur. Commun. Netw."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","article-title":"Worst-case to average-case reductions based on Gaussian measure","volume":"37","author":"Micciancio","year":"2007","journal-title":"SIAM J. Comput."},{"key":"ref_32","first-page":"122","article-title":"Ntrusign: Digital signatures using the ntru lattice","volume":"LNCS Volume 2612","author":"Hoffstein","year":"2003","journal-title":"Proceedings of the Cryptographers\u2019 Track at the RSA Conference (CT-RSA\u201903)"},{"key":"ref_33","first-page":"700","article-title":"Trapdoors for lattices: Simpler, tighter, faster, smaller","volume":"LNCS Volume 7237","author":"Micciancio","year":"2012","journal-title":"Proceedings of the Advances in Cryptology (EUROCRYPT\u201912)"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ajtai, M. (1996, January 22\u201324). Generating hard instances of lattice problems. Proceedings of the ACM Symposium on Theory of Computing (STOC\u201996), Philadelphia, PA, USA.","DOI":"10.1145\/237814.237838"},{"key":"ref_35","unstructured":"Stehle, D., and Steinfeld, R. (2013). Making NTRUEnrypt and NTRUSign as secure as standard worst-case problems over ideal lattices. Cryptology ePrint Archive: Report 2013\/4, IACR."},{"key":"ref_36","first-page":"1","article-title":"On ideal lattices and learning with errors over rings","volume":"LNCS Volume 6110","author":"Lyubashevsky","year":"2010","journal-title":"Proceedings of the Advances in Cryptology (EUROCRYPT\u201910)"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s001450010003","article-title":"Security arguments for digital signatures and blind signatures","volume":"13","author":"Pointcheval","year":"2000","journal-title":"J. Cryptol."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/9\/10\/242\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:47:55Z","timestamp":1760208475000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/9\/10\/242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,20]]},"references-count":37,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2017,10]]}},"alternative-id":["sym9100242"],"URL":"https:\/\/doi.org\/10.3390\/sym9100242","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,20]]}}}