Loading...

Analyze and Improvement of Secret Handshake Protocols

Yajam, HabibAllah | 2013

507 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 45507 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Mohajeri, Javad; Salmasizadeh, Mahmoud
  7. Abstract:
  8. In today's world in which a major part of information is digitalized and a large portion of the communication is done via computer networks, entities authentication while maintaining privacy is a concern with the growing importance and value. To meet this goal, during the past two decades, anonymous authentication protocols with different approaches for use in various applications has presented and developed. These protocols enable users to authenticate based on some of their properties, without revealing their own identities. Secret handshake protocols are considered as type of anonymous authentication protocols. This protocol has the unique feature of hiding users' affiliation to the certificate authority from the view of unauthorized users.
    Although numerous secret handshake schemes are presented so far, many of these protocols' problems has remained open. One of these open problems is presenting an unlinkable and revocable secret handshake in which handshakes that are done using a specific certifacte, remain unlinkable even after the revocation of that certificate. In this thesis, by increasing communicational and computational efficiency of the recently proposed scheme, a new secret handshake will be proposed and its security will be proved in the standard model. Based on the first scheme, another scheme will be proposed which provides some new desirable security properties. One of these features is unlinkability after revocation.
    Also based on the view that a secret handshake scheme can be considered as an authenticated key agreement scheme, two identity based universal re-encryption schemes will be introduced. The first scheme is more efficient in means of computation and communication, and its security proof is provided in the random oracle model. While the security proof of second scheme is done in the standard model and has a tighter security bound
  9. Keywords:
  10. Anonymity ; Cryptographic Protocols ; Security ; Mix Net ; Authentication

 Digital Object List

 Bookmark

No TOC