✦ LIBER ✦

Proxy signature schemes based on factoring

✍ Scribed by Zuhua Shao

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 89 KB
Volume: 85
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00367-8

No coin nor oath required. For personal study only.

✦ Synopsis

The proxy signature schemes allow proxy signers to sign messages on behalf of an original signer, a company or an organization. However, most of existing proxy signature schemes are based on the discrete logarithm problem. In this paper, the author would like to propose two efficient proxy signature schemes based on the factoring problem, which combine the RSA signature scheme and the Guillou-Quisquater signature scheme. One is a proxy-unprotected signature scheme that is more efficient. No matter how many proxy signers cooperatively sign a message, the computation load for verifiers would remain almost constant. The other is a proxy-protected signature scheme that is more secure. Finally, to protect the privacy of proxy signers, the author proposes a proxy-protected signature scheme with anonymous proxy signers.

📜 SIMILAR VOLUMES

Provably secure proxy-protected signatur

Provably secure proxy-protected signature schemes based on RSA

✍ Zuhua Shao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 210 KB

The proxy signature schemes allow proxy signers to sign messages on behalf of an original signer, a company or an organization. Such schemes have been suggested for use in a number of applications, particularly in distributed computing, where delegation of rights is quite common. Most of proxy signa

On the security of an identity based mul

On the security of an identity based multi-proxy signature scheme

✍ Hu Xiong; Jianbin Hu; Zhong Chen; Fagen Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 208 KB

In a multi-proxy signature scheme, an original signer could authorize a proxy group as his proxy agent. Then only the cooperation of all the signers in the proxy group can generate the proxy signatures on behalf of the original signer. Recently, Cao and Cao gave the first formal definition and secur

Designated verifier proxy signature sche

Designated verifier proxy signature scheme without random oracles

✍ Yong Yu; Chunxiang Xu; Xiaosong Zhang; Yongjian Liao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 701 KB

In a designated verifier proxy signature scheme, one can delegate his or her signing capability to another user in such a way that the latter can sign messages on behalf of the former, but the validity of the resulting signatures can only be verified by the designated verifier. Several designated ve

Efficient proxy multisignature schemes b

Efficient proxy multisignature schemes based on the elliptic curve cryptosystem

✍ Tzer-Shyong Chen; Yu-Fang Chung; Gwo-Shiuan Huang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 154 KB

## For improving proxy-signature research, Sun [5] attempted to resolve problems related to defective security in the scheme of Yi [3]. However, both Yi and Sun's schemes involve a significant number of exponential operations to verify the proxy signature. Accordingly, an improvement is proposed her

A weak blind signature scheme based on q

A weak blind signature scheme based on quantum cryptography

✍ Xiaojun Wen; Xiamu Niu; Liping Ji; Yuan Tian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 165 KB

Provably secure randomized blind signatu

Provably secure randomized blind signature scheme based on bilinear pairing

✍ Chun-I Fan; Wei-Zhe Sun; Vincent Shi-Ming Huang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Blind signature is a well-known technique used to construct some advanced applications for the consideration of user privacy. Various generic ideas and variants on blind signatures have been brought up so far, but few of them considered the randomization property or offered formal proofs. The concep