Loading...
Conceptual Analysis and Extension of Zero-Knowledge Models & Definitions
Dousti, Mohammad Sadeq | 2015
438
Viewed
- Type of Document: Ph.D. Dissertation
- Language: Farsi
- Document No: 47509 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Jalili, Rasool
- Abstract:
- Zero-knowledge proofs are one of the most useful constructions of modern cryptography. Their invention has greatly affected both cryptography and complexity theories. The seemingly paradoxical characteristic of zero-knowledge proofs is that they convince the verifier of the validity of the proposition being proved, yet they yield to further knowledge to him. Two primary applications of zero-knowledge proofs are authentication protocols, as well as sub-protocols which prove that parties involved in some main protocol have acted honestly. In this research, we will survey the models and definitions of zero-knowledge, and analyze their relationship. We then pertain to the interplay between zero-knowledge and authentication models. We will see that a limited authentication model, called smart-card model, is consistent with zero-knowledge from an efficiency point of view. That is, there exist efficient zero-knowledge authentication protocols in this model. After consolidating all definitions of authentication in the smart-card model, we will present a very efficient zero-knowledge authentication protocol in this model. The protocol is zero-knowledge even with respect to infinitely powerful adversaries. Furthermore, it is conjectured that the protocol remains a secure authentication protocol, even in the advent of quantum computers. Next, we consider general authentication models, and observe that current definitions of zero-knowledge are not with these models. After a conceptual analysis of zero-knowledge models, we suggest two hierarchies of zero-knowledge models, and propose a protocol which is zeroknowledge according to one level of these hierarchies, and can be used as an efficient authentication protocol
- Keywords:
- Authentication ; Interactive Argument ; Cryptography ; Security ; Zero-Knowledge Proof ; Interactive Proof Systems ; Knowledge Proof
- محتواي کتاب
- view
- بسم الله
- صفحۀ عنوان
- تقدیر و تشکّر
- چکیده
- فهرست مطالب
- فهرست تصاویر
- فهرست جداول
- فهرست پروتکلها
- فهرست الگوریتمها
- فهرست نمادها
- 1 مقدّمه
- 2 اثباتهای تعاملی
- 3 اثباتهای نا آگاهساز
- 4 تأثیر متقابل مدلهای نا آگاهسازی و مدلهای تصدیق هویّت
- 5 بهبود مدلهای نا آگاهسازی
- 6 جمعبندی و سوی کارهای آتی
- مراجع
- پیوستها
- الف مقدّمهای بر نظریۀ پیچیدگی
- الف-1 تعاریف اولیه
- الف-2 روابط پیچیدگی میان زمان و فضا
- الف-3 کلاسهای پیچیدگی مهم
- الف-4 روابط بین کلاسهای پیچیدگی
- الف-5 پیشگوها، ماشینهای پرسوجو، و نسبیسازی
- الف-6 تحویل و مسائل کامل
- الف-7 سلسله مراتب زمانی چندجملهای
- الف-8 برخی مسائل کامل برای کلاسهای پیچیدگی معروف
- الف-9 پیچیدگی شمارش و عملگرهای پیچیدگی
- الف-10 مدل محاسباتی غیر یکنواخت
- الف-11 ماشینهای تورینگ غیر یکنواخت و خانوادۀ مدارهای یکنواخت
- الف-12 خلاصه
- ب تعاریف و اثباتهایی از مبانی رمزنگاری
- پ واژگان
- چکیدۀ انگلیسی
- صفحۀ عنوان انگلیسی