CFP last date
22 July 2024
Reseach Article

Secret Handshakes based on Shortened Versions of DSS

by Preeti Kulshrestha, Arun Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 132 - Number 15
Year of Publication: 2015
Authors: Preeti Kulshrestha, Arun Kumar

Preeti Kulshrestha, Arun Kumar . Secret Handshakes based on Shortened Versions of DSS. International Journal of Computer Applications. 132, 15 ( December 2015), 13-18. DOI=10.5120/ijca2015907565

@article{ 10.5120/ijca2015907565,
author = { Preeti Kulshrestha, Arun Kumar },
title = { Secret Handshakes based on Shortened Versions of DSS },
journal = { International Journal of Computer Applications },
issue_date = { December 2015 },
volume = { 132 },
number = { 15 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 13-18 },
numpages = {9},
url = { },
doi = { 10.5120/ijca2015907565 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T23:29:29.433274+05:30
%A Preeti Kulshrestha
%A Arun Kumar
%T Secret Handshakes based on Shortened Versions of DSS
%J International Journal of Computer Applications
%@ 0975-8887
%V 132
%N 15
%P 13-18
%D 2015
%I Foundation of Computer Science (FCS), NY, USA

Balfanz et al. in 2003 introduced secret handshakes as mechanisms designed to prove group membership and share a secret key between two fellow group members. A secret handshake protocol allows two users to mutually verify another’s authenticity without revealing their own identity. In a secret handshake Verification if the verification succeeds the users may compute a common shared key for further communication. Thus secret handshakes can be appropriately turned into an authenticated key exchange protocol. The present paper proposes two secret handshakes scheme based on variations DSS-1 and DSS-2 of DSS signature. It is shown that proposed schemes are secure under the random oracle model along with comparison of computational complexity of proposed schemes with existing schemes.

  1. Ateniese G., Blanton M. and Kirsch J. 2007. Secret handshakes with dynamic and fuzzy matching. In Network and Distributed System Security Symposium, NDSS (2007), 159-177.
  2. Balfanz D., Durfee G., Shankar N., Smetters D., Staddon J., and Wong H. C. 2003. Secret handshakes from pairing based key agreement. In IEEE Symposium on Security and Privacy, (2003), 180-196.
  3. Castelluccia C., Jarecki S., and Tsudik G. 2004. Secret handshake from ca-oblivious encryption. In ASIACRYPT, (2004), 293-307.
  4. Elgamal T. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, (July 1985), Vol. IT-31.
  5. Girault M. 1991. Self certified public keys. Proceeding in EUROCRYPT’ 91, LNCS #547, Springer- Verlag, (1991), 490-497.
  6. Kulshrestha P., Pal A. K., and Chauhan M. S. 2015. Cryptanalysis of efficient unlinkable secret handshakes for anonymous communications. IOSR Journal of Computer Engineering, (2015), vol. 17, issue II, 71-74.
  7. Kulshrestha P. and Pal A. K. 2015. A new secret handshakes scheme with dynamic matching based on ZSS. International Journal of Network Security and its Applications, (2015), vol. 7, no. 1, p. 67-78.
  8. Okamoto E. and Tanaka K. 1989. Key distribution systems based on identification information”. IEEE Journal on Selected Areas in Communications, (1989), 481-485.
  9. Vergnaud D. 2005. RSA-based secret handshakes. Proceedings in WCC 2005, LNCS #3969, Springer- Verlag, (2005), 252-274
  10. Wen Y., Zhang F. and Xu L. 2012.Secret handshakes from id-based message recovery signatures: a generic approach. Computers and Electrical Engineering Vol. 38, (2012), 96-104.
  11. Zhou L., Susilo W. and Mu Y. 2006. Three round secret handshakes based on ElGamal and DSA. Proceedings in ISPEC (2006), LNCS #3903, Springer-Verlag, 332-342.
Index Terms

Computer Science
Information Sciences


Secret Handshakes Credential ElGamal DSA DSS-1 DSS-2 Computational Complexity.