In:
ACM SIGOPS Operating Systems Review, Association for Computing Machinery (ACM), Vol. 37, No. 2 ( 2003-04), p. 13-18
Abstract:
Recently, Yeh and Sun proposed a simple authenticated key agreement protocol resistant to password guessing attacks called SAKA that is simple and cost-effective. And they provided a formal proof of security to show its strength against both passive and active adversaries. Compared with the previous well-known protocols, SAKA has less number of steps and less computation cost. However, considering the total execution time, SAKA is not the most efficient method, since it does not provide parties with parallel computation. In this paper, we present parallelizable simple authenticated key agreement protocol for improving the efficiency of the SAKA while maintaining provable security.
Type of Medium:
Online Resource
ISSN:
0163-5980
DOI:
10.1145/769782.769784
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2003
detail.hit.zdb_id:
2082220-0
detail.hit.zdb_id:
243805-7
Permalink
