ID-based Proxy Signature Scheme Research Articles

Identity-Based Proxy Signature with Message Recovery over NTRU Lattice

Proxy signature is one of the important primitives of public-key cryptography and plays an essential role in delivering security services in modern communications. However, existing post quantum proxy signature schemes with larger signature sizes might not be fully practical for some resource-constrained devices (e.g., Internet of Things devices). A signature scheme with message recovery has the characteristic that part or all of the message is embedded in the signature, which can reduce the size of the signature. In this paper, we present a new identity-based proxy signature scheme over an NTRU lattice with message recovery (IB-PSSMR), which is more efficient than the other existing identity-based proxy signature schemes in terms of the size of the signature and the cost of energy. We prove that our scheme is secure under a Short Integer Solution (SIS) assumption that is as hard as approximating several worst-case lattice problems in the random oracle model. We also discussed some application scenarios of IB-PSSMR in blockchain and Internet of Things (IOT). This paper provides a new idea for the design of lattice signature schemes in low resource constrained environments.

Secure and efficient identity-based proxy signature scheme with message recovery

Digital signature with proxy delegation, which is a secure ownership enforcement tool, allows an original signer to delegate signature rights to a third party called proxy, so that the proxy can sign messages on behalf of the original signer. In today’s modern society, many applications use this mechanism. Several types of delegations are quite prevalent and the delegation of signing authority is one of them. In a traditional digital signature scheme, signer transmits signature along with message for verification, which leads to additional communication, computation cost and requires extra bandwidth. To resolve these issues, in this paper, we present an efficient ID-based proxy signature scheme with message recovery using bilinear pairings. Because of the message recovery feature, the proxy signer need not send the message to the verifier, so that the proposed scheme reduces the bandwidth requirement and communication cost. Our proposed scheme is proven secure against existential forgery under adaptively chosen message and identity attacks in the random oracle model (ROM) with the assumption that the Computational Diffie-Hellman Problem (CDHP) is intractable. We compare our scheme with related schemes. The efficiency analysis shows that the scheme is computationally efficient. Thus the proposed ID-based proxy signature scheme is secure and efficient both in terms of computation and communication costs than the related existing schemes.

Identity-Based Threshold Key-Insulated Proxy Signature in the Standard Model

Loss of secret keys is the deadly attack in public key cryptosystems. We present an identity-based threhold key-insulated proxy signature (IBTKIPS) scheme to settle the problem of key exposure in the identity-based proxy signature system. The proposed IBTKIPS scheme is secure in the standard model. In the IBTKIPS scheme, we use at least k out of n helper keys to refresh the temporary secret keys. The IBTKIPS scheme is more flexible and securer than the identity-based proxy signature scheme.

Identity-Based Parallel Key-Insulated Proxy Signature Without Random Oracles

Exposure of private keys is the dangerous attack in the public key cryptosystems. We put forward an identity-based parallel key-insulated proxy signature (IBPKIPS) scheme to deal with the problem of key exposure in the identity-based proxy signature system. Our IBPKIPS scheme is secure without random oracles. In the IBPKIPS scheme, we use two different helper keys to renew the temporary private keys. Our IBPKIPS scheme is securer and more flexible than the identity-based proxy signature scheme.

A generic construction of identity-based proxy signature scheme in the standard model

Recently, numerous identity-based proxy signature (IDPS) schemes are constructed by direct methods or generic methods. However, most of them are proved only to be secure in the random oracle model or are involved high computational cost. In this paper, we present a novel and generic construction method of IDPS scheme secure in the standard model from any identity-based signature (IDS) scheme. The security of IDPS scheme constructed by our method is based on the security of original IDS scheme. The computational cost of constructing an IDPS scheme is almost the same as that of constructing an original IDS scheme. Compared with other existing IDPS schemes constructed by direct methods or other generic methods, our IDPS scheme has better performance: signature length and computational cost of our IDPS scheme are almost half of other existing IDPS schemes. What is more, our method can be applied to construct other identity-based proxy cryptosystems.

A generic construction of identity-based proxy signature scheme in the standard model

Recently, numerous identity-based proxy signature (IDPS) schemes are constructed by direct methods or generic methods. However, most of them are proved only to be secure in the random oracle model or are involved high computational cost. In this paper, we present a novel and generic construction method of IDPS scheme secure in the standard model from any identity-based signature (IDS) scheme. The security of IDPS scheme constructed by our method is based on the security of original IDS scheme. The computational cost of constructing an IDPS scheme is almost the same as that of constructing an original IDS scheme. Compared with other existing IDPS schemes constructed by direct methods or other generic methods, our IDPS scheme has better performance: signature length and computational cost of our IDPS scheme are almost half of other existing IDPS schemes. What is more, our method can be applied to construct other identity-based proxy cryptosystems.

Strong Identity-Based Proxy Signature Schemes, Revisited

