Identity-based Strong Designated Verifier Signature Research Articles

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.

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.

ID-Based Strong Designated Verifier Signature over R-SIS Assumption

In this paper, we propose an ID-based strong designated verifier signature (SDVS) over R-SIS assumption in the random model. We remove pre-image sampling function and Bonsai trees such complex structures used in previous lattice-based SDVS schemes. We only utilize simple rejection sampling to protect the security of our scheme. Hence, we will show our design has the shortest signature size comparing with existing lattice-based ID-based SDVS schemes. In addition, our scheme satisfies anonymity (privacy of signer’s identity) proved in existing schemes rarely, and it can resist side-channel attacks with uniform sampling.

A Lightweight ID-Based Strong Designated Verifier Signature Scheme against Key-Compromise Attacks

A Lightweight ID-Based Strong Designated Verifier Signature Scheme against Key-Compromise Attacks

A New Efficient Identity-based Strong Designated Verifier Signature Scheme with Message Recovery

Designated verifier signature (DVS) allows the signer to convince a verifier the validity of a statement but prevent the verifier from transferring the conviction. Strong designated verifier signature (SDVS) is a variant of DVS, which could make it possible for a signer to convince only the designated verifier that the signature is made by the signer. Recently, many strong designated verifier signature schemes have been presented in identity based setting. Unfortunately, most of them can not satisfy the strongness and non-delegatability properties, and cannot be rigorously proved secure. Moreover, for some special applications, these schemes suffer from larger data size of communication. In this paper, we present an efficient identity-based strong designated verifier signature scheme with message recovery, and then rigorously analyze its security properties in the random oracle model. As far as we know, it is the first provably secure identity-based strong designated verifier signature scheme with message recovery, which can be used to sign an arbitrary long message, and can satisfy all the security properties including the existential unforgeability, strongness property, non-transferability and non-delegatability, etc.

Provably Secure and Efficient ID-based Strong Designated Verifier Signature Scheme with Message Recovery

Many ID-based strong designated verifier signature schemes have been proposed in recent years. However, most of them did not give the rigorous security proofs and did not satisfy the strongness property that anyone except the designated verifier can not check the validity of a designated verifier signature, In addition, considering some special applications, these schemes have larger data size of communication. To overcome those problems, exploiting message recovery techniques which are regarded as a useful method to shorten ID-based signatures' size, we put forward an efficient ID-based strong designated verifier signature schemes with message recovery and give its rigorous security proof in the random oracle model based on the hardness assumptions of the computational Bilinear Diffie-Hellman problem in this paper. To the best of our knowledge, it is the first ID-based strong designated verifier signature schemes with message recovery and rigorous security proofs. Due to its merits, it can be used in some special environments where the bandwidth is one of the main concerns, such as PDAs, cell phones, RFID etc.

Provably Secure and Efficient ID-based Strong Designated Verifier Signature Scheme with Message Recovery

Provably Secure and Efficient ID-based Strong Designated Verifier Signature Scheme with Message Recovery

Efficient certificate-based signature scheme with strong designated verifier

Concerning the flaw that it needs a fully credible third party in ID-based strong designated verifier signature and the low efficiency of existing schemes,taking the advantage of Certificate Authority(CA)'s low trust level in certificate-based public key cryptography,a new strong designated verifier signature scheme was proposed in this paper.Furthermore,the formal security analysis under assumed Bilinear Diffie-Hellman(BDH) problem in the random oracle model was presented.Performance analysis shows the scheme meets all properties of strong designated verifier signature schemes and enjoys higher correspondence efficiency used in bandwidth limited environment since the signature length is just one of the group elements.

A Novel Designated Verifier Signature Scheme Based on Bilinear Pairing

A designated verifier scheme can protect information from uncertainty. Only the designated verifier can verify the signature and make sure that the information is correct. In addition, a strong designated verifier scheme allows the verifier to maintain a transcript signature of the verifier's secret key. Recently, Yoon proposed an identity-based strong designated verifier signature scheme to solve the problems of some previously proposed schemes. Unfortunately, Yoon's scheme still has some weaknesses, such as inefficiency in the verifying phase and being vulnerable to replay-attack. To overcome these, we propose a novel designated verifier signature scheme in this paper.DOI: http://dx.doi.org/10.5755/j01.itc.42.3.2549

래티스에서 ID 기반의 강한 지정된 검증자 서명 기법

