2014 | OriginalPaper | Buchkapitel
A Dynamic Matching Secret Handshake Scheme without Random Oracles
verfasst von : Yamin Wen, Zheng Gong
Erschienen in: Network and System Security
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Secret handshake schemes allow mutually anonymous authentication between members of organizations. In this paper, a new unlinkable secret handshake scheme with dynamic matching is proposed (which is named
USH-DM
). Considering the existence of multiple different groups, the implementation of
USH-DM
achieves dynamic matching between members among completely different groups. In particular,
USH-DM
enhances the privacy of group members, which enables the transcripts of group members to remain unlinkable and untraceable. Without using the random oracle,
USH-DM
is proved secure by assuming the intractability of the decisional bilinear Diffie-Hellman and subgroup decision problems.