论文标题
N可分子签名方案
A t-out-of-n Redactable Signature Scheme
论文作者
论文摘要
可分割的签名方案允许在不使签名无效的情况下删除签名消息的一部分。当前,证明政府和企业发行的数字文件的有效性的需求正在增加。但是,在披露文件时,政府和企业必须删除有关个人的隐私信息。可分割的签名方案对于这种情况很有用。在本文中,我们介绍了N-N-Readialctable签名方案的新概念。该方案具有签名者,n个编辑器,一个组合仪和一个验证者。签名者提前指定了n个编辑器和组合仪,并生成了消息的签名。每个编辑器都会决定他或她想从消息中删除的零件并生成一块修复信息。 Combiner从所有编辑器中收集了一些修订信息,提取了一部分消息的一部分,该消息比T redactors要删除更多,并生成了编辑的消息。我们考虑一次一次性修订模型,该模型允许仅一次由签名者生成一次。我们正式化了一次性的n可分子签名方案,定义安全性,并使用随机Oracle模型中的基于配对的聚合签名方案进行构造。
A redactable signature scheme allows removing parts of a signed message without invalidating the signature. Currently, the need to prove the validity of digital documents issued by governments and enterprises is increasing. However, when disclosing documents, governments and enterprises must remove privacy information concerning individuals. A redactable signature scheme is useful for such a situation. In this paper, we introduce the new notion of the t-out-of-n redactable signature scheme. This scheme has a signer, n redactors, a combiner, and a verifier. The signer designates n redactors and a combiner in advance and generates a signature of a message M. Each redactor decides parts that he or she wants to remove from the message and generates a piece of redaction information. The combiner collects pieces of redaction information from all redactors, extracts parts of the message that more than t redactors want to remove, and generate a redacted message. We consider the one-time redaction model which allows redacting signatures generated by the signer only once. We formalize the one-time redaction t-out-of-n redactable signature scheme, define security, and give a construction using the pairing based aggregate signature scheme in the random oracle model.