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
Provably secure proxy-protected signature schemes based on RSA
โ Scribed by Zuhua Shao
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 210 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0045-7906
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. 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 signature schemes previously proposed in literatures are based on discrete logarithms or from pairings. In 2003, Shao proposed the first two proxy signature schemes based on RSA. Though being very efficient, they have no formal security proofs. In this paper, we provide formal security proofs under a strong security model in the random oracle model after minor modification.
๐ SIMILAR VOLUMES
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
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
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 th