Skip to main content
placeholder image

Privacy-preserving k-time authenticated secret handshakes

Journal Article


Download full-text (Open Access)

Abstract


  • Secret handshake allows a group of authorized users to establish a shared secret key and at the same time authenticate each other anonymously. A straightforward approach to design an unlinkable secret handshake protocol is to use either long-term certificate or one-time certificate provided by a trusted authority. However, how to detect the misusing of certificates by an insider adversary is a challenging security issue when using those approaches for unlinkable secret handshake. In this paper, we propose a novel k-time authenticated secret handshake (k-ASH) protocol where each authorized user is only allowed to use the credential for k times. We formalize security models, including session key security and anonymity, for k-ASH, and prove the security of the proposed protocol under some computational problems which are proved hard in the generic bilinear group model. The proposed protocol also achieved public traceability property if a user misuses the k-time credential.

Authors


  •   Tian, Yangguang (external author)
  •   Zhang, Shiwei (external author)
  •   Yang, Guomin
  •   Mu, Yi (external author)
  •   Yu, Yong (external author)

Publication Date


  • 2017

Citation


  • Tian, Y., Zhang, S., Yang, G., Mu, Y. & Yu, Y. (2017). Privacy-preserving k-time authenticated secret handshakes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10343 281-300. Auckland, New Zealand Information Security and Privacy 22nd Australasian Conference (ACISP 2017)

Scopus Eid


  • 2-s2.0-85020678453

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1423&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/422

Number Of Pages


  • 19

Start Page


  • 281

End Page


  • 300

Volume


  • 10343

Place Of Publication


  • Germany

Abstract


  • Secret handshake allows a group of authorized users to establish a shared secret key and at the same time authenticate each other anonymously. A straightforward approach to design an unlinkable secret handshake protocol is to use either long-term certificate or one-time certificate provided by a trusted authority. However, how to detect the misusing of certificates by an insider adversary is a challenging security issue when using those approaches for unlinkable secret handshake. In this paper, we propose a novel k-time authenticated secret handshake (k-ASH) protocol where each authorized user is only allowed to use the credential for k times. We formalize security models, including session key security and anonymity, for k-ASH, and prove the security of the proposed protocol under some computational problems which are proved hard in the generic bilinear group model. The proposed protocol also achieved public traceability property if a user misuses the k-time credential.

Authors


  •   Tian, Yangguang (external author)
  •   Zhang, Shiwei (external author)
  •   Yang, Guomin
  •   Mu, Yi (external author)
  •   Yu, Yong (external author)

Publication Date


  • 2017

Citation


  • Tian, Y., Zhang, S., Yang, G., Mu, Y. & Yu, Y. (2017). Privacy-preserving k-time authenticated secret handshakes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10343 281-300. Auckland, New Zealand Information Security and Privacy 22nd Australasian Conference (ACISP 2017)

Scopus Eid


  • 2-s2.0-85020678453

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1423&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/422

Number Of Pages


  • 19

Start Page


  • 281

End Page


  • 300

Volume


  • 10343

Place Of Publication


  • Germany