A New Secret Handshakes Scheme with Dynamic Matching Based on ZSS

Balfanz et al. in 2003, introduced the primitive secret handshakes (SH) as a two party protocol together with a notion of roles and implements it using pairing based cryptography, the scheme allows two parties to make a match (authentication & verification) and derive a shared common session key if and only if they belong to same group. If the parties do not belong to the same group, they cannot make any conclusion about the veracity of other’s affiliation. Ateniese et al. in 2007 presented a SH with dynamic matching in which each party can specify both the group and the role the other must have in order to complete a successful handshake. This paper presents a new SH scheme with dynamic matching which is computationally comparable with the scheme of Ateniese et al. The proposed scheme is inspired on an identity based authenticated key agreement proposed by McCullagh et al. and uses ZSS signature. The paper also gives security proofs for the new scheme in the random oracle.

[1]  Gene Tsudik,et al.  Secret Handshakes from CA-Oblivious Encryption , 2004, ASIACRYPT.

[2]  Fangguo Zhang,et al.  Secret handshakes from ID-based message recovery signatures: A new generic approach , 2012, Comput. Electr. Eng..

[3]  Zheng Gong,et al.  An Unlinkable Secret Handshake with Fuzzy Matching for Social Networks , 2013, 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.

[4]  Shouhuai Xu,et al.  k-anonymous secret handshakes with reusable credentials , 2004, CCS '04.

[5]  Damien Vergnaud,et al.  RSA-Based Secret Handshakes , 2005, WCC.

[6]  Kee-Young Yoo,et al.  Efficient Unlinkable Secret Handshakes for Anonymous Communications , 2010 .

[7]  Diana K. Smetters,et al.  Secret handshakes from pairing-based key agreements , 2003, 2003 Symposium on Security and Privacy, 2003..

[8]  Refik Molva,et al.  A provably secure secret handshake with dynamic controlled matching , 2010, Comput. Secur..

[9]  Yi Mu,et al.  New Construction of Group Secret Handshakes Based on Pairings , 2007, ICICS.

[10]  Jie Gu,et al.  An Improved Efficient Secret Handshakes Scheme with Unlinkability , 2011, IEEE Communications Letters.

[11]  Eun-Jun Yoon,et al.  Cryptanalysis of an Efficient Secret Handshakes Scheme with Unlinkability , 2011 .

[12]  Refik Molva,et al.  Secret Handshakes with Revocation Support , 2009, ICISC.

[13]  Preeti Kulshrestha,et al.  Cryptanalysis of Efficient Unlinkable Secret Handshakes for Anonymous Communications , 2015 .

[14]  Xiaomin Liu,et al.  Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes , 2007, ACNS.

[15]  Young-Ho Park,et al.  Security analysis of an unlinkable secret handshakes scheme , 2010, IEEE Communications Letters.

[16]  Xiaohui Liang,et al.  Secure handshake with symptoms-matching: the essential to the success of mhealthcare social network , 2010, BODYNETS.

[17]  Zhenfu Cao,et al.  A novel and efficient unlinkable secret handshakes scheme , 2009, IEEE Communications Letters.

[18]  Reihaneh Safavi-Naini,et al.  An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.

[19]  Yi Mu,et al.  Three-Round Secret Handshakes Based on ElGamal and DSA , 2006, ISPEC.

[20]  Marina Blanton,et al.  Secret Handshakes with Dynamic and Fuzzy Matching , 2007, NDSS.

[21]  Paulo S. L. M. Barreto,et al.  A New Two-Party Identity-Based Authenticated Key Agreement , 2005, CT-RSA.

[22]  Renwang Su.  On the security of a novel and efficient unlinkable secret handshakes scheme , 2009, IEEE Communications Letters.

[23]  Kazuki Yoneyama,et al.  Secret Handshake: Strong Anonymity Definition and Construction , 2009, ISPEC.