Computationally Secure Two-Round Authenticated Message Exchange
We prove secure a concrete and practical two-round authen ticated message exchange protocol which reflects the authen tication mechanisms for web services discussed in various standardization documents. The protocol consists of a single client request and a subsequent server response and works under the realistic assumptions that the responding server is long-lived, has bounded memory, and may be reset occa sionally. The protocol is generic in the sense that it can be used to implement securely any service based on authenti cated message exchange, because request and response can carry arbitrary payloads. Our security analysis is a compu tational analysis in the Bellare-Rogaway style and thus pro vides strong guarantees; it is novel from a technical point of view since we extend the BeUare-Rogaway framework by timestamps and payloads with signed parts.
Cryptographic protocols authenticated message exchange timestamps
Klaas Ole Kürtz Henning Schnoor Thomas Wilke
Christian-Albrechts-Universit(a)t zu Kiel Christian-Albrechts-Platz 4, 24118 Kiel, Germany
国际会议
北京
英文
214-225
2010-04-13（万方平台首次上网日期，不代表论文的发表时间）