1 / 14

A novel and efficient unlinkable secret handshakes scheme

This paper examines a novel and efficient unlinkable secret handshakes scheme proposed by Huang and Cao. The scheme is designed for affiliation-hiding authentication, enabling parties (like FBI agents) to interact without disclosing their affiliations. This work analyzes the advantages and practical applications of unlinkability, addressing security concerns raised by previous models. Huang and Cao’s scheme, distinguished by its efficiency, significantly enhances authenticated key exchange security. However, subsequent critiques highlight vulnerabilities, raising important discussions on secure communication protocols.

acton
Télécharger la présentation

A novel and efficient unlinkable secret handshakes scheme

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A novel and efficient unlinkable secret handshakes scheme Author: Hai Huang and ZhenfuCao Source: IEEE Comm. Letters 13 (5) (2009) Presenter: Yu-Chi Chen

  2. Outline • Introduction • Huang and Cao’s scheme • Conclusions

  3. Introduction • A secret handshakes • affiliation-hiding authentication • firstly introduced by Balfanz et al. • For example, two FBIagents, Alice and Bob, want to discover and communicates with other agents, but they don’t want to reveal their affiliations to non-agents.

  4. Introduction • An unlinkable secret handshakes • provide unlinkability • an adversary cannot link any two different instances of same party. • Given C, to guess C is AB, A’B’, or other. • unlinkabilityhas been widely considered in many applications.

  5. Introduction • Jarecki et al.’s scheme • an unlinkable secret handshakes • not efficient • Huang and Cao presented an unlinkable secret handshake scheme • novel and efficient • Simple, so it can be published in IEEE-CL.

  6. Outline • Introduction • Huang and Cao’s scheme • Conclusions

  7. Huang and Cao’s scheme This figure is copied from IEEE Comm. Letters 13 (9) (2009), page 731

  8. Conclusions • Huang and Cao analyzed this scheme can provide authenticated key exchange security, affiliation-hiding, and unlinkability. • The scheme is more efficient than Jarecki et al.’s.

  9. On the security of a novel and efficient unlinkable secret handshakes scheme Author: Renwang Su Source: IEEE Comm. Letters 13 (9) (2009)

  10. Su found Huang and Cao’s scheme is not secure. • Cannot provide authenticated key exchange security.

  11. This figure is copied from IEEE Comm. Letters 13 (9) (2009), page 731

  12. Security analysis of an unlinkable secret handshakes scheme Author: T.-Y. Youn and Y.-H. Park Source: IEEE Comm. Letters 14 (1) (2009)

  13. Youn and Park also found Huang and Cao’s scheme is not secure. • Cannot provide authenticated key exchange securityand affiliation-hiding.

  14. Receiving vB,thentry find PK where vB=H1(KA, (PK, EA, EB), resp)

More Related