IEICE TRANSACTIONS on Fundamentals
Redactable Signature with Compactness from Set-Commitment
Summary :
Redactable signature allows anyone to remove parts of a signed message without invalidating the signature. The need to prove the validity of digital documents issued by governments is increasing. When governments disclose documents, they must remove private information concerning individuals. Redactable signature is useful for such a situation. However, in most redactable signature schemes, to remove parts of the signed message, we need pieces of information for each part we want to remove. If a signed message consists of ℓ elements, the number of elements in an original signature is at least linear in ℓ. As far as we know, in some redactable signature schemes, the number of elements in an original signature is constant, regardless of the number of elements in a message to be signed. However, these constructions have drawbacks in that the use of the random oracle model or generic group model. In this paper, we construct an efficient redactable signature to overcome these drawbacks. Our redactable signature is obtained by combining set-commitment proposed in the recent work by Fuchsbauer et al. (JoC 2019) and digital signatures.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E104-A No.9 pp.1175-1187
- Publication Date
- 2021/09/01
- Publicized
- 2021/03/16
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2020DMP0013
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
- Cryptography and Information Security
Authors
Masayuki TEZUKA
Tokyo Institute of Technology
Keisuke TANAKA
Tokyo Institute of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Masayuki TEZUKA, Keisuke TANAKA, "Redactable Signature with Compactness from Set-Commitment" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 9, pp. 1175-1187, September 2021, doi: 10.1587/transfun.2020DMP0013.
Abstract: Redactable signature allows anyone to remove parts of a signed message without invalidating the signature. The need to prove the validity of digital documents issued by governments is increasing. When governments disclose documents, they must remove private information concerning individuals. Redactable signature is useful for such a situation. However, in most redactable signature schemes, to remove parts of the signed message, we need pieces of information for each part we want to remove. If a signed message consists of ℓ elements, the number of elements in an original signature is at least linear in ℓ. As far as we know, in some redactable signature schemes, the number of elements in an original signature is constant, regardless of the number of elements in a message to be signed. However, these constructions have drawbacks in that the use of the random oracle model or generic group model. In this paper, we construct an efficient redactable signature to overcome these drawbacks. Our redactable signature is obtained by combining set-commitment proposed in the recent work by Fuchsbauer et al. (JoC 2019) and digital signatures.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020DMP0013/_p
Copy
@ARTICLE{e104-a_9_1175,
author={Masayuki TEZUKA, Keisuke TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Redactable Signature with Compactness from Set-Commitment},
year={2021},
volume={E104-A},
number={9},
pages={1175-1187},
abstract={Redactable signature allows anyone to remove parts of a signed message without invalidating the signature. The need to prove the validity of digital documents issued by governments is increasing. When governments disclose documents, they must remove private information concerning individuals. Redactable signature is useful for such a situation. However, in most redactable signature schemes, to remove parts of the signed message, we need pieces of information for each part we want to remove. If a signed message consists of ℓ elements, the number of elements in an original signature is at least linear in ℓ. As far as we know, in some redactable signature schemes, the number of elements in an original signature is constant, regardless of the number of elements in a message to be signed. However, these constructions have drawbacks in that the use of the random oracle model or generic group model. In this paper, we construct an efficient redactable signature to overcome these drawbacks. Our redactable signature is obtained by combining set-commitment proposed in the recent work by Fuchsbauer et al. (JoC 2019) and digital signatures.},
keywords={},
doi={10.1587/transfun.2020DMP0013},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Redactable Signature with Compactness from Set-Commitment
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1175
EP - 1187
AU - Masayuki TEZUKA
AU - Keisuke TANAKA
PY - 2021
DO - 10.1587/transfun.2020DMP0013
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2021
AB - Redactable signature allows anyone to remove parts of a signed message without invalidating the signature. The need to prove the validity of digital documents issued by governments is increasing. When governments disclose documents, they must remove private information concerning individuals. Redactable signature is useful for such a situation. However, in most redactable signature schemes, to remove parts of the signed message, we need pieces of information for each part we want to remove. If a signed message consists of ℓ elements, the number of elements in an original signature is at least linear in ℓ. As far as we know, in some redactable signature schemes, the number of elements in an original signature is constant, regardless of the number of elements in a message to be signed. However, these constructions have drawbacks in that the use of the random oracle model or generic group model. In this paper, we construct an efficient redactable signature to overcome these drawbacks. Our redactable signature is obtained by combining set-commitment proposed in the recent work by Fuchsbauer et al. (JoC 2019) and digital signatures.
ER -
English
