{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:18:27Z","timestamp":1760149107027,"version":"build-2065373602"},"reference-count":62,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T00:00:00Z","timestamp":1688428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>This paper presents a new threshold signature scheme based on Damgaard\u2019s work. The proposed scheme allows for changing the message signature threshold, thereby improving the flexibility of the original Damgaard scheme. This scheme can be applied as a user authentication system using wearable devices. Based on the hardness of lattice problems, this scheme is resistant to attacks on a quantum computer, which is an advantage over the currently used multi-factor authentication schemes. The scheme\u2019s security relies on the computational complexity of the Module-LWE and Module-SIS problems, as well as the Shamir secret sharing scheme\u2019s security.<\/jats:p>","DOI":"10.3390\/cryptography7030033","type":"journal-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:37:28Z","timestamp":1688517448000},"page":"33","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Threshold Lattice-Based Signature Scheme for Authentication by Wearable Devices"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1823-7877","authenticated-orcid":false,"given":"Anton","family":"Leevik","sequence":"first","affiliation":[{"name":"Faculty of Secure Information Technologies, ITMO University, 197101 Saint Petersburg, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5544-2434","authenticated-orcid":false,"given":"Vadim","family":"Davydov","sequence":"additional","affiliation":[{"name":"Faculty of Secure Information Technologies, ITMO University, 197101 Saint Petersburg, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0924-6221","authenticated-orcid":false,"given":"Sergey","family":"Bezzateev","sequence":"additional","affiliation":[{"name":"Department of Information Security, State University of Aerospace Instrumentation, 190000 Saint Petersubrg, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Ometov, A., Bezzateev, S., M\u00e4kitalo, N., Andreev, S., Mikkonen, T., and Koucheryavy, Y. (2018). Multi-Factor Authentication: A Survey. Cryptography, 2.","DOI":"10.3390\/cryptography2010001"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"8835","DOI":"10.1007\/s12652-020-02672-x","article-title":"A review on lightweight cryptography for Internet-of-Things based applications","volume":"12","author":"Rao","year":"2021","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"McKay, K., Bassham, L., S\u00f6nmez Turan, M., and Mouha, N. (2017). Report on Lightweight Cryptography, National Institute of Standards and Technology. NIST Interagency\/Internal Report (NISTIR).","DOI":"10.6028\/NIST.IR.8114"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ometov, A., Masek, P., Malina, L., Florea, R., Hosek, J., Andreev, S., Hajny, J., Niutanen, J., and Koucheryavy, Y. (2016, January 14\u201318). Feasibility characterization of cryptographic primitives for constrained (wearable) IoT devices. Proceedings of the 2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), Sydney, Australia.","DOI":"10.1109\/PERCOMW.2016.7457161"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1931","DOI":"10.1109\/LCOMM.2019.2937782","article-title":"Cryptographic algorithms in wearable communications: An empirical analysis","volume":"23","author":"Coelho","year":"2019","journal-title":"IEEE Commun. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1504\/WRSTSD.2022.119327","article-title":"An analysis of a secure communication for healthcare system using wearable devices based on elliptic curve cryptography","volume":"18","author":"Perumal","year":"2022","journal-title":"World Rev. Sci. Technol. Sustain. Dev."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez-\u00c1lvarez, L., Bull\u00f3n P\u00e9rez, J.J., Batista, F.K., and Queiruga-Dios, A. (2022). Security Threats and Cryptographic Protocols for Medical Wearables. Mathematics, 10.","DOI":"10.3390\/math10060886"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10207-019-00464-9","article-title":"An elliptic curve cryptography based enhanced anonymous authentication protocol for wearable health monitoring systems","volume":"19","author":"Sowjanya","year":"2020","journal-title":"Int. J. Inf. Secur."},{"key":"ref_9","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_10","first-page":"114","article-title":"A public-key cryptosystem based on algebraic","volume":"4244","author":"McEliece","year":"1978","journal-title":"Coding Thv."},{"key":"ref_11","unstructured":"Alabbadi, M., and Wicker, S.B. (1993, January 17\u201322). Digital signature schemes based on error-correcting codes. Proceedings of the IEEE International Symposium on Information Theory, San Antonio, TX, USA."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1049\/el:19900586","article-title":"Digital signature scheme based on error-correcting codes","volume":"26","author":"Xinmei","year":"1990","journal-title":"Electron. Lett."},{"key":"ref_13","first-page":"157","article-title":"Cryptanalysis and modification of digital signature scheme based on error-correcting code","volume":"2","author":"Harn","year":"1992","journal-title":"Electron. Lett."},{"key":"ref_14","unstructured":"Courtois, N.T., Finiasz, M., and Sendrier, N. (2001). Advances in Cryptology\u2014ASIACRYPT 2001, Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security Gold Coast, Australia, 9\u201313 December 2001, Springer. Proceedings 7."},{"key":"ref_15","first-page":"74","article-title":"Cryptosysten based on category of isogenious elliptic curves","volume":"2006\/145","author":"Rostovtsev","year":"2002","journal-title":"Inf. Secur. Probl. Comput. Syst."},{"key":"ref_16","unstructured":"Beullens, W., Kleinjung, T., and Vercauteren, F. (2019). Advances in Cryptology\u2014ASIACRYPT 2019, Proceedings of the 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, 8\u201312 December 2019, Springer. Proceedings, Part I."},{"key":"ref_17","first-page":"436","article-title":"SQISignHD: New Dimensions in Cryptography","volume":"2023","author":"Dartois","year":"2023","journal-title":"Cryptol. Eprint Arch."},{"key":"ref_18","unstructured":"De Feo, L., and Meyer, M. (2020). Public-Key Cryptography\u2013PKC 2020, Proceedings of the 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, 4\u20137 May 2020, Springer. Proceedings, Part II 23."},{"key":"ref_19","first-page":"76","article-title":"Improved threshold signature scheme CSI-FiSh with fast secret recovery","volume":"17","author":"Davydov","year":"2023","journal-title":"Her. Sib. State Univ. Telecommun. Inf. Sci."},{"key":"ref_20","unstructured":"Lamport, L. (1979). Constructing Digital Signatures from a One Way Function, Computer Science Laboratory, SRI International."},{"key":"ref_21","unstructured":"Merkle, R.C. (1979). Secrecy, Authentication, and Public Key Systems, Stanford University."},{"key":"ref_22","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., and Schwabe, P. (2019, January 11\u201315). The SPHINCS+ signature framework. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK."},{"key":"ref_23","unstructured":"Matsumoto, T., and Imai, H. (1988). Advances in Cryptology\u2014EUROCRYPT\u201988, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques Davos, Switzerland, 25\u201327 May 1988, Springer. Proceedings 7."},{"key":"ref_24","unstructured":"Patarin, J. (1995). Advances in Cryptology\u2014CRYPT0\u201995, Proceedings of the 15th Annual International Cryptology Conference Santa Barbara, CA, USA, 27\u201331 August 1995, Springer. Proceedings 15."},{"key":"ref_25","first-page":"164","article-title":"Rainbow, a new multivariable polynomial signature scheme","volume":"5","author":"Ding","year":"2005","journal-title":"Proc. ACNS"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3973","DOI":"10.1016\/j.camwa.2011.09.052","article-title":"Ring signature scheme based on multivariate public key cryptosystems","volume":"62","author":"Wang","year":"2011","journal-title":"Comput. Math. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00200-013-0190-3","article-title":"A multivariate based threshold ring signature scheme","volume":"24","author":"Petzoldt","year":"2013","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ajtai, M., and Dwork, C. (1997, January 4\u20136). A public-key cryptosystem with worst-case\/average-case equivalence. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, TX, USA.","DOI":"10.1145\/258533.258604"},{"key":"ref_29","unstructured":"Goldreich, O., Goldwasser, S., and Halevi, S. (1997). Advances in Cryptology\u2014CRYPTO\u201997, Proceedings of the 17th Annual International Cryptology Conference Santa Barbara, CA, USA, 17\u201321 August 1997, Springer. Proceedings 17."},{"key":"ref_30","unstructured":"Fouque, P.A., Hoffstein, J., Kirchner, P., Lyubashevsky, V., Pornin, T., Prest, T., Ricosset, T., Seiler, G., Whyte, W., and Zhang, Z. (2018). Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Submiss. NIST\u2019s Post-Quantum Cryptogr. Stand. Process, 36."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","article-title":"Crystals-dilithium: A lattice-based digital signature scheme","volume":"2018","author":"Ducas","year":"2018","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref_32","unstructured":"Cayrel, P.L., Lindner, R., R\u00fcckert, M., and Silva, R. (2010). Progress in Cryptology\u2013LATINCRYPT 2010, Proceedings of the First International Conference on Cryptology and Information Security in Latin America, Puebla, Mexico, 8\u201311 August 2010, Springer. proceedings 1."},{"key":"ref_33","unstructured":"Bettaieb, S., and Schrek, J. (2013). Post-Quantum Cryptography, Proceedings of the 5th International Workshop, PQCrypto 2013, Limoges, France, 4\u20137 June 2013, Proceedings 5, Springer."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Feng, T., Gao, Y., and Ma, J. (2010, January 7\u20139). Changeable threshold signature scheme based on lattice theory. Proceedings of the 2010 International Conference on E-Business and E-Government, Guangzhou, China.","DOI":"10.1109\/ICEE.2010.335"},{"key":"ref_35","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., and Whyte, W. (2003). Topics in Cryptology\u2014CT-RSA 2003, Proceedings of The Cryptographers\u2019 Track at the RSA Conference 2003, San Francisco, CA, USA, 13\u201317 April 2003, Springer."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Wang, K., Xu, Q., and Zhang, G. (2013, January 14\u201315). A secure threshold signature scheme from lattices. Proceedings of the 2013 Ninth International Conference on Computational Intelligence and Security, Emei Mountain, China.","DOI":"10.1109\/CIS.2013.105"},{"key":"ref_37","unstructured":"Choi, R., and Kim, K. (2014, January 21\u201324). Lattice-based threshold signature with message block sharing. Proceedings of the 31st Symposium on Cryptography and Information Security, Kagoshima, Japan."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1049\/ise2.12007","article-title":"An efficient lattice-based threshold signature scheme using multi-stage secret sharing","volume":"15","author":"Pilaram","year":"2021","journal-title":"IET Inf. Secur."},{"key":"ref_39","first-page":"2","article-title":"An efficient lattice based multi-stage secret sharing scheme","volume":"14","author":"Pilaram","year":"2015","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_40","first-page":"700","article-title":"Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller","volume":"7237","author":"Micciancio","year":"2012","journal-title":"Eurocrypt"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Kirshanova, E., Stehl\u00e9, D., and Yadav, A. (2022, January 7\u201311). Practical, round-optimal lattice-based blind signatures. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, Los Angeles, CA, USA.","DOI":"10.1145\/3548606.3560650"},{"key":"ref_42","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S., Jain, A., Kim, S., Rasmussen, P.M., and Sahai, A. (2018). Advances in Cryptology\u2013CRYPTO 2018, Proceedings of the 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, 19\u201323 August 2018, Springer. Proceedings, Part I 38."},{"key":"ref_43","unstructured":"Lyubashevsky, V. (2009). Advances in Cryptology\u2013ASIACRYPT 2009, Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, 6\u201310 December 2009, Springer. Proceedings 15."},{"key":"ref_44","unstructured":"Lyubashevsky, V. (2012). Advances in Cryptology\u2014EUROCRYPT 2012, Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, 15\u201319 April 2012, Springer. Proceedings 31."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation by smart cards","volume":"4","author":"Schnorr","year":"1991","journal-title":"J. Cryptol."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s00145-022-09425-3","article-title":"Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices","volume":"35","author":"Orlandi","year":"2022","journal-title":"J. Cryptol."},{"key":"ref_47","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., and Peikert, C. (2018). Security and Cryptography for Networks, Proceedings of the 11th International Conference, SCN 2018, Amalfi, Italy, 5\u20137 September 2018, Springer."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Bezzateev, S., Davydov, V., and Ometov, A. (2020). On Secret Sharing with Newton\u2019s Polynomial for Multi-Factor Authentication. Cryptography, 4.","DOI":"10.3390\/cryptography4040034"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Buchmann, J., and Dahmen, E. (2009). Post-Quantum Cryptography, Springer.","DOI":"10.1007\/978-3-540-88702-7"},{"key":"ref_51","unstructured":"(2013). Sphere Packings, Lattices and Groups, Springer Science & Business Media."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Ajtai, M. (1996, January 22\u201324). Generating hard instances of lattice problems. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237838"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0020-0190(99)00083-6","article-title":"Approximating shortest lattice vectors is not harder than approximating closest lattice vectors","volume":"71","author":"Goldreich","year":"1999","journal-title":"Inf. Process. Lett."},{"key":"ref_54","unstructured":"Ajtai, M. (1998, January 23\u201326). The shortest vector problem in L2 is NP-hard for randomized reductions. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, TX, USA."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","article-title":"On lattices, learning with errors, random linear codes, and cryptography","volume":"56","author":"Regev","year":"2009","journal-title":"J. ACM (JACM)"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2633600","article-title":"(Leveled) fully homomorphic encryption without bootstrapping","volume":"6","author":"Brakerski","year":"2014","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","article-title":"Worst-case to average-case reductions for module lattices","volume":"75","author":"Langlois","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17\u201320). Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2535925","article-title":"On ideal lattices and learning with errors over rings","volume":"60","author":"Lyubashevsky","year":"2013","journal-title":"J. ACM (JACM)"},{"key":"ref_60","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."},{"key":"ref_61","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., and Stehle, D. (2023, January 15). CRYSTALS\u2014Dilithium: Digital Signatures from Module Lattices. Cryptology ePrint Archive, Paper 2017\/633. Available online: https:\/\/eprint.iacr.org\/2017\/633."},{"key":"ref_62","unstructured":"Pettit, M. (2021). Cryptology and Network Security, Proceedings of the 20th International Conference, CANS 2021, Vienna, Austria, 13\u201315 December 2021, Springer."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:05:46Z","timestamp":1760126746000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,4]]},"references-count":62,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["cryptography7030033"],"URL":"https:\/\/doi.org\/10.3390\/cryptography7030033","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2023,7,4]]}}}