基于集合承诺的可删减紧凑签名
Redactable Signature with Compactness from Set-Commitment
AI总结：
本文基于 Fuchsbauer 等人提出的 set-commitment 与数字签名相结合，构建了一种高效且原始签名大小恒定的可删减签名方案，克服了现有方案依赖随机预言机模型或通用群模型的缺点。
摘要：
可删减签名允许任何人移除已签名消息的部分内容而不使签名失效。证明政府签发的数字文档有效性的需求正在增加。当政府公开文档时，必须移除涉及个人的隐私信息。可删减签名适用于此类情况。然而，在大多数可删减签名方案中，为了移除已签名消息的部分内容，我们需要针对每个想要移除的部分获取相应的信息。如果已签名消息由 l 个元素组成，则原始签名中的元素数量至少与 l 呈线性关系。据我们所知，在某些可删减签名方案中，原始签名的元素数量是恒定的，与待签名消息中的元素数量无关。然而，这些构造存在缺点，即使用了随机预言机模型或通用群模型。在本文中，我们构建了一种高效的可删减签名以克服这些缺点。我们的可删减签名是通过结合 Fuchsbauer 等人（JoC 2019）近期工作中提出的 set-commitment 与数字签名而获得的。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
