IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i5p743-d1599034.html
   My bibliography  Save this article

Efficient Identity-Based Universal Designated Verifier Signature Proof Systems

Author

Listed:
  • Yifan Yang

    (College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China)

  • Xiaotong Zhou

    (School of Cyber Science and Engineering, Wuhan University, Wuhan 430072, China)

  • Binting Su

    (Network and Data Center, Fujian Normal University, Fuzhou 350117, China)

  • Wei Wu

    (College of Education Sciences, Hong Kong University of Science and Technology (Guangzhou), Guangzhou 511455, China)

Abstract

The implementation of universal designated verifier signatures proofs (UDVSPs) enhances data privacy and security in various digital communication systems. However, practical applications of UDVSP face challenges such as high computational overhead, onerous certificate management, and complex public key initialization. These issues hinder UDVSP adoption in daily life. To address these limitations, existing solutions attempt to eliminate bilinear pairing operations, but their proposal still involves cumbersome certificate management and inherent interactive operations that can sometimes significantly degrade system efficiency. In this paper, we first utilize the identity-based (ID-based) SM2 digital signature scheme to construct an ID-based UDVSP system which sidesteps the cumbersome certificate management issue. To further remove the interactive requirement, we also employ the OR proof and Fiat–Shamir technologies to design the other ID-based UDVSP system. Our designs not only possess the same bilinear pairing-free advantage as Lin et al.’s proposal, but also achieve the certificate-free or non-interactive goals. Security proofs and performance analysis confirm the viability and efficiency of our systems.

Suggested Citation

  • Yifan Yang & Xiaotong Zhou & Binting Su & Wei Wu, 2025. "Efficient Identity-Based Universal Designated Verifier Signature Proof Systems," Mathematics, MDPI, vol. 13(5), pages 1-14, February.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:743-:d:1599034
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/5/743/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/5/743/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:743-:d:1599034. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.