The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Tandatangan yang tidak boleh dinafikan, yang diperkenalkan oleh Chaum dan van Antwerpen, memerlukan pengesah untuk berinteraksi dengan penandatangan untuk mengesahkan tandatangan, dan oleh itu membenarkan penandatangan mengawal kebolehsahihan tandatangannya. Tandatangan yang tidak boleh dinafikan boleh tukar, yang diperkenalkan oleh Boyar, Chaum, Damgård dan Pedersen, seterusnya membenarkan penandatangan menukar tandatangan kepada yang boleh disahkan secara umum dengan menghebahkan token pengesahan, sama ada untuk tandatangan individu atau untuk semua tandatangan secara universal. Di samping itu, definisi asal membenarkan penandatangan mewakilkan keupayaan untuk membuktikan kesahihan dan menukar tandatangan kepada pihak ketiga yang separa dipercayai dengan menyediakan kunci pengesahan. Walaupun kefungsian ini dilaksanakan oleh skim tandatangan boleh tukar awal yang tidak boleh dinafikan, kebanyakan skim terkini tidak menganggap bentuk perwakilan ini walaupun terdapat tarikan praktikal. Dalam kertas kerja ini kami membentangkan definisi dan model keselamatan yang dikemas kini untuk skim yang membenarkan perwakilan, dan seterusnya menyerlahkan sifat keselamatan penting baharu, kekukuhan token, yang tidak dirawat secara rasmi dalam model keselamatan sebelumnya untuk tandatangan yang tidak boleh dinafikan. Kami kemudiannya mencadangkan skim tandatangan boleh tukar baharu yang tidak boleh dinafikan. Skim ini membenarkan pendelegasian pengesahan dan terbukti selamat dalam model standard dengan mengandaikan masalah co-Diffie-Hellman pengiraan, masalah yang berkait rapat, dan masalah linear keputusan adalah sukar. Tambahan pula, tidak seperti skim yang dicadangkan baru-baru ini oleh Phong et al. dan Huang et al., skim kami terbukti memenuhi semua keperluan keselamatan sambil memberikan tandatangan pendek.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Jacob C. N. SCHULDT, Kanta MATSUURA, "Efficient Convertible Undeniable Signatures with Delegatable Verification" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 71-83, January 2011, doi: 10.1587/transfun.E94.A.71.
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 original definition allows the signer to delegate the ability to prove validity and convert signatures to a semi-trusted third party by providing a verification key. While this functionality is implemented by the early convertible undeniable signature schemes, most recent schemes do not consider this form of delegation despite its practical appeal. In this paper we present an updated definition and security model for schemes allowing delegation, and furthermore 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. Furthermore, unlike the recently proposed schemes by Phong et al. and Huang et al., our scheme provably fulfills all security requirements while providing short signatures.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.71/_p
Salinan
@ARTICLE{e94-a_1_71,
author={Jacob C. N. SCHULDT, Kanta MATSUURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Convertible Undeniable Signatures with Delegatable Verification},
year={2011},
volume={E94-A},
number={1},
pages={71-83},
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 original definition allows the signer to delegate the ability to prove validity and convert signatures to a semi-trusted third party by providing a verification key. While this functionality is implemented by the early convertible undeniable signature schemes, most recent schemes do not consider this form of delegation despite its practical appeal. In this paper we present an updated definition and security model for schemes allowing delegation, and furthermore 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. Furthermore, unlike the recently proposed schemes by Phong et al. and Huang et al., our scheme provably fulfills all security requirements while providing short signatures.},
keywords={},
doi={10.1587/transfun.E94.A.71},
ISSN={1745-1337},
month={January},}
Salinan
TY - JOUR
TI - Efficient Convertible Undeniable Signatures with Delegatable Verification
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 71
EP - 83
AU - Jacob C. N. SCHULDT
AU - Kanta MATSUURA
PY - 2011
DO - 10.1587/transfun.E94.A.71
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - 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 original definition allows the signer to delegate the ability to prove validity and convert signatures to a semi-trusted third party by providing a verification key. While this functionality is implemented by the early convertible undeniable signature schemes, most recent schemes do not consider this form of delegation despite its practical appeal. In this paper we present an updated definition and security model for schemes allowing delegation, and furthermore 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. Furthermore, unlike the recently proposed schemes by Phong et al. and Huang et al., our scheme provably fulfills all security requirements while providing short signatures.
ER -