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
Skim tandatangan yang boleh disanitasi membolehkan pihak separa dipercayai, yang ditetapkan oleh penandatangan, mengubah suai bahagian yang telah ditetapkan bagi mesej yang ditandatangani tanpa berinteraksi dengan penandatangan asal. Sehingga kini, banyak skim tandatangan boleh disanitasi telah dicadangkan berdasarkan pelbagai teknik kriptografi. Walau bagaimanapun, karya terdahulu biasanya dibina berdasarkan paradigma membahagikan mesej kepada submesej dan menggunakan primitif kriptografi untuk setiap submesej. Metodologi ini memerlukan masa pengiraan (dan selalunya panjang tandatangan) dalam perkadaran linear dengan bilangan submesej boleh sanitizable. Kami mempersembahkan pendekatan baharu untuk membina tandatangan boleh disanitasi dengan overhed berterusan untuk menandatangani dan pengesahan, tanpa mengira bilangan submesej, kedua-dua dalam kos pengiraan dan dalam saiz tandatangan.
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
Dae Hyun YUM, Pil Joong LEE, "Sanitizable Signatures Reconsidered" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 2, pp. 717-724, February 2011, doi: 10.1587/transfun.E94.A.717.
Abstract: A sanitizable signature scheme allows a semi-trusted party, designated by a signer, to modify pre-determined parts of a signed message without interacting with the original signer. To date, many sanitizable signature schemes have been proposed based on various cryptographic techniques. However, previous works are usually built upon the paradigm of dividing a message into submessages and applying a cryptographic primitive to each submessage. This methodology entails the computation time (and often signature length) in linear proportion to the number of sanitizable submessages. We present a new approach to constructing sanitizable signatures with constant overhead for signing and verification, irrespective of the number of submessages, both in computational cost and in signature size.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.717/_p
Salinan
@ARTICLE{e94-a_2_717,
author={Dae Hyun YUM, Pil Joong LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sanitizable Signatures Reconsidered},
year={2011},
volume={E94-A},
number={2},
pages={717-724},
abstract={A sanitizable signature scheme allows a semi-trusted party, designated by a signer, to modify pre-determined parts of a signed message without interacting with the original signer. To date, many sanitizable signature schemes have been proposed based on various cryptographic techniques. However, previous works are usually built upon the paradigm of dividing a message into submessages and applying a cryptographic primitive to each submessage. This methodology entails the computation time (and often signature length) in linear proportion to the number of sanitizable submessages. We present a new approach to constructing sanitizable signatures with constant overhead for signing and verification, irrespective of the number of submessages, both in computational cost and in signature size.},
keywords={},
doi={10.1587/transfun.E94.A.717},
ISSN={1745-1337},
month={February},}
Salinan
TY - JOUR
TI - Sanitizable Signatures Reconsidered
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 717
EP - 724
AU - Dae Hyun YUM
AU - Pil Joong LEE
PY - 2011
DO - 10.1587/transfun.E94.A.717
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2011
AB - A sanitizable signature scheme allows a semi-trusted party, designated by a signer, to modify pre-determined parts of a signed message without interacting with the original signer. To date, many sanitizable signature schemes have been proposed based on various cryptographic techniques. However, previous works are usually built upon the paradigm of dividing a message into submessages and applying a cryptographic primitive to each submessage. This methodology entails the computation time (and often signature length) in linear proportion to the number of sanitizable submessages. We present a new approach to constructing sanitizable signatures with constant overhead for signing and verification, irrespective of the number of submessages, both in computational cost and in signature size.
ER -