For the flaws in security analysis and the low efficiecy of existing ID-based strong designated verifier signature schemes,and based on bilinear mapping,a new signature scheme is proposed and implemented.The security analysis for cryptography security is carried out on the proposed scheme,thus to verify the security of the proposed scheme.The results show that the new scheme could satisfy the security requirements of non-transferability,unforgeability,privacy of signer identity and low computational complexity.

Identity-based Strong Designated Verifier Signature Scheme

\n Certificateless public key cryptography (CL-PKC) promises a practical resolution in establishing practical schemes, since it addresses two fundamental issues, namely the necessity of requiring certificate managements in traditional public key infrastructure (PKI) and the key escrow problem in identity-based (ID-based) setting concurrently. Signcryption is an important primitive that provides the goals of both encryption and signature schemes as it is more efficient than encrypting and signing messages consecutively. Since the concept of certificateless signcryption (CL-SC) scheme was put forth by Barbosa and Farshim in 2008, many schemes have been proposed where most of them are provable in the random oracle model (ROM) and only a few number of them are provable in the standard model. Very recently, Luo and Wan (Wireless Personal Communication, 2018) proposed a very efficient CL-SC scheme in the standard model. Furthermore, they claimed that their scheme is not only more efficient than the previously proposed schemes in the standard model, but also it is the only scheme which benefits from known session-specific temporary information security (KSSTIS). Therefore, this scheme would indeed be very practical. The contributions of this paper are 2-fold. First, in contrast to the claim made by Luo and Wan, we show that unfortunately Luo and Wan made a significant error in the construction of their proposed scheme. While their main intention is indeed interesting and useful, the failure of their construction has indeed left a gap in the research literature. Hence, the second contribution of this paper is to fill this gap by proposing a CL-SC scheme with KSSTIS, which is provably secure in the standard model.

Efficient Certificateless Signcryption in the Standard Model: Revisiting Luo and Wan’s Scheme from Wireless Personal Communications (2018)

Industrial Internet of Things (IIoT) is a new type of Internet of Things (IoT), which enables sensors to merge with several smart devices to monitor machine status, environment, and collect data from industrial devices. On the other hand, cloud computing provides a good platform for storing crowdsourced data of IIoT. Due to the semi-trusted nature of cloud computing and communication through open channels, the IIoT environment needs security services such as confidentiality and authenticity. One such solution is provided by the identity-based signcryption. Unfortunately, the identity-based signcryption approach suffers from the key escrow problem. Certificateless signcryption is the alternative of identity-based signcryption that can resolve the key escrow problem. Here, we propose a lightweight certificateless signcryption approach for crowdsourced IIoT applications with the intention of enhancing security and decreasing the computational cost and communication overhead. The security and efficiency of the proposed approach are based on the hyper elliptic curve cryptosystem. The hyper elliptic curve is the advance version of the elliptic curve having small parameters and key size of 80 bits as compared to the elliptic curve which has 160-bits key size. Further, we validate the security requirements of our approach through automated validation of Internet security protocols and applications (AVISPA) tool with the help of high level protocol specification language (HLPSL). Moreover, our lightweight and secured scheme will attract low resource devices and will become a perk in the environment of IIoT.

https://www.mdpi.com/2073-8994/11/11/1386/pdf

A Lightweight and Provable Secured Certificateless Signcryption Approach for Crowdsourced IIoT Applications

Recently, Jiang et al. proposed a novel quantum multi-signature protocol based on locally indistinguishable orthogonal product states. Unfortunately, their protocol cannot resist against the forgery attack and disavowal attack. We investigate the security of Jiang et al.’s quantum multi-signature protocol and demonstrate the signature receiver’s forgery attack. What is more, the signature receiver can extend the forgery attack such that anyone can generate the forgery. On the other hand, their protocol is insecure against the signers’ disavowal attack, too. Then, an improved quantum multi-signature protocol is proposed. In the improved protocol, all the signers share the private keys with the signature receiver and the arbitrator. To generate a quantum multi-signature, all the signers perform the unitary operations controlled by the private keys and the message. The improved protocol overcomes all the security drawbacks of Jiang et al.’s quantum multi-signature. What is more, the arbitrator Trent can be semi-trusted, because he cannot forge any quantum signature of the signers, although Trent shares the private keys with all the signers. At the same time, the new protocol has the same quantum efficiency as that of Jiang et al.’s protocol.

Security analysis and improvement of a quantum multi-signature protocol

