A Generic Construction for Universally-Convertible Undeniable Signatures

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

doi:10.1007/978-3-540-76969-9_2

Cited by 4 publications

(2 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3. Token non-impersonation experiment [15,23,21,20]) use a more restricted definition limiting S to signatures from the signer i.e. S = {σ : m ← M; σ ← Sign(par, sk, m)}.…”

Section: Invisibilitymentioning

confidence: 99%

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

“…3. Token non-impersonation experiment [15,23,21,20]) use a more restricted definition limiting S to signatures from the signer i.e. S = {σ : m ← M; σ ← Sign(par, sk, m)}.…”

Section: Invisibilitymentioning

confidence: 99%

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

“…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. In 2008, Kurosawa and Furukawa [23] defined the universal composability security of undeniable signatures.…”

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