Pseudo trust: Zero-knowledge authentication in anonymous P2Ps

被引:38
作者
Lu, Li [1 ,2 ]
Han, Jinsong [1 ]
Liu, Yunhao [1 ,7 ]
Hu, Lei [3 ]
Huai, Jinpeng [4 ]
Ni, Lionel M. [1 ,6 ,8 ]
Ma, Jian [5 ,9 ,10 ,11 ]
机构
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Engn & Comp Sci, Chengdu 610054, Peoples R China
[3] Chinese Acad Sci, Grad Univ, State Key Lab Informat Secur, Beijing 100049, Peoples R China
[4] Beihang Univ, State Key Lab Software Developing Environm, Beijing 100083, Peoples R China
[5] Nokia Res Ctr, Beijing 100013, Peoples R China
[6] Hong Kong Univ Sci & Technol, China Minist Educ, Microsoft Res Asia IT Key Lab, Hong Kong, Hong Kong, Peoples R China
[7] Xian Jiaotong Univ, Xian 710049, Peoples R China
[8] HKUST, Digital Life Res Ctr, Hong Kong, Hong Kong, Peoples R China
[9] Beijing Univ Posts & Telecommun, Beijing, Peoples R China
[10] Chinese Acad Sci, Grad Univ, Beijing, Peoples R China
[11] Tongji Univ, Shanghai 200092, Peoples R China
基金
中国国家自然科学基金;
关键词
Peer-to-Peer; authentication; mutual anonymity; trust; Zero-Knowledge Proof;
D O I
10.1109/TPDS.2008.15
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Most trust models in Peer-to-Peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence, there exists an inherent trade-off between trust and anonymity. To the best of our knowledge, there is currently no P2P protocol that provides complete mutual anonymity as well as authentication and trust management. We propose a zero-knowledge authentication scheme called Pseudo Trust (PT), where each peer, instead of using its real identity, generates an unforgeable and verifiable pseudonym using a one-way hash function. A novel authentication scheme based on Zero-Knowledge Proof is designed so that peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identity-based trust management schemes become applicable in mutual anonymous P2P systems. We analyze the security and the anonymity in PT and evaluate its performance using trace-driven simulations and a prototype PT-enabled P2P network. The strengths of our design include the following: 1) no need for a centralized trusted party or Certificate Authority (CA); 2) high scalability and security; 3) low traffic and cryptography processing overheads; and 4) man-in-the-middle-attacks resistance.
引用
收藏
页码:1325 / 1337
页数:13
相关论文
共 25 条
  • [1] ABDULRAHMAN A, 1997, P NEW SEC PAR WORKSH
  • [2] [Anonymous], P INT C WORLD WID WE
  • [3] Borisov N, 2005, THESIS U CALIFORNIA
  • [4] BRANDT J, 1990, P ADV CRYPTOLOGY CRY
  • [5] CIACCIO G, 2006, P PRIV ENH TECHN WOR
  • [6] DAMIANI E, 2002, P ACM C COMP COMM SE
  • [7] DRAGOVIC B, 2003, P IEEE TRUST PRIV DI
  • [8] FIEGE U, 1987, P ACM C THEOR COMP S
  • [9] *FIPS PUB, 2007, 186 FIPS PUB
  • [10] Goldreich O, 2001, FDN CRYPTOGRAPHY BAS