On the security of a novel and efficient unlinkable secret handshakes scheme

Authors:
Renwang Su
Affiliations:
Department of Information and Computing Science, College of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou, Zhejiang, P.R. China
Venue:
IEEE Communications Letters
Year:
2009

Citing 4
Cited 4

Secret Handshakes from Pairing-Based Key Agreements

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A novel and efficient unlinkable secret handshakes scheme

IEEE Communications Letters
Beyond secret handshakes: affiliation-hiding authenticated key exchange

CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Group secret handshakes or affiliation-hiding authenticated group key agreement

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology

Secret handshakes from ID-based message recovery signatures: A new generic approach

Computers and Electrical Engineering
Secure handshake with symptoms-matching: the essential to the success of mhealthcare social network

Proceedings of the Fifth International Conference on Body Area Networks
A secure handshake scheme with symptoms-matching for mHealthcare social network

Mobile Networks and Applications - Special issue on Wireless and Personal Communications
Private mutual authentications with fuzzy matching

International Journal of High Performance Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quite recently [IEEE Commu. Letters, Vol. 13, No. 5, 2009], Huang and Cao proposed a novel and efficient unlinkable secret handshakes scheme claiming to provide unlinkability and better performance than previously reported ones. In this paper, we will point out their scheme has a serious security loophole due to an inherent design flaw. Thus, we hope that by identifying the design flaw, similar mistakes can be avoided in future unlinkable secret handshakes designs.