秘密认证中的可否认性问题  

Deniable problems in secret authentication

作　　者：唐强[1] 姬东耀[1] 

机构地区：[1]中国科学院研究生院信息安全国家重点实验室,北京100049

出　　处：《中国科学院研究生院学报》2009年第6期835-840,共6页Journal of the Graduate School of the Chinese Academy of Sciences

基　　金：国家自然科学基金(90604010);国家973计划(2007CB311202);国家863计划(2006AA01Z427)资助

摘　　要：针对一类隐私性问题,一些特定组织中的成员只愿意与本组成员进行一些交流,或者发布一些请求;接收方不是该小组的成员时,不能获知消息;当双方在一个小组时,消息能够被阅读并要求经过认证;通信结束时,发送方不希望接收方向其他人证明他曾发送某请求.目前所有的相关研究都不能很好地解决这类问题.我们形式化地描述了这个问题,构造了一个非交互的可否认的秘密认证协议,并证明了该协议的安全性和可否认性.One privacy-related problem is that the member in a group would like to only communicate with the member of the same group. When they are in the same group, message should be authenticated. Otherwise, nothing about the affiliation information could be leaked. After the communication, the sender would not like to leave evidence for convincing others. To the best of our knowledge, all the existing designs are not efficient in solving this kind of problems. We formalized the problem, proposed a non-interactive deniable organization hiding authentication, and proved our scheme in our model.

关 键 词：隐私保护 可否认认证 秘密握手 可证安全 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]