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
삭제 가능한 서명 체계를 사용하면 서명자가 지정한 준신뢰할 수 있는 당사자가 원래 서명자와 상호 작용하지 않고도 서명된 메시지의 미리 결정된 부분을 수정할 수 있습니다. 현재까지 다양한 암호화 기술을 기반으로 삭제 가능한 서명 체계가 많이 제안되었습니다. 그러나 이전 작업은 일반적으로 메시지를 하위 메시지로 나누고 각 하위 메시지에 암호화 기본 요소를 적용하는 패러다임을 기반으로 구축되었습니다. 이 방법론에는 삭제 가능한 하위 메시지 수에 선형적으로 비례하는 계산 시간(및 서명 길이)이 수반됩니다. 우리는 계산 비용과 서명 크기 모두에서 하위 메시지 수에 관계없이 서명 및 확인을 위한 지속적인 오버헤드로 삭제 가능한 서명을 구성하는 새로운 접근 방식을 제시합니다.
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.
부
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
부
@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},}
부
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 -