2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies 2013
DOI: 10.1109/eidwt.2013.49
|View full text |Cite
|
Sign up to set email alerts
|

Security Analysis and Improvement for Kerberos Based on Dynamic Password and Diffie-Hellman Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Kerberos principal obtains tickets for authentication and respective authorization. The tickets then contains the attributes of nodes, ticket lifetime, and the session key for the requestor for accessibility over network [ 10 , 11 ]. There was a lacuna during accessibility or transmission of messages over the network for interoperability.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Kerberos principal obtains tickets for authentication and respective authorization. The tickets then contains the attributes of nodes, ticket lifetime, and the session key for the requestor for accessibility over network [ 10 , 11 ]. There was a lacuna during accessibility or transmission of messages over the network for interoperability.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Instead of generating a private key from a user password, the method exploits SHA-256 hashing and 3-DES algorithm. Another method [6]used Dynamic Passwords and Diffie -Hellman Algorithm to prevent dictionary attacks and to exchange passwords. The security of Kerberos Server (KDC) and replay attack is not addressed here.…”
Section: Related Workmentioning
confidence: 99%