论文标题
可分子的签名，紧凑的签名
Redactable Signature with Compactness from Set-Commitment
论文作者
论文摘要
可分离的签名允许任何人在不使签名无效的情况下删除签名消息的一部分。证明政府发布的数字文件有效性的需求正在增加。当政府披露文件时，他们必须删除有关个人的私人信息。可分割的签名对于这种情况很有用。但是，在大多数可治解的签名方案中，要删除签名消息的一部分，我们需要要删除的每个部分的信息。如果签名的消息由L元素组成，则原始签名中的元素数量至少在L中是线性的。据我们所知，在某些可分割的签名方案中，原始签名中的元素数量是恒定的，无论消息中的元素数量如何。但是，这些构造的缺点是使用随机Oracle模型或通用组模型。在本文中，我们构建了一个有效的可分割签名来克服这些缺点。我们的可分割的签名是通过结合Fuchsbauer等人最近作品中提出的集合承担来获得的。 （JOC 2019）和数字签名。
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 l elements, the number of elements in an original signature is at least linear in l. 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.
