AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (432 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

A quantum resistant universal designated verifier signature proof

P. Thanalakshmi1N. Anbazhagan2Gyanendra Prasad Joshi3Eunmok Yang4( )
Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore 641004, India
Department of Mathematics, Alagappa University, Karaikudi 630003, India
Department of Computer Science and Engineering, Sejong University, Seoul 05006, Korea
Department of Information Security, Cryptology and Mathematics, Kookmin University, Seoul 02707, Korea
Show Author Information

Abstract

In order to ensure that only the designated person can verify the signer's signature on the message, Steinfeld et al. introduced the concept of Universal Designated Verifier Signature (UDVS), which enables a designator who has obtained a signature on a message from the signer to designate the signature to any desired designated verifier. This idea was developed to address the privacy concerns of the signature holder at the time of certificate distribution. They are appropriate for applications that demand the designer's secrecy. The fact that the designated verifier must generate a public key with regard to the signer's public parameter for signature verification is a significant drawback of UDVS methods. In cases where the verifier is unable to begin the key generation procedure, this constraint is inapplicable. Baek et al. developed the idea of "Universal Designated Verifier Signature Proof (UDVSP)", which does not require the verifier's public key for verification, to get around this restriction. All existing UDVSP constructions are based on a discrete logarithm problem, which is vulnerable to quantum computer attacks. As a result, an efficient quantum resistant UDVSP is built on a hard problem in coding theory, as suggested by NIST reports. The scheme's security against forgeability and impersonation attacks is examined using the random oracle model.

CLC number: 11T71, 94A62

References

【1】
【1】
 
 
AIMS Mathematics
Pages 18234-18250

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Thanalakshmi P, Anbazhagan N, Joshi GP, et al. A quantum resistant universal designated verifier signature proof. AIMS Mathematics, 2023, 8(8): 18234-18250. https://doi.org/10.3934/math.2023927

4

Views

0

Downloads

0

Crossref

5

Web of Science

6

Scopus

Received: 03 March 2023
Revised: 18 April 2023
Accepted: 26 April 2023
Published: 15 August 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)