Paper 2009/025
Short Redactable Signatures Using Random Trees
Ee-Chien Chang, Chee Liang Lim, and Jia Xu
Abstract
A redactable signature scheme for a string of objects supports
verification even if multiple substrings are removed from the
original string. It is important that the redacted string and
its signature do not reveal anything about the content of the
removed substrings. Existing schemes completely or partially
leak a piece of information: the lengths of the removed substrings.
Such length information could be crucial for many applications,
especially when the removed substring has low entropy. We
propose a scheme that can hide the length. Our scheme consists
of two components. The first component
Metadata
- Available format(s)
-
PDF PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. CT-RSA 2009
- Keywords
- Redactable SignaturePrivacyRandom tree
- Contact author(s)
- xujia @ comp nus edu sg
- History
- 2009-05-26: last of 4 revisions
- 2009-01-14: received
- See all versions
- Short URL
- https://ia.cr/2009/025
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/025, author = {Ee-Chien Chang and Chee Liang Lim and Jia Xu}, title = {Short Redactable Signatures Using Random Trees}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/025}, year = {2009}, url = {https://eprint.iacr.org/2009/025} }