K-anonymous multi-party secret handshakes

被引:0
作者
Xu, Shouhuai [1 ]
Yung, Moti [2 ]
机构
[1] Univ Texas San Antonio, Dept Comp Sci, San Antonio, TX 78249 USA
[2] Columbia Univ, EMC Corp, Dept Comp Sci, RSA Lab, New York, NY USA
来源
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY | 2007年 / 4886卷
关键词
privacy-preserving authentication; anonymity; unlinkability; secret handshake; credential systems; reusable credentials; multiple personality prevention;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Anonymity-protection techniques are crucial for various commercial and financial transactions, where participants are worried about their privacy. On the other hand, authentication methods are also crucial for such interactions. Secret handshake is a relatively recent mechanism that facilitates privacy-preserving mutual authentication between communicating peers. In recent years, researchers have proposed a set of secret handshake schemes based on different assumptions about the credentials used: from one-time credentials to the more general PKI-like credentials. In this paper, we concentrate on k-anonymous secret handshake schemes based on PKI-like infrastructures. More specifically, we deal with the k-anonymous m-party (m > 2) secret handshake problem, which is significantly more involved than its two-party counterpart due to the following: When an honest user hand-shakes with m - 1 parties, it must be assured that these parties are distinct; otherwise, under the mask of anonymity a dishonest participant may clone itself in a single handshake session (i.e., assuming multiple personalities).
引用
收藏
页码:72 / +
页数:4
相关论文
共 28 条
[1]  
AIELLO W, 2002, P 9 ACM C COMP COMM, P48
[2]  
BALFANZ D, P 2003 IEEE S SEC PR
[3]  
Bellare M., 1995, LNCS, V950, P92, DOI [DOI 10.1007/BFB0053428, 10.1007/BFb0053428]
[4]  
Bellare M, 2001, LNCS, P566, DOI [10.1007/3-540-45682-1_33, DOI 10.1007/3-540-45682-1]
[5]  
Bellare Mihir, 1993, P 1 ACM C COMP COMM, P62, DOI DOI 10.1145/168588.168596
[6]  
BLOM R, 1985, LECT NOTES COMPUT SC, V209, P335
[7]  
Blundo C., 1993, LNCS, V740, P471
[8]  
BOYD C, DENIABLE AUTHENTICAT
[9]  
Castelluccia C, 2004, LECT NOTES COMPUT SC, V3329, P293
[10]  
CHAUM D, 1991, LECT NOTES COMPUT SC, V547, P257