1,501 research outputs found
A new identity based proxy signature scheme
Proxy signature schemes allow a proxy signer to generate proxy signatures on behalf of an original signer. Mambo et al. first introduced the notion of proxy signature and a lot of research work can be found on this topic nowadays. Recently, many identity based proxy signature schemes were proposed. However, some schemes are vulnerable to proxy key exposure attack. In this paper, we propose a security model for identity based proxy signature schemes. Then an efficient scheme from pairings is presented. The presented scheme is provably secure in the random oracle model. In particular, the new scheme is secure against proxy key exposure attack
An Efficient ID-based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is only one, so our scheme is more efficient comparatively. The new scheme can be proved secure
with the hardness assumption of the k-Bilinear Diffie-Hellman Inverse
problem, in the random oracle model
An Efficient Secure Anonymous Proxy Signature Scheme
Proxy signature schemes can be used in many business applications such as
when the original signer is not present to sign important documents. Any proxy
signature scheme has to meet the identifiability, undeniability, verifiability and
unforgeability security requirements. In some conditions, it may be necessary to
protect the proxy signer’s privacy from outsiders or third parties. Recently, several
studies about proxy signature schemes have been conducted but only Yu et al.’
anonymous proxy signature scheme proposed in 2009 attempting to protect the proxy
signer’s privacy from outsiders. They claimed their scheme can make the proxy
signer anonymous. However, based on our research, we determined that this was not
the case and the proxy signer’s privacy was not anonymous. Hence, in this paper,
we propose a new anonymous proxy signature scheme that truly makes the proxy
signer anonymous while making it more secure and efficient when compared with Yu
et al.’s scheme in 2009. Our proxy signature scheme consists of two constructions.
First, we mainly use random numbers and bilinear pairings to attain the anonymous
property in our proxy. Secondly, we increase the security, integrity, and efficiency of
our proxy through modifications
ID-based Ring Signature and Proxy Ring Signature Schemes from Bilinear Pairings
In 2001, Rivest et al. firstly introduced the concept of ring signatures. A
ring signature is a simplified group signature without any manager. It protects
the anonymity of a signer. The first scheme proposed by Rivest et al. was based
on RSA cryptosystem and certificate based public key setting. The first ring
signature scheme based on DLP was proposed by Abe, Ohkubo, and Suzuki. Their
scheme is also based on the general certificate-based public key setting too.
In 2002, Zhang and Kim proposed a new ID-based ring signature scheme using
pairings. Later Lin and Wu proposed a more efficient ID-based ring signature
scheme. Both these schemes have some inconsistency in computational aspect.
In this paper we propose a new ID-based ring signature scheme and a proxy
ring signature scheme. Both the schemes are more efficient than existing one.
These schemes also take care of the inconsistencies in above two schemes.Comment: Published with ePrint Archiv
Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings
We present a proxy signature scheme using bilinear pairings that provides
effective proxy revocation. The scheme uses a binding-blinding technique to
avoid secure channel requirements in the key issuance stage. With this
technique, the signer receives a partial private key from a trusted authority
and unblinds it to get his private key, in turn, overcomes the key escrow
problem which is a constraint in most of the pairing-based proxy signature
schemes. The scheme fulfills the necessary security requirements of proxy
signature and resists other possible threats
Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security
Recently, a variant of proxy re-encryption, named conditional proxy re-encryption (C-PRE), has been introduced. Compared with traditional proxy re-encryption, C-PRE enables the delegator to implement fine-grained delegation of decryption rights, and thus is more useful in many applications. In this paper, based on a careful observation on the existing definitions and security notions for C-PRE, we reformalize more rigorous definition and security notions for C-PRE. We further propose a more efficient C-PRE scheme, and prove its chosenciphertext security under the decisional bilinear Diffie-Hellman (DBDH) assumption in the random oracle model. In addition, we point out that a recent C-PRE scheme fails to achieve the chosen-ciphertext security
- …