Stand-Alone and Setup-Free Verifiably Committed Signatures

Zhu, Huafei; Bao, Feng

doi:10.1007/11605805_11

Cited by 27 publications

(21 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proof of security follows that presented in [19]. We also stress that the technique presented in this section can be applied to the case where the underlying signature scheme is Cramer-Shoup's hash signature with the restriction that individual group G i is chosen independently and is never reused.…”

Section: The Proof Of Securitymentioning

confidence: 89%

“…A stand-alone and setup-free verifiably committed signature in the two-party setting based on Cramer and Shoup's signature scheme has been presented in [19]. We are about to demonstrate that although this scheme is provably secure in the two-party setting, it is not secure in the multi-party setting.…”

Section: A Gap Between Two-party and Multi-party Verifiably Committedmentioning

confidence: 98%

“…We now extend (stand-alone and setup-free) two-party verifiably committed signatures [11], [19] and [20] to the multi-party verifiably committed signatures setting.…”

Section: Syntaxmentioning

confidence: 99%

“…A verifiably committed signature can be setup-driven or setup-free [19]. A verifiably committed signature is called setup-driven if an initial key setup protocol between a primary signer and its trusted third party (TTP) must be involved such that at the end of the key setup protocol, the primary signer and its TTP share a prior auxiliary string.…”

Section: Introductionmentioning

confidence: 99%

“…A verifiably committed signature can be stand-alone [19] or not [18]. A verifiably committed signature is called stand-alone if on input a valid partial signature scheme, the distribution of outputs of a resolution algorithm is identical with the distribution of signatures generated by a full signing algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures

Zhu

Susilo

Public Key Cryptography – PKC 2007

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signatures in the multi-party setting. We then extend the state-of-the-art security model of verifiably committed signatures in the two-party setting to that of multi-party setting. Since there exists trivial setup-driven solutions to multi-party verifiably committed signatures (e.g., two-signature based solutions, we propose solutions to the multi-party stand-alone verifiably committed signatures in the setup-free model, and show that our implementation is provably secure under the joint assumption that the underlying Zhu's signature scheme is secure against adaptive chosen-message attack, FujisakiOkamoto's commitment scheme is statistically hiding and computationally binding and Paillier's encryption is semantically secure and one-way as well as the existence of collision-free one-way hash functions.

show abstract

Section: The Proof Of Securitymentioning

confidence: 89%

Section: A Gap Between Two-party and Multi-party Verifiably Committedmentioning

confidence: 98%

“…We now extend (stand-alone and setup-free) two-party verifiably committed signatures [11], [19] and [20] to the multi-party verifiably committed signatures setting.…”

Section: Syntaxmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures

Zhu

Susilo

Public Key Cryptography – PKC 2007

Self Cite

View full text Add to dashboard Cite

show abstract

Certificate‐based verifiably encrypted RSA signatures

Shao¹,

Gao

2013

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

The RSA signature scheme is one of the most popular signature schemes to date. This paper proposes a certificate-based verifiably encrypted RSA signature scheme that is the first to accomplish optimistic fair exchange of the standard RSA signatures. The main characteristic of this scheme is that the signer can unilaterally choose a certificate authority as his/her adjudicator in fair exchange. Then a certificate, or generally, a signature, acts not only as the binding of the public key and its holder but also as the certificate authority's guarantee against partiality in adjudication. We introduce a strong security model, in which there are three types of inside adversaries with more power than outside adversaries in previous verifiably encrypted RSA signature schemes. We then show that the proposed scheme is existentially unforgeable under the Discrete Logarithm (DL) assumption, the Computational Diffile-Dellman (CDH) assumption, and the RSA assumption in the random oracle model. Because the proposed scheme can be directly used in the current Public-Key Infrastructure (PKI) environment, it is more practical and trustworthy than the previous schemes in the real world.

show abstract

More on Stand-Alone and Setup-Free Verifiably Committed Signatures

Zhu

Bao

2006

Information Security and Privacy

View full text Add to dashboard Cite

Stand-Alone and Setup-Free Verifiably Committed Signatures

Cited by 27 publications

References 24 publications

Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures

Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures

Certificate‐based verifiably encrypted RSA signatures

More on Stand-Alone and Setup-Free Verifiably Committed Signatures

Contact Info

Product

Resources

About