a novel and efficient unlinkable secret handshakes scheme
Download
Skip this Video
Download Presentation
A novel and efficient unlinkable secret handshakes scheme

Loading in 2 Seconds...

play fullscreen
1 / 14

A novel and efficient unlinkable secret handshakes scheme - PowerPoint PPT Presentation


  • 85 Views
  • Uploaded on

A novel and efficient unlinkable secret handshakes scheme. Author: Hai Huang and Zhenfu Cao Source: IEEE Comm. Letters 13 (5) (2009) Presenter: Yu-Chi Chen. Outline. Introduction Huang and Cao’s scheme Conclusions. Introduction. A secret handshakes

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' A novel and efficient unlinkable secret handshakes scheme' - acton


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
a novel and efficient unlinkable secret handshakes scheme

A novel and efficient unlinkable secret handshakes scheme

Author: Hai Huang and ZhenfuCao

Source: IEEE Comm. Letters 13 (5) (2009)

Presenter: Yu-Chi Chen

outline
Outline
  • Introduction
  • Huang and Cao’s scheme
  • Conclusions
introduction
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.
introduction1
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.
introduction2
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.
outline1
Outline
  • Introduction
  • Huang and Cao’s scheme
  • Conclusions
huang and cao s scheme
Huang and Cao’s scheme

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

conclusions
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.
on the security of a novel and efficient unlinkable secret handshakes scheme

On the security of a novel and efficient unlinkable secret handshakes scheme

Author: Renwang Su

Source: IEEE Comm. Letters 13 (9) (2009)

slide10

Su found Huang and Cao’s scheme is not secure.

    • Cannot provide authenticated key exchange security.
security analysis of an unlinkable secret handshakes scheme

Security analysis of an unlinkable secret handshakes scheme

Author: T.-Y. Youn and Y.-H. Park

Source: IEEE Comm. Letters 14 (1) (2009)

slide13

Youn and Park also found Huang and Cao’s scheme is not secure.

    • Cannot provide authenticated key exchange securityand affiliation-hiding.
slide14

Receiving vB,thentry find PK

where vB=H1(KA, (PK, EA, EB), resp)

ad