Proving Authenticated Key Exchange via Memory-Efficient Reductions

본문 미리보기

We initiate the study of memory efficiency in proving the security of authenticated key exchange (AKE) protocols: We first revise the security model for AKE protocols in order to prove their security in a memory-efficient manner without compromising its capability of capturing usual attacks. We formally show that security in our model implies {security in} previous ones, and thus our model captures the same security as before. After that we propose a generic construction of AKE from key encap