Designated Verifier Signature Research Articles

A practical convertible quantum signature scheme with public verifiability into universal quantum designated verifier signature using self-certified public keys

A practical convertible quantum signature scheme with public verifiability into universal quantum designated verifier signature using self-certified public keys

Designing a Robust Quantum Signature Protocol Based on Quantum Key Distribution for E-Voting Applications

The rapid advancement of internet technology has raised attention to the importance of electronic voting in maintaining democracy and fairness in elections. E-voting refers to the use of electronic technology to facilitate the casting and counting of votes in elections. The need for designated verification arises from concerns about voter privacy, auditability, and the prevention of manipulation. Traditional e-voting systems use cryptographic techniques for security but lack verifiable proof of integrity. Integrating e-voting with a quantum designated verifier could address these challenges by leveraging the principles of quantum mechanics to enhance security and trustworthiness. In light of this, we propose a quantum e-voting scheme that uses a designated verifier signature. To ensure the confidentiality and authenticity of the voting process, the scheme uses quantum features like the no-cloning theorem and quantum key distribution. The proposed scheme has security properties like source hiding, non-transferability, and message anonymity. The proposed scheme is resistant to many quantum attacks, such as eavesdropping and impersonation. Due to designated verification, the scheme minimizes the risk of tempering. This paper provides a detailed description of the proposed scheme and analyzes its security properties. Therefore, the proposed scheme is efficient, practical, and secure.

Lattice-based strong designated verifier signature with non-delegatability

Strong designated verifier signature (SDVS) is a special type of digital signatures which provides authentication of a message without providing non-repudiation property. More specifically, SDVS can enable that it is impossible for any entity, other than the designated verifier, to recognize the validity of a given signature. Although there have been several proposals of lattice-based SDVS schemes since the first non-quantum resistant scheme proposed by Jakobsson et al. at EUROCRYPT 1996, all the existing lattice-based ones cannot achieve a security notion called non-delegatablity (ND), which was an essential property introduced by Lipmaa et al. at ICALP 2005 when considering an SDVS in scenarios where the responsibility of the signer is important and the signing rights cannot be delegated to another entity. Therefore, in this work, we provide the first lattice-based SDVS scheme that offers non-delegatablity (i.e., neither the signer nor the designated verifier can delegate the signing rights to other entities without the revealment of their corresponding private keys), and thus, resolve a prominent open problem posed by previous works. Moreover, we achieve this non-trivial feat in a relatively simple manner. Starting with Lyubashevsky’s lattice signatures without trapdoors at EUROCRYPT 2012 - which is arguably the first practical alternative method in general lattices for designing digital signatures not adopting the “hash-and-sign” methodology, we introduce simple-but-insightful tweaks allowing to upgrade it directly into an SDVS with non-delegatablity. The scheme satisfies the strong security requirements of Lipmaa et al.’s model and is proven secure in the random oracle model under the short integer solution (SIS) and the learning with errors (LWE) assumptions.

Efficient attribute-based strong designated verifier signature scheme based on elliptic curve cryptography.

In an attribute-based strong designated verifier signature, a signer who satisfies the access structure signs the message and assigns it to a verifier who satisfies the access structure to verify it, which enables fine-grained access control for signers and verifiers. Such signatures are used in scenarios where the identity of the signer needs to be protected, or where the public verifiability of the signature is avoided and only the designated recipient can verify the validity of the signature. To address the problem that the overall overhead of the traditional attribute-based strong designated verifier signature scheme is relatively large, an efficient attribute-based strong designated verifier signature scheme based on elliptic curve cryptography is proposed, as well as a security analysis of the new scheme given in the standard model under the difficulty of the elliptic curve discrete logarithm problem (ECDLP). On the one hand, the proposed scheme is based on elliptic curve cryptography and uses scalar multiplication on elliptic curves, which is computationally lighter, instead of bilinear pairing, which has a higher computational overhead in traditional attribute-based signature schemes. This reduces the computational overhead of signing and verification in the system, improves the efficiency of the system, and makes the scheme more suitable for resource-constrained cloud end-user scenarios. On the other hand, the proposed scheme uses LSSS (Linear Secret Sharing Schemes) access structure with stronger access policy expression, which is more efficient than the "And" gate or access tree access structure, making the computational efficiency of the proposed scheme meet the needs of resource-constrained cloud end-users.

Designated Verifier Signature with Claimability

Designated Verifier Signature with Claimability

Efficient Certificateless Aggregate Designated Verifier Signature With Conditional Privacy Preserving in VANETs

Efficient Certificateless Aggregate Designated Verifier Signature With Conditional Privacy Preserving in VANETs

Quantum designated verifier signature without third party

Quantum designated verifier signature without third party

Semi- quantum Designated Verifier Signature Scheme

Semi- quantum Designated Verifier Signature Scheme

Certificateless directed signature scheme without bilinear pairing

ABSTRACT In Eurocrypt’96, the concept of Designated Verifier Signature was proposed. Such signatures can only be verified by a single designated verifier specified during signature creation. However, there exist situations in which the signer, as well as the designated verifier, should be equipped with the ability to check the validity of the signature. At the same time, either of them should be able to help third parties to verify the signature. This is achieved by Directed Signature Schemes. In this paper, we consider directed signatures in the certificateless cryptography setting and propose an efficient pairing-free certificateless directed signature (CLDS) scheme. Then, we prove that the proposed CLDS scheme meets the needed security requirements in the random oracle model and under the assumption of the hardness of discrete logarithm and Gap Diffie-Hellman problems. We also compare the proposed scheme with the related ones to indicate the overall superiority of the proposed CLDS scheme.

Quantum Designated Verifier Signature Scheme with Semi-Trusted Third-Party

Quantum Designated Verifier Signature Scheme with Semi-Trusted Third-Party