When a signer signs a message, strong designated verifier signature allows the signer to designate a verifier. Only the designated verifier can make sure that the signature is generated by the signer. In addition, no one except the designated verifier can know the signature generated by some signer. In this paper, we propose an identity-based strong designated verifier signature scheme where users` public keys are identities. Our proposed scheme is the first identity-based strong designated verifier scheme from lattices. Naturally, our proposed scheme is secure against quantum computing attacks and has low computational complexity.

Short designated verifier signature scheme and its identity-based variant

The notion of strong designated verifier signature was put forth by Jakobsson, Sako and Impagliazzo in 1996, but the formal definition was defined recently by Saeednia, Kremer and Markowitch in 2003 and revisited by Laguillaumie and Vergnaud in 2004. In this paper, we firstly propose the notion of short strong designated verifier signature scheme, and extend it to the short identity-based strong designated verifier scheme. Then, we propose the first construction of short strong designated verifier signature scheme. We also extend our scheme to construct a short identity-based strong designated verifier signature scheme. The size of the signature of our schemes is the shortest compared to any existing schemes reported in the literature. We provide formal security proofs for our schemes based on the random oracle model. Finally, we also discuss an extension of our scheme to construct a short strong designated verifier signature without random oracle.

A Novel ID-Based Strong Designated Verifier Signature Scheme

We construct an efficient and novel identity-based strong designated verifier signature (IBSDVS) scheme based on bilinear pairings, and provide the security proofs and efficiency analysis for the proposed scheme. Our IBSDVS scheme achieves higher efficiency and satisfies all the security requirements of the designated verifier signatures in identity-based cryptography.

Constructing Strong Identity-Based Designated Verifier Signatures with Self-Unverifiability

An identity-based strong designated verifier signature scheme provides restricted verifiability only for a verifier designated by a signer and proper privacy for the signer. In this paper, we show that strong designated verifier signature schemes do not satisfy the self-unverifiability requirement in the sense that not only exposure of the verifier's secret key but also of the signer's secret key enables an attacker to verify signatures, which should have been the exclusive right of the verifier. We also present a generic method to construct a strong identity-based designated verifier signature scheme with self-unverifiability from identity-based key encapsulation and identity-based key sharing schemes. We prove that a scheme constructed from our method achieves unforgeability, non-transferability, and self-unverifiability if the two underlying components are secure. To show the advantage of our method, we present an example that outputs short signatures and we analyze its performance.

Identity-based strong designated verifier signature revisited

Abstract Designated verifier signature (DVS) allows the signer to persuade a verifier the validity of a statement but prevent the verifier from transferring the conviction. Strong designated verifier signature (SDVS) is a variant of DVS, which only allows the verifier to privately check the validity of the signer’s signature. In this work we observe that the unforgeability model considered in the existing identity-based SDVS schemes is not strong enough to capture practical attacks, and propose to consider another model which is shown to be strictly stronger than the old one. We then propose a new efficient construction of identity-based SDVS scheme, which is provably unforgeable under the newly proposed definition, based on the hardness of Computational Diffie–Hellman problem in the random oracle model. Our scheme is perfectly non-transferable in the sense that the signer and the designated verifier can produce identically distributed signatures on the same message. Besides, it is the first IBSDVS scheme that is non-delegatable with respect to (an identity-based variant of) the definition proposed by Lipmaa et al. (ICALP 2005).

Forgery attacks on Kang et al.’s identity-based strong designated verifier signature scheme and its improvement with security proof

Recently, Kang et al. proposed a new identity-based strong designated verifier signature scheme (ID-SDVS) and identity-based designated verifier proxy signature scheme (ID-DVPS). They claimed that their schemes are unforgeable. However, we found out that their schemes are universally forgeable in the sense that anyone can forge valid ID-SDVS and ID-DVPS on an arbitrary message without the knowledge of the secret key of either the signer or the designated verifier. Finally, we propose an improved ID-SDVS which is unforgeable. We give formal security proof of universal unforgeability of our scheme. We also give an improved ID-DVPS.

Delegatability of an Identity Based Strong Designated Verifier Signature Scheme

In 2007, Kancharla et al. proposed an identity-based strong designated verifier signature (IBSDVS) scheme based on bilinear pairings, and claimed it unforgeable and non-delegatable. However, in this paper, we show that this scheme is actually delegatable.

키 노출 공격에 안전한 ID-기반의 강한 지정된 검증자 서명 기법

A strong designated verifier signature scheme is a special type of signature scheme which provides signer anonymity by enabling the specified recipient, called a designated verifier, to simulate a signature which is indistinguishable from the signer`s signature. It has many applications such as software distribution or electronic voting. In this paper, we consider two important security properties of strong designated verifier signature scheme - source hiding and security against key-compromise attack. We show that the two properties cannot be achieved at the same time. Finally, we present a new ID-based strong designated verifier signature scheme which is secure against key-compromise attack.

Identity-based strong designated verifier signature schemes: Attacks and new construction

A strong designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party, and no third party can even verify the validity of a designated verifier signature. We show that anyone who intercepts one signature can verify subsequent signatures in Zhang-Mao ID-based designated verifier signature scheme and Lal-Verma ID-based designated verifier proxy signature scheme. We propose a new and efficient ID-based designated verifier signature scheme that is strong and unforgeable. As a direct corollary, we also get a new efficient ID-based designated verifier proxy signature scheme.

A novel identity-based strong designated verifier signature scheme

Unlike ordinary digital signatures, a designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party. In a strong designated verifier signature scheme, no third party can even verify the validity of a designated verifier signature, since the designated verifier’s private key is required in the verifying phase. Firstly, this paper proposes the model of identity-based strong designated verifier signature scheme based on bilinear pairings by combining identity-based cryptosystem with the designated verifier signature scheme, and then, provides one concrete strong identity-based designated verifier signature scheme, which has short size of signature, low communication and computational cost. We provide security proofs for our scheme.

A novel ID-based designated verifier signature scheme

In a designated verifier signature scheme, only the designated verifier can verify the validity of a signature. This paper studies an Identity-based Strong Designated Verifier Signature (IBSDVS) scheme based on bilinear pairings by combining ID-based cryptosystem with the designated verifier signature scheme. We analyze the security of the scheme and the result shows that the security of our proposed scheme is closely related to the Bilinear Diffie–Hellman problem and the scheme is against delegatability attack.