RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2016 Volume 7, Issue 4, Pages 117–132 (Mi mvk207)

A security proof for key exchange protocols

T. Q. Phong, N. Q. Toan, K. X. Thanh

Institute of Cryptography Science and Technology, Government Information Security Committee, Viet Nam

Abstract: We present a technique of modular security proofs for key exchange protocols in the modified Bellare–Rogaway (mBR) model introduced by C. Kudla and K. G. Paterson. We have applied this technique to modify Protocol 1 in their paper to Protocol 2 and analyze its security in this model. These two protocols differ only in the combination of the ephemeral and long-term private keys in the computation of the session key. Our method for proving strong partnering of Protocol may be applied to prove a same result (stated without proof) by C. Kudla and K. G. Paterson.

Key words: modular method, security proof, strong partnering, mBR model, Bellare–Rogaway model, Canetti–Krawczyk model.

UDC: 519.719.2

Received 10.VI.2016

Language: English

DOI: 10.4213/mvk207



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025