Privacy-preserving authentication scheme based on zero trust architecture

Zero trust architecture is an end-to-end approach for server resources and data security which contains identity authentication, access control, dynamic evaluation, and so on. This work focuses on authentication technology in the zero trust network. In this paper, a Traceable Universal Designated Verifier Signature (TUDVS) is used to construct a privacy-preserving authentication scheme for zero trust architecture. Specifically, when a client requests access to server resources, we want to protect the client's access privacy which means that the server administrator cannot disclose the client's access behavior to any third party. In addition, the security of the proposed scheme is proved and its efficiency is analyzed. Finally, TUDVS is applied to the single packet authorization scenario of the zero trust architecture to prove the practicability of the proposed scheme.

A quantum resistant universal designated verifier signature proof

<abstract><p>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.</p></abstract>

A Hash-Based Quantum-Resistant Designated Verifier Signature Scheme

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.

Ibn Sina: A patient privacy‐preserving authentication protocol in medical internet of things

The prosperous advancement in Medical Internet of Things (MIoT) technologies has hastened the development of healthcare systems. MIoT improves the traditional medical facilities through periodically monitor of patient’s health records. Electronic Medical Records (EMRs) are sensitive private data and needs efficient secure and private schemes that interchange these EMRs between healthcare providers and patients. Most of the current privacy preserving schemes do not provide the desired privacy level and suffer from computation and communication overheads.The length of an IDentity-based Strong Designated Verifier Signature (IDSDVS) is short. IDSDVS has low communication and computational costs. Moreover, it gives the signer (the patient) a control over whom can verify his signature. This feature allows patients to choose the verifier and keep the privacy of their Electronic Medical Records (EMR). This paper presents a new privacy-preserving authentication protocol in Medical Internet of Things (MIOT) that achieves patient privacy in MIoT. Precisely, we propose two new IDSDVS schemes. Utilizing the random oracle model, we show that these two schemes satisfy the security conditions. Furthermore, we evaluate the proposed IDSDVS schemes by comparing them to related schemes in the literature. The proposed schemes achieve lower costs of communication and computation than related schemes.

Anonymous attribute-based designated verifier signature

An attribute-based signature (ABS), is a cryptographic scheme where someone can sign a message using any kind of predicates verified by the attributes he owns. For such scheme, it is expected to be impossible for users to collude to sign a message if none of them is originally able to sign the message on his own. The main advantage of such a solution is that the signer can remain anonymous in the set of users fulfilling the chosen predicate. It can then be used for anonymous authentication for instance. In this paper, our main contribution is a new designated verifier attribute based signature scheme. In other words, the signer is using his attributes to authenticate a message according to a predicate, and while doing so he can pick another policy such that only users owning attributes fulfilling this policy can check the validity of the signature. It can be used to extend anonymous authentication, ensuring that the designated verifier cannot prove to anyone that a valid authentication has been performed. In addition to classical anonymity, this also increases the privacy of users as no further statistics on valid connection can be deduced. To do so, we first propose a generic construction of this primitive using standard cryptographic building blocks. An instantiation of this primitive is then described and proved through security games under the Symmetric External Diffie–Hellman (\(\textsf {SXDH}\)) assumption. This main contribution is compared to state-of-the-art solutions in terms of both security and efficiency.

Report When Malicious: Deniable and Accountable Searchable Message-Moderation System

Encrypted retrieval ensures the secure retrieval over the encrypted data without sacrificing the confidentiality. Its applications in the database systems have brought this primitive under the spotlight. Once the malicious sender sends the wrong message, conventional encrypted retrieval is arduous to provide message-moderation and even abuse reporting arises when any receiver is allowed to fabricate and convince a malicious message. We introduce the idea of searchable message-moderation, a newly exquisite framework named CleanSE that enables the system to simultaneously provide encrypted retrieval and fallacious reporting resistance. In a nutshell, CleanSE is achieved via a securely technical combination of asymmetric message franking and searchable encryption. We design two CleanSE schemes. The first, called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Recon</i> , leverages designated verifier signatures to generate a report proof such as to prevent fallacious report and undeniability, and assists with designated-server searchable encryption to protect confidentiality and privacy. Our improved scheme is called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Reclean</i> . Compared with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Recon</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Reclean</i> adds an additional algorithm, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathsf {Clean}$ </tex-math></inline-formula> , to filter forged message and employs asymmetric message franking to provide stronger deniability and accountability. We implement and evaluate prototype of our CleanSE system to highlight its feasibility and practicality.

Comments On The Cryptanalysis Of An Identity-Based Strong Designated Verifier Signature Scheme

In this paper, we explain that the proposed modification to an identity-based strong designated verifier signature scheme (Lecture Notes in Electrical Engineering, vol. 164, no. 1, Springer-Verlag, 2012) is not secure. This scheme has a short signature size, low communication cost, and low computational cost. But, it does not satisfy the required authentication property in a designated verifier signature scheme. In particular, we introduce an attack that enables anybody to verify the signature.

Quantum public-key designated verifier signature

Quantum public-key designated verifier signature

A practical quantum designated verifier signature scheme for E-voting applications

A practical quantum designated verifier signature scheme for E-voting applications

A Strong Designated Verifier Signature Scheme with Hybrid Cryptographic Hard Problems

The security of the most of the existing strong designated verifier signature (SDVS) scheme are based on a single cryptographic hard problem. Although these schemes seem secure today, there is a possibility for an adversary to find a solution for this problem in the future and if this happens, then such SDVS schemes will no longer be secure. We develop a new SDVS scheme based on hybrid problems; factorization and discrete logarithm. The new developed scheme provides a greater security level than those previous designated SDVS schemes and satisfies the security properties and requirements of a SDVS scheme.