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.

Highlights

  • Since online applications via public networks are widely popularized, privacy is more and more important for the development of web services

  • We provide a new backward unlinkable secret handshake scheme with revocation supports (BU-RSH)

  • The secret handshake scheme (SHS) operates in an environment that consists of a set of groups managed by a set of group authorities and a set of users U1, · · ·, Un registered into some groups

Read more

Summary

A Backward Unlinkable Secret Handshake Scheme with

Shanghai Key Laboratory of Integrated Administration Technologies for Information Security, Shanghai 200240, China. Received: 28 July 2015 / Accepted: 21 September 2015 / Published: 7 October 2015

Introduction
Preliminaries
Bilinear Pairings of Composite Order
Complexity Assumptions
Secret Handshakes
Security
Performance Analysis
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call