Loading...
An Efficient and Light Provably Secure Identification Protocol
Kargar, Mohammad Ali | 2013
886
Viewed
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 45319 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Jalili, Rasool
- Abstract:
- Identification protocols facilitates two participants A and B to identify themselves to each other. Beside identification, A and B can exchange a secret value along with the identification process as the key exchange identification protocol.A secure key exchange identification protocol hould utilize perfect forward secrecy (PFS) property. PFS means if an attacker could compromise an entity in future and gain its long-term key, he cannot succeed to extract previous session keys. So, he will be unable to decrypt previous messages and they will remain secure. Because of the low power and storage of light devices, updating secret shared keys is a solution to reach PFS in such protocols. A major problem dealing with such kind of protocols is desynchronization attack. It means at the presence of A and B, the attacker communicates with one entity (for example A) and forces A to update his secret key; hence A’s secret key is different from B’s secret key. This thesis proposes a light security protocol that uses a new solution against the desynchronization attack. In the proposed protocol, it is assumed that always an attacker exists which can perform a successful desynchronization attack.
It has used the existence of pseudorandom function (PRF) assumption to
prove the proposed protocol’s security - Keywords:
- Identification ; Authenticated Group Key Exchange Protocol ; Provable Security ; Perfect Forward Secrecy
- محتواي کتاب
- view
- 1 مقدمه
- 2 پیشنیازها
- 3 مروری بر پروتکلهای هویتشناسی
- 4 بررسی مدل BR
- 5 راهکار پیشنهادی
- 6 نتیجهگیری و کارهای آتی
- آ پیادهسازی
- کتابنامه
- واژهنامهی فارسی به انگلیسی
- واژهنامهی انگلیسی به فارسی