Proxy signature is a useful cryptographic primitive that has been widely used in many applications. It has attracted a lot of attention since it was introduced. There have been lots of works in constructing efficient and secure proxy signature schemes. In this paper, we identify a new attack that has been neglected by many existing proven secure proxy signature schemes. We demonstrate this attack by launching it against an identity-based proxy signature scheme which is proven secure. We then propose one method that can effectively prevent this attack. The weakness in some other proxy signature schemes can also be fixed by applying the same method.

An Identity‐Based Proxy Signature on NTRU Lattice

Proxy signature plays an important role in distributed systems, mobile agent applications, distributed shared object systems, global distribution networks and mobile communications etc., since it allows the original signer to delegate another proxy signer to sign the message instead of himself. However, the proxy signature schemes constructed on the number theory cannot resist quantum computers attack and depend on the public key infrastructure. To mitigate these problems, the alternative schemes are Identity-based proxy signature constructed on lattice. In this paper, an identity-based proxy signature scheme based on Number theorem research unit (NTRU) lattice is proposed and proven secure in the random oracle. Compared with the other existing identity-based proxy signature schemes, the proposed scheme outperforms them in terms of original signer's signature size and signing key size and proxy signer's signing key size.

Identity Based Proxy Signature from RSA without Pairings

RSA is a key cryptography technique and provides various interfaces for the applied software in real-life scenarios. Although some good results were achieved in speeding up the computation of pairing function in re- cent years, the computation cost of the pairings is much higher than that of the exponentiation in a RSA group. So it is still interesting to design efficient cryptosystems based on RSA primitive. A proxy signature scheme allows a proxy signer to sign messages on behalf of an original signer within a given context. Most identity based proxy signature schemes currently known employ bilinear pairings. In this paper, an identity based proxy ring signature (IBPS) scheme from RSA without pairings is constructed, and the security is proved under the random oracle model.

An Improved ID-based Proxy Signature Scheme with Message Recovery

An Improved ID-based Proxy Signature Scheme with Message Recovery

An improved efficient identity-based proxy signature in the standard model

ABSTRACTMany identity-based proxy signature (IBPS) schemes have been proposed, but most were proved to be secure using a random oracle model, which has attracted considerable criticism. Cao and Cao proposed an IBPS scheme using the standard model, but their scheme was shown to be insecure because it could not resist a delegator attack. In order to overcome this weakness, Gu et al. proposed a new IBPS scheme in 2013 that uses the standard model and they also provided a detailed security model for IBPS. However, in this study, we demonstrate that Gu et al.'s scheme is still vulnerable to delegator attack. In order to correct this problem, we propose an improvement of the IBPS scheme described by Gu et al. We also present an efficiency analysis for our scheme and a detailed security proof based on the computational Diffie–Hellman assumption.

A Secure ID-based Proxy Signature Scheme from Bilinear Pairings

In a proxy signature scheme, a user delegates his/her signing capability to another user in such a way that the latter can sign messages on behalf of the former. Proxy signature helps the proxy signer to sign messages on behalf of the original signer. It is very useful when the original signer is not available to sign a specific document. In this paper, we propose a secure an identity based proxy signature scheme from bilinear pairings. The proposed scheme satisfy all the security property of proxy signature scheme.

Security Analysis of an Efficient Identity-Based Proxy Signature in the Standard Model

Presently, many identity-based proxy signature (IBPS) schemes have been proposed, but most of them require high computational costs and the proposed security model for IBPS is not enough complete. To overcome this weakness, Gu et al. recently proposed a framework and a detailed security model for IBPS. They also proposed an efficient IBPS scheme and proved the unforgeability of their scheme in the standard model. However, in this letter, we demonstrate that Gu et al.'s scheme fails to satisfy the property of unforgeability because it can not resist the following attacks: after getting a private key, an adversary behaving as a malicious signer can forge a private key on any identity without the help of the private key generator (PKG); after getting a delegation, an adversary behaving as a malicious proxy signer can forge a proxy signing key on any delegation without the agreement of the original signer; after getting a signature, an adversary behaving as a malicious user can forge a signature on any identity without the private key or forge a proxy signature on any warrant without the proxy signing key.

Efficient Identity-Based Proxy Signature in the Standard Model

Presently, many identity-based proxy signature (IBPS) schemes have been proposed, but most of them are constructed in the random oracle model. Also, the proposed security model for IBPS is not enough complete according to Boldyreva's work. Cao and Cao proposed an IBPS scheme in the standard model. However, their scheme is not secure because of not resisting the attack of delegator and requires more computation cost. In this paper, we present a framework for IBPS and show a detailed security model for IBPS. Under our framework, we present an efficient IBPS scheme in the standard model. Compared with other IBPS schemes, the proposed scheme has more complete security and is more efficient.

A provably secure identity-based strong designated verifier proxy signature scheme from bilinear pairings

