作者: Tapas Pandit , Rana Barua , Somanath Tripathy
DOI: 10.1007/978-3-319-11698-3_33
关键词: Random oracle 、 Computer security model 、 Computer network 、 Protocol (science) 、 Authenticated Key Exchange 、 Public-key cryptography 、 Computer science 、 Session (computer science) 、 ID-based cryptography 、 Forward secrecy 、 Computer security
摘要: Recently, extended Canetti-Krawczyk (eCK) model for Authenticated Key Exchange (AKE) protocol, proposed by LaMacchia, Lauter and Mityagin, is considered to be one of the stronger security models that covers many attacks on existing models. Unfortunately, it does not capture very sensitive barricades, Perfect Forward Secrecy (PFS) Master (MPFS) in ID-based setting. An AKE protocol with PFS (resp. MPFS) ensures revealing static keys parties master secret key private generator), must compromise even a single bit session past sessions between parties. In current status, best our knowledge, there no eCK secure round either or MPFS. Proposed here, are protocols MPFS random oracle model. Towards achieving this goal, we also construct protocols, without (MFS) remaining MFS, almost at same computational cost as efficient Secure Single Round protocols. All under Gap Bilinear Diffie-Hellman (GBDH) problem.