GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Association for Computing Machinery (ACM)  (4)
Material
Publisher
  • Association for Computing Machinery (ACM)  (4)
Person/Organisation
Language
Years
  • 1
    Online Resource
    Online Resource
    Parallizable simple authenticated key agreement protocol
    Association for Computing Machinery (ACM) ; 2003
    In:  ACM SIGOPS Operating Systems Review Vol. 37, No. 3 ( 2003-07), p. 17-22
    Details
    In: ACM SIGOPS Operating Systems Review, Association for Computing Machinery (ACM), Vol. 37, No. 3 ( 2003-07), p. 17-22
    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
    URL: Article
    DOI: 10.1145/881783.881786
    RVK:
    S418
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2003
    detail.hit.zdb_id: 2082220-0
    detail.hit.zdb_id: 243805-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Parallizable simple authenticated key agreement protocol
    Association for Computing Machinery (ACM) ; 2003
    In:  ACM SIGOPS Operating Systems Review Vol. 37, No. 2 ( 2003-04), p. 13-18
    Details
    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
    URL: Article
    DOI: 10.1145/769782.769784
    RVK:
    S418
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2003
    detail.hit.zdb_id: 2082220-0
    detail.hit.zdb_id: 243805-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    Cryptanalysis of a user authentication scheme using hash functions
    Association for Computing Machinery (ACM) ; 2004
    In:  ACM SIGOPS Operating Systems Review Vol. 38, No. 1 ( 2004-01), p. 24-28
    Details
    In: ACM SIGOPS Operating Systems Review, Association for Computing Machinery (ACM), Vol. 38, No. 1 ( 2004-01), p. 24-28
    Abstract: Recently, Lee et al. proposed an improved scheme, called LLH scheme, to solve a security problem of guessing attack in the Peyravian-Zunic password scheme. The scheme comprises a password authentication protocol and a password change protocol. However, we discuss that the LLH scheme has several security problems: the scheme is still vulnerable to the guessing attack; the scheme cannot also prevent the stolen-verifier attack; the password change protocol in scheme is vulnerable to a denial of service attack.
    Type of Medium: Online Resource
    ISSN: 0163-5980
    URL: Article
    DOI: 10.1145/974104.974106
    RVK:
    S418
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2004
    detail.hit.zdb_id: 2082220-0
    detail.hit.zdb_id: 243805-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 4
    Online Resource
    Online Resource
    ID-based password authentication scheme using smart cards and fingerprints
    Association for Computing Machinery (ACM) ; 2003
    In:  ACM SIGOPS Operating Systems Review Vol. 37, No. 4 ( 2003-10), p. 32-41
    Details
    In: ACM SIGOPS Operating Systems Review, Association for Computing Machinery (ACM), Vol. 37, No. 4 ( 2003-10), p. 32-41
    Abstract: This paper proposes two ID-based password authentication schemes, which does not require a dictionary of passwords or verification tables, with smart card and fingerprint. In these schemes, users can change their passwords freely. For a network without synchronization clocks, the proposed nonce-based authentication scheme can withstand message replay attacks. The proposed two schemes require a system to authenticate each user by each user's knowledge, possession, and biometrics, and this feature makes our schemes more reliable.
    Type of Medium: Online Resource
    ISSN: 0163-5980
    URL: Article
    DOI: 10.1145/958965.958969
    RVK:
    S418
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2003
    detail.hit.zdb_id: 2082220-0
    detail.hit.zdb_id: 243805-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...