tgoop.com/ce_khu/3216
Last Update:
Non-Interactive Key-Exchange Protocols
الهه صادقی
In this work, we initiate a study of
K-NIKE protocols in the fine-grained setting, in which there is a polynomial gap between the running time of the honest parties and that of the adversary. Our goal is to show the possibility, or impossibility, of basing such protocols on weaker assumptions than those of
K-NIKE for K >= 3.
We improve the security by further using algebraic structures, while avoiding pairings. In particular, we show that there is a 4-party NIKE in Shoup's generic group model with a quadratic gap between the number of queries by the honest parties vs. that of the adversary.
پیشنیاز های علمی:
Basic Knowledge of Group Theory and Cryptography.
I will explain the intuition behind every part of the lecture though, so everyone are welcome to join.
