Privacy-preserving k-time authenticated secret handshakes
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 tru...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7370 https://ink.library.smu.edu.sg/context/sis_research/article/8373/viewcontent/Privacy_preserving_k_time_authenticated_secret_handshakes.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-8373 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-83732022-10-13T07:47:24Z Privacy-preserving k-time authenticated secret handshakes TIAN, Yangguang ZHANG, Shiwei YANG, Guomin MU, Yi YU, Yong 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. 2017-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7370 info:doi/10.1007/978-3-319-59870-3_16 https://ink.library.smu.edu.sg/context/sis_research/article/8373/viewcontent/Privacy_preserving_k_time_authenticated_secret_handshakes.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Generic bilinear group model Insider adversary k-time authentication Public traceability Unlinkable secret handshake Information Security |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Generic bilinear group model Insider adversary k-time authentication Public traceability Unlinkable secret handshake Information Security |
spellingShingle |
Generic bilinear group model Insider adversary k-time authentication Public traceability Unlinkable secret handshake Information Security TIAN, Yangguang ZHANG, Shiwei YANG, Guomin MU, Yi YU, Yong Privacy-preserving k-time authenticated secret handshakes |
description |
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. |
format |
text |
author |
TIAN, Yangguang ZHANG, Shiwei YANG, Guomin MU, Yi YU, Yong |
author_facet |
TIAN, Yangguang ZHANG, Shiwei YANG, Guomin MU, Yi YU, Yong |
author_sort |
TIAN, Yangguang |
title |
Privacy-preserving k-time authenticated secret handshakes |
title_short |
Privacy-preserving k-time authenticated secret handshakes |
title_full |
Privacy-preserving k-time authenticated secret handshakes |
title_fullStr |
Privacy-preserving k-time authenticated secret handshakes |
title_full_unstemmed |
Privacy-preserving k-time authenticated secret handshakes |
title_sort |
privacy-preserving k-time authenticated secret handshakes |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2017 |
url |
https://ink.library.smu.edu.sg/sis_research/7370 https://ink.library.smu.edu.sg/context/sis_research/article/8373/viewcontent/Privacy_preserving_k_time_authenticated_secret_handshakes.pdf |
_version_ |
1770576327030603776 |