A Hash-Based Quantum-Resistant Designated Verifier Signature Scheme

P. Thanalakshmi, R. Anitha, N. Anbazhagan, Chulho Park, Gyanendra Prasad Joshi and Changho Seo
Additional contact information
P. Thanalakshmi: Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore 641004, India
R. Anitha: Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore 641004, India
N. Anbazhagan: Department of Mathematics, Alagappa University, Karaikudi 630004, India
Chulho Park: Department of Convergence Science, Kongju National University, Gongju 32588, Korea
Gyanendra Prasad Joshi: Department of Computer Science and Engineering, Sejong University, Seoul 05006, Korea
Changho Seo: Department of Convergence Science, Kongju National University, Gongju 32588, Korea

Mathematics, 2022, vol. 10, issue 10, 1-12

Abstract: Digital signatures are unsuitable for specific applications that are sensitive on a personal or commercial level because they are universally verifiable. Jakobsson et al. proposed the Designated Verifier Signature (DVS) system, which only allows the intended verifier to validate a message’s signature. It prohibits the disclosure of a conviction to a third party. This functionality is useful in applications that require both authenticity and signer privacy, such as electronic voting and tender calls. The vast majority of current DVS schemes are based on difficult number theory problems such as integer factorization or discrete log problems over various groups. The development of a large-scale quantum computer would render these schemes unsafe. As a result, it is critical to develop quantum-resistant DVS methods. In both quantum and classical computers, signatures based on one-way functions are more efficient and secure. They have several advantages over digital signatures based on trapdoor functions. As a result, hash-based signatures are now considered viable alternatives to number-theoretic signatures. Existing hash-based signatures, on the other hand, are easily verifiable by anyone. As a result, they do not protect the signer’s identity. In addition, they are one-time signatures. This paper presents a hash-based multi-time designated verifier signature scheme that ensures signer anonymity. The unforgeability of the signature scheme is also tested in the random oracle model under chosen message attack. The properties such as non-transferability and non-delegatability are investigated.

Keywords: digital signatures; hash-based cryptography; designated verifier signatures; homomorphic hash function; preimage resistance; random oracle model (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/10/1642/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/10/1642/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:10:p:1642-:d:813619

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().