Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length

Huang, Xinyi; Mu, Yi; Susilo, Willy; Wu, Wei

doi:10.1007/978-3-540-73489-5_21

Cited by 23 publications

(13 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This was pointed out by Kurosawa and Heng [24], and Huang et al [22] furthermore noticed that, for convertible schemes, this might be an issue for token generation as well.…”

Section: Non-impersonationmentioning

confidence: 96%

“…Another aspect of the above security notion which we would like to highlight is the definition of S. We note that anyone can sample S and that when using this definition of S, invisibility implies anonymity i.e. the inability for an adversary to distinguish between signatures constructed by different users (see [16,22] for a formal proof of this). Some schemes (e.g.…”

Section: Invisibilitymentioning

confidence: 99%

“…Recently, Huang, Mu, Susilo and Wu [22] proposed the currently most efficient scheme in the random oracle model which supports both selective and universal conversion. Yuen, Au, Liu and Susilo [39] proposed a selective and universal convertible standard model scheme, but it was shown by Phong, Kurosawa and Ogata [33] that the scheme is not invisible for the standard definition of invisibility.…”

Section: Introductionmentioning

confidence: 99%

“…However, despite the practical advantages of this property, it is not considered in the formalization, security model or the concrete schemes presented in most recent papers [27,25,22,39,2,34,33] (we note that [20] discuss delegation of verification as an extension). In these schemes, only the ability of the signer to confirm, disavow and convert signatures is considered and no explicit mechanism is provided for delegating this ability.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification

Schuldt

Matsuura

2010

Information Security, Practice and Experience

View full text Add to dashboard Cite

Abstract. Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control the verifiability of his signatures. Convertible undeniable signatures, introduced by Boyar, Chaum, Damgård, and Pedersen, furthermore allow the signer to convert signatures to publicly verifiable ones by publicizing a verification token, either for individual signatures or for all signatures universally. In addition, the signer is able to delegate the ability to prove validity and convert signatures to a semi-trusted third party by providing a verification key. While the latter functionality is implemented by the early convertible undeniable signature schemes, most recent schemes do not consider this despite its practical appeal. In this paper we present an updated definition and security model for schemes allowing delegation, and highlight a new essential security property, token soundness, which is not formally treated in the previous security models for convertible undeniable signatures. We then propose a new convertible undeniable signature scheme. The scheme allows delegation of verification and is provably secure in the standard model assuming the computational co-Diffie-Hellman problem, a closely related problem, and the decisional linear problem are hard. Our scheme is, to the best of our knowledge, the currently most efficient convertible undeniable signature scheme which provably fulfills all security requirements in the standard model.

show abstract

“…This was pointed out by Kurosawa and Heng [24], and Huang et al [22] furthermore noticed that, for convertible schemes, this might be an issue for token generation as well.…”

Section: Non-impersonationmentioning

confidence: 96%

Section: Invisibilitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification

Schuldt

Matsuura

2010

Information Security, Practice and Experience

View full text Add to dashboard Cite

show abstract

“…An earlier version of the scheme in this section appears in [38]. In 2007, Huang et al [20] proposed a pairing-based convertible undeniable signatures secure in the random oracle model. Huang et al [19] also proposed a generic construction of universally-convertible undeniable signatures from a strongly unforgeable classic signature scheme, a selectively-convertible undeniable signature scheme and a collision resistant hash function.…”

Section: Recentmentioning

confidence: 99%

(Convertible) Undeniable Signatures Without Random Oracles

Yuen

Liu

et al. 2007

Information and Communications Security

Self Cite

View full text Add to dashboard Cite

Abstract. We propose a convertible undeniable signature scheme without random oracles. Our construction is based on the Waters signatures proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillaumie and Vergnaud.

show abstract

Provably secure strong designated verifier signature scheme based on coding theory

Shooshtari

Ahmadian-Attari

Aref

2016

Int J Communication

View full text Add to dashboard Cite

Summary Strong Designated Verifier Signature (SDVS) provides authentication for the signer and the verifier such that the signer is assured that what s/he has signed, is only verified by the designated verifier. Currently, the security of most of the SDVS schemes is based on hard problems in the number theory. As it is proved that all kinds of cryptosystems which are based on the number theory will not tolerate quantum attacks, here, an SDVS scheme based on hard problems in coding theory is presented. We have proved that the suggested scheme is unforgeable under a chosen message attack in Random Oracle Model. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length

Cited by 23 publications

References 37 publications

An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification

An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification

(Convertible) Undeniable Signatures Without Random Oracles

Provably secure strong designated verifier signature scheme based on coding theory

Contact Info

Product

Resources

About