Next Article in Journal
Duplication Detection When Evolving Feature Models of Software Product Lines
Next Article in Special Issue
Analysis of Two-Worm Interaction Model in Heterogeneous M2M Network
Previous Article in Journal
Toward E-Content Adaptation: Units’ Sequence and Adapted Ant Colony Algorithm
Previous Article in Special Issue
Influences of Removable Devices on the Anti-Threat Model: Dynamic Analysis and Control Strategies
Article Menu

Export Article

Open AccessArticle
Information 2015, 6(4), 576-591; doi:10.3390/info6040576

A Backward Unlinkable Secret Handshake Scheme with Revocation Support in the Standard Model

1
School of Mathematics and Statistics, Guangdong University of Finance & Economics, Guangzhou 510320, China
2
Shanghai Key Laboratory of Integrated Administration Technologies for Information Security, Shanghai 200240, China
3
School of Computer Science, South China Normal University, Guangzhou 510631, China
4
State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China
5
School of Computer Science and Technology, South China University of Technology, Guangzhou 510641, China
*
Author to whom correspondence should be addressed.
Academic Editors: Qiong Huang and Guomin Yang
Received: 28 July 2015 / Revised: 31 August 2015 / Accepted: 21 September 2015 / Published: 7 October 2015
(This article belongs to the Special Issue Cybersecurity and Cryptography)
View Full-Text   |   Download PDF [362 KB, uploaded 7 October 2015]   |  

Abstract

Secret handshake schemes have been proposed to achieve private mutual authentications, which allow the members of a certain organization to anonymously authenticate each other without exposing their affiliations. In this paper, a backward unlinkable secret handshake scheme with revocation support (BU-RSH) is constructed. For a full-fledged secret handshake scheme, it is indispensable to furnish it with practical functionality, such as unlinkability, revocation and traceability. The revocation is achieved in the BU-RSH scheme, as well as the unlinkability and the traceability. Moreover, the anonymity of revoked members is improved, so that the past transcripts of revoked members remain private, i.e., backward unlinkability. In particular, the BU-RSH scheme is provably secure in the standard model by assuming the intractability of the `-hidden strong Diffie-Hellman problem and the subgroup decision problem. View Full-Text
Keywords: secret handshakes; mutual authentication; backward unlinkability; revocation; standard model secret handshakes; mutual authentication; backward unlinkability; revocation; standard model
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Wen, Y.; Gong, Z.; Xu, L. A Backward Unlinkable Secret Handshake Scheme with Revocation Support in the Standard Model. Information 2015, 6, 576-591.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top