检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学计算机学院,陕西西安710071 [2]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071
出 处:《西安电子科技大学学报》2008年第4期639-644,共6页Journal of Xidian University
基 金:国家自然科学基金面上项目资助(60473028)
摘 要:提出了一种在再加密型混合网中实现可撤销匿名性的新方法.发送者在提交密文组时必须附加一个用匿名回收机构的公钥加密的身份信息.来源于不同发送者的密文与相应的加密身份被共同输入混合网进行再加密和混洗.改进的秘密混洗证明协议可以确保在混洗过程中两种密文始终绑定在一起.在输出阶段混合服务器组的一个法定团体只对每个密文组中的普通密文进行联合解密,并产生一个门限签名以保证输出消息与加密的发送者身份相互对应.在追踪恶意消息时,匿名回收机构只需解密与之对应的加密身份.与先前的工作相比,所提方法只额外增加1个ElGamal对,因而需要更少的指数运算量和通信量.A new method for achieving revocable anonymity in re-encryption mix networks is presented. Each sender is required to append his identity information encrypted under the public key of an anonymity revocation authority to every ciphertext submitted by him. Then ciphertexts from different senders, as well as their encrypted identities, are re-encrypted and shuffled together by the mix net. The adjusted secret shuffle proof protocol can guarantee the bindings of these two types of ciphertexts in the mixing process. In the output phase, a quorum of mix servers jointly decrypts every normal ciphertext and generates a threshold signature to keep the correspondence between every output message and its sender' s re-encrypted identify. When tracing a vicious message, the anonymity revocation authority just needs to decrypt its corresponding encrypted identifies. Compared with the previous work, our method needs only 1 additional ElGamal pair and involves less exponential computation and communication.
分 类 号:TN918[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.141.175