Abstract
In this paper, we rethink the security of authenticated key agreement and describe a simple protocol from the practical perspective. Our main focus is on reconsidering the need for real-time checking of random exchange to be in a proper subgroup, and on embedding identity assurance into implicitly authenticated keys. In spite that the result of this paper is not novel at present, it might be worth discussing the implication of authenticated key agreement not requiring extra computations or message blocks in run time. Trivial range checking is to be sufficient.
| Original language | English |
|---|---|
| Pages (from-to) | 577-583 |
| Number of pages | 7 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3480 |
| Issue number | I |
| Publication status | Published - 2005 Sep 26 |
| Event | International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: 2005 May 9 → 2005 May 12 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Kwon, T. (2005). Authenticated key agreement without subgroup element verification. Lecture Notes in Computer Science, 3480(I), 577-583.