The proxy signature, a variant of the ordinary digital signature, has been an active research topic in recent years; it has many useful applications, including distributed systems and grid computing. Although many identity-based proxy signature schemes have been proposed in the literature, only a few proposals for identity-based strong designated verifier proxy signature (ID-SDVPS) schemes are available. However, it has been found that most of the ID-SDVPS schemes that have been proposed to date are not efficient in terms of computation and security, and a computationally efficient and secured ID-SDVPS scheme using elliptic curve bilinear pairing has been proposed in this paper. The security of the scheme is mainly based on the hardness assumption of CDH and GBDH problems in the random oracle model, which is existentially unforgeable against different types of adversaries. Furthermore, the security of our scheme is simulated in the AVISPA (Automated Validation of Internet Security Protocols and Applications) software, a widely used automated internet protocol validation tool, and the simulation results confirm strong security against both active and passive attacks. In addition, because of a high processing capability and supporting additional security features, the scheme is suitable for the environments in which less computational cost with strong security is required.

Identity-based proxy signature from lattices

Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested lattice-based proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure ID-based proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.

On the security of an ID-based anonymous proxy signature scheme and its improved scheme

As an important delegation technique, proxy signature was introduced in 1996 by Mambo, Usuda, and Okamoto. And many variants of proxy signature schemes have been proposed. In some cases, to protect privacy of proxy signer, the identity of proxy signer is hidden. Recently, to satisfy the requirement of proxy signer’s privacy protection, Hu et al. gave an enhanced ID-based anonymous proxy signature scheme from pairings, in which it allows that proxy signature produces an anonymous signature on behalf of original signer, and the identity of proxy signer is hidden. Meanwhile, it also allows the original signer to trace the actual identity of proxy signer. Unfortunately, in this paper, by analysing the scheme, we show that the scheme is insecure. It is universally forgeable, namely, anyone can produce an anonymous proxy signature on an arbitrary message. And the original signer can not also trace the actual identity of proxy signer. Finally, we give the corresponding attacks on the scheme and the reasons to produce suck attacks. To overcome our attacks, we proposed an improved scheme based on bilinear map of composite order.

On the Security of an Identity-Based Proxy Signature Scheme in the Standard Model

On the Security of an Identity-Based Proxy Signature Scheme in the Standard Model

Proxy Signature in the Standard Model: Constructing Security Model and Proving Security

PDF HTML阅读 XML下载 导出引用 引用提醒 标准模型下的代理签名:构造模型与证明安全性 DOI: 10.3724/SP.J.1001.2012.04246 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: 教育部人文社科项目(12YJAZH142); 香港城市大学研究项目基金(9681001, 6351006); 香港城市大学战略研究发展基金(7008110); 深港创新圈基金(ZYB200907080078A); 湖南省社科基金重点项目(09ZDB080); 湖南省软科学研究项目(2010ZK3029) Proxy Signature in the Standard Model: Constructing Security Model and Proving Security Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:目前已经提出的代理签名方案缺乏在完整的代理签名安全模型下证明方案的安全性.在Boldyreva 等人提出的代理签名安全模型的基础上,对代理签名的可证安全模型进行详细的形式化定义,提出一种完整的代理签名可证安全模型.同时,为了展示该安全模型的有效性和可扩展性,对Paterson 等人提出的标准模型下基于身份的签名方案进行扩展,提出在标准模型下基于身份的代理签名方案,并在可证安全模型下,证明新方案具有在自适应选择消息攻击下存在基于身份的代理签名不可伪造性,其安全性在标准模型下可归约于CDH 问题假定.新方案与标准模型下基于公钥密码体制的代理签名方案相比,不仅增加了用户身份的概念,还具有更完备的安全性. Abstract:Current proxy signature schemes are not proved for their security in the complete provable security model of proxy signature. In this paper, we show a complete provable security model for proxy signature based on Boldyreva’s provable security model, and a new identity-based proxy signature scheme are proposed in the standard model, which is based on Paterson’s scheme. In the complete provable security model for proxy signature, the new scheme is proved to have the existential identity-based proxy signature unforgerability under an adaptive chosen message attack, which has a security reduction to CDHP. Comparing with other proxy signature schemes based on public key cryptosystem in the standard model, the concept of the identity is introduced into the new scheme, and the new scheme is more secure. 参考文献 相似文献 引证文献

A VERIFIABLE PROXY SIGNATURE SCHEME BASED ON BILINEAR PAIRINGS WITH IDENTITY-BASED CRYPTOGRAPHIC APPROACHES

Hu and Huang proposed an identity-based proxy signature scheme with bilinear pairings. By this approach, the extra burden of verifying a public key with a certificate can be eliminated, and the length of a digital signature can be 160 bits only. Later, Park et al. pointed out that Hu and Huang’s scheme suffers from one serious problem, privacy problem, such that a proxy key is generated by using a designated proxy signer’s private key without his agreement. To solve this problem, Park et al. also proposed an improvement. With deep insight into Park et al.’s improvement, two drawbacks are found. First, a designated proxy signer may be fooled. Second, the verification of the proxy key in Park et al.’s scheme will never succeed. To preserve advantages and overcome drawbacks, an enhancement will be proposed in this paper.DOI: http://dx.doi.org/10.5755/j01.itc.41.1.830