一种改进的k-匿名消息传输协议  

An Improved k-anonymous Message Transmission Protocol

作　　者：李龙海[1] 付少锋[1] 肖国镇[2] 

机构地区：[1]西安电子科技大学计算机学院,陕西西安710071 [2]西安电子科技大学综合业务网理论与关键技术国家重点实验室,陕西西安710071

出　　处：《四川大学学报（工程科学版）》2007年第2期145-149,共5页Journal of Sichuan University (Engineering Science Edition)

基　　金：国家自然科学基金资助项目(60473028)

摘　　要：为了在网络通信中更有效地保护用户的隐私,基于Ahn的工作提出了一种改进的k-匿名消息传输协议。首先利用秘密共享技术为群内每个用户建立会话密钥,并使这些密钥之和为0。然后每个用户在一轮通信中只需广播一个用其会话密钥加密的消息,最后将所有广播数据乘到一起就可以获得真正的匿名消息。为保障系统公平性,利用秘密输入不可区分的知识证明技术构建了一种具有常数级轮复杂度的子协议。改进后传输子协议的计算和通信复杂度降低为原来的1/M(M为群内用户数),而公平性子协议的复杂度降低为原来的1/λ(λ为安全参数),并且可以证明改进协议的匿名性建立在判定性Diffie-Hellman假设基础之上。To provide effective privacy protection for participants in network communication, an improved k -anonymous message transmission protocol was proposed based on Ahn＇ s work. Some secret sharing techniques were employed to set up session keys for every user within a group and the sum of these keys was kept equal to zero. Each user was required to broadcast a single message encrypted by his secret session key in a communication round. The meaningful anonymous messages could be recovered by multiplying all the broadcast data together. A sub-protocol with constant round complexity was also constructed based on the witness indistinguishable proof techniques to guarantee fairness. The computation and communication complexity of the improved transmission sub-protocol was reduced by a factor of M （the number of users within a group）, and that of the sub-protocol with fairness by a factor of A （ the security parameter）. It can be proved that the anonymity of the improved protocol is based on the Decisional Diffie-Hellman assumption.

关 键 词：匿名通信 k-匿名性 知识证明 判定性Diffie-Hellman假设 

分 类 号：TN918[电子电信—通信与信息系统] TP309[电子电信—信息与通信工程]