Design and analysis of key establishment protocols
Consider a scenario where a server S shares a symmetric key kU with each user U. Building on a 2-party solution of Bohli et al., we describe an authenticated 3-party key establishment which remains secure if a computational Bilinear Diffie Hellman problem is hard or the server is uncorrupted. If the...
| Other Authors: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Florida Atlantic University
|
| Subjects: | |
| Online Access: | http://purl.flvc.org/FAU/3342239 |