In this paper, we study strong designated verifier signature in certificateless public key settings. We first present the notion and security model of certificatless strong designated verifier signature (CLSDVS) scheme, and then, we provide a concrete CLSDVS scheme, which has short signature size and low computational cost, satisfies all the requirements of strong designated verifier signature. The scheme is proven secure in the random oracle model by assuming the intractability of the Computational Bilinear Diffie-Hellman Problem and the Computational Diffie-Hellman Problem.

无证书强指定验证者签名方案 (Certificateless Strong Designated Verifier Signature Scheme).

Universal designated verifier signature scheme with non-delegatability in the standard model

In a designated verifier signature (DVS) scheme, the signer (Alice) creates a signature which is only verifiable by a designated verifier (Bob). Furthermore, Bob cannot convince any third party that the signature was produced by Alice. A DVS scheme is applicable in scenarios where Alice must be authenticated to Bob without disturbing her privacy. The de-facto construction of DVS scheme is achieved in a traditional public key infrastructure (PKI) setting, which unfortunately requires a high-cost certificate management. A variant of identity-based (ID-based) setting DVS eliminates the need of certificates, but it introduces a new inherent key escrow problem, which makes it impractical. Certificateless public key cryptography (CL-PKC) is empowered to overcome the problems of PKI and ID-based settings, where it does not suffer from any of the aforementioned problems. However, only a few number of certificateless DVS (CL-DVS) schemes have been proposed in the literature to date. Moreover, all existing CL-DVS schemes are only proven secure in the random oracle model, while some of them are already known to be insecure. We provide three contributions in this paper. First, we revisit the security proofs of existing CL-DVS schemes in the literature and show that unfortunately there are some drawbacks in the proofs of all of those schemes. Second, we concentrate on the recently proposed CL-DVS scheme (IEEE Access 2018) and show a drawback in its security proof which makes it unreliable. Furthermore, we show that this scheme is delegatable in contrast to the author’s claim. Finally, we propose a CL-DVS scheme and prove its security requirements in the standard model. Our scheme is not only the first scheme with a complete and correct security proofs, but also the only scheme in the standard model.

Certificateless designated verifier signature revisited: achieving a concrete scheme in the standard model

Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which provides the goals of signing and encrypting, simultaneously. In 2010, Liu et al. presented the first certificateless signcryption (CLSC) scheme in the standard model, but their scheme is vulnerable against different attacks presented in the literature, till now. In this paper, we improve their scheme and propose a new CLSC scheme, which is semantically secure against adaptive chosen ciphertext attack under the (Ѕ2, 5)-BDHE-Set assumption and existentially unforgeable against adaptive chosen message attack under the 3-CDHE assumption in the standard model. Our scheme is more efficient than all other secure CLSC schemes in the standard model proposed up to now.

http://www.isecure-journal.com/article_42980_28ef1364e93f6001b0e4139f4efc2357.pdf

An efficient certificateless signcryption scheme in the standard model

In a designated verifier signature (DVS) scheme, the validity of the signature can only be checked by a designated entity chosen by the signer. Furthermore, the designated entity cannot convince a third party that the signature is generated by the signer. A multi-designated verifiers signature (MDVS) scheme is an extension of a DVS which includes multiple designated verifiers. To the best of the authors’ knowledge, there are two existing patterns for an MDVS scheme. In the first pattern, every verifier of the set of designated verifiers can check the validity of the signature independently. In the second pattern, the cooperation of all designated verifiers is required for checking the validity of the signature. In this study, the authors propose a generic new pattern for an MDVS scheme in which a threshold number of the set of designated verifiers can check the validity of the signature. They also present a concrete MDVS scheme with threshold verifiability in the standard model. Moreover, they compare their scheme with other existing MDVS schemes. Finally, they briefly explain scenarios in which the proposed pattern can be applicable.

https://ietresearch.onlinelibrary.wiley.com/doi/pdf/10.1049/iet-ifs.2018.5063

Parvin Rastegari

Papers

Efficient Certificateless Signcryption in the Standard Model: Revisiting Luo and Wan’s Scheme from Wireless Personal Communications (2018)

Universal designated verifier signature scheme with non-delegatability in the standard model

Certificateless designated verifier signature revisited: achieving a concrete scheme in the standard model

An efficient certificateless signcryption scheme in the standard model

Multi-designated verifiers signature schemes with threshold verifiability: generic pattern and a concrete scheme in the standard model