An Improved Authentication Protocol for Session Initiation Protocol Using Smart Card and Elliptic Curve Cryptography
|
|
- Christian Rodgers
- 2 years ago
- Views:
Transcription
1 ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 16, Number 4, 2013, An Improved Authentication Protocol for Session Initiation Protocol Using Smart Card and Elliptic Curve Cryptography Kan WU, Peng GONG, Jiantao WANG, Xiaopeng YAN, Ping LI National Key Laboratory of Mechatronic Engineering and Control, School of Mechatronical Engineering, Beijing Institute of Technology, Beijing, China wangjiantao Abstract. The authenticated key agreement protocol is an important security protocol for the session initiation protocol, which allows the and the server to authenticate each other and generate a shared session key for privacy, integrity, and non-repudiation in their communications. Recently, Zhang et al. proposed a new authenticated key agreement protocol for the session initiation protocol using smart card and claimed their protocol was secure against various attacks. However, we found that Zhang et al. s protocol cannot withstand the user impersonation attack, i. e., a malicious user could impersonate any other user to the server. We also propose a new authenticated key agreement protocol using smart card for SIP which is immune to the presented attack. Besides, the proposed protocol also has better performance than Zhang et al. s protocol. Key-words: elliptic curve; authenticated key agreement; session initiation protocol. 1. Introduction With the quick momentum of multimedia services using the voice over internet protocol, internet telephony over traditional circuit-switched based telephony gain more and more growth. In multimedia services using the voice over internet protocol, the session initiation protocol (SIP) is used to manage sessions between the user and the server. The SIP is a text based protocol, which was introduced by the Internet Engineering Task Force Network Working Group[1].
2 An Improved Authentication Protocol for Session Initiation Protocol 325 The original authentication protocol for SIP is not secure for applications since it was based on hyper text transport protocol digest authentication [2]. Yang et al. [3] found that the original SIP authentication protocol was vulnerable to the off-line password guessing attack and the server spoofing attack. Then they proposed an improved SIP authentication protocol based on the difficulty of discrete logarithm problem. Later, Huang et al. [4] found that Yang et al. s protocol was vulnerable to the off-line password guessing attack and was not suitable for devices with a low computational power. They also proposed an efficient authentication protocol for the SIP. Jo et al. [5] found that Huang et al. s protocol was still vulnerable to the off-line password guessing attack. In order to get better efficiency, Durlanik et al. [6] presented an an efficient authentication protocol using the elliptic curve cryptography (ECC) for the SIP. The ECC was first proposed by Koblitz [7] and Miller [8] separately. Compared with the traditional public key cryptography, the ECC is more suitable for devices with a low computational power since it could provide the same security level with much smaller key length. Later, Wu et al. [9] also proposed an efficient authentication protocol using the ECC for the SIP. Wu et al. also demonstrated that their protocol was provably secure in the Canetti- Krawczyk security model [10]. Unfortunately, Yoon et al. [11] found that both of Durlanik et al. s protocol and Wu et al. s protocol were vulnerable to the off-line password guessing attack, the Denning-Sacco attack and stolen-verifier attack. In order to enhance security, Yoon et al. also presented an improved authentication protocol using the ECC for the SIP. Later, Pu [12] and Gokhroo et al. [13] found that Yoon et al. protocol was vulnerable to the off-line password guessing attack and the replay attack. In order to improve performance, Tsai et al. [14] also proposed an authentication protocol just using the hash function and the exclusive-or operation for the SIP. However, Yoon et al. [15] found that Tsai et al. s protocol was vulnerable to the off-line password guessing attack, the Denning-Sacco attack and the stolenverifier attack. Arshad et al. [16] also found that Tsai et al. s protocol was vulnerable to the the off-line password-guessing attack. Yoon et al. [15] and Arshad et al. [16] also presented two two improved authentication protocols using the ECC for the SIP respectively. Unfortunately, Xie [17] and He et al. [18] found that Yoon et al. protocol [15] and Arshad et al. s protocol [16] were vulnerable to the off-line password guessing attack respectively. In the above authentication protocols for the SIP, a verification table related all users passwords is maintained by the SIP server. Thus, those protocols were vulnerable to the stolen-verifier attack. Besides, those protocols were vulnerable to the password management problem since the verification table is usually very large. In order to solve those problems, Zhang et al. [19] proposed the first authentication protocol using smart card and ECC for SIP. However, we find that Zhang et al. s protocol is vulnerable to the user impersonation attack, i. e., a malicious user could impersonate any other user to the server. In order to enhance security, we also propose an improved authentication protocol using smart card and ECC for SIP. The remainder of this paper is organized as follows: Section 2 briefly reviews Zhang et al. s authentication protocol using smart card and ECC for SIP. The user impersonation attack on Zhang et al. s protocol is proposed in Section 3. Our proposed
3 326 K. Wu et al. protocol is presented in Section 4, while Sections 5 and 6 discuss the security and efficiency of the proposed protocol. Our conclusions are presented in Section Review of Zhang et al. s authentication protocol In this section, we review Zhang et al. s authentication protocol for the SIP. Zhang et al. s protocol consists of four phases: the system setup phase, the registration phase, the authentication phase, and the password changing phase System setup phase In this phase, the SIP server generates the system parameters, that are available for public uses. The below steps will be undertaken by the SIP server. Step 1. The server chooses an elliptic curve equation E p (a, b) with the order n and a base point P on the elliptic curve E p (a, b). Step 2. The server chooses a random number s Zn and computes the public key P pub = sp. Step 3. The server chooses three secure hash functions h( ) : {0, 1} {0, 1} k, h 1 : G {0, 1} {0, 1} {0, 1} k and h 2 : G G {0, 1} {0, 1} {0, 1} k, where G denote the addition group generated by P. Step 4. The server keeps s secretly and publishes the system parameters {E p (a, b), P, P pub, h( ), h 1 ( ), h 2 ( )} Registration phase In this phase, the user registers on the SIP server through a secure channel. The below steps will be undertaken by the SIP server and the user. Step 1. The user chooses his password P W and a random number a Z n. Then, the user sends {h(p W a), username} to the server through a secure channel. Step 2. After that, the server computes R = h(h(p W a) username)s 1 P. Then, the server stores R into the memory of the smart card and delivers it to the user through a secure channel. Step 3. After receiving the smart card, the user stores a into the memory of the smart card Authentication phase Whenever the user wants to log into the server, he inserts his smart card into a smart card reader. He also inputs his username and password P W. As shown in Fig. 1, the below steps will be undertaken by the SIP server and the user. Step 1. The user generates a random number b Z n and calculates V = br + h(username)p and W = bh(h(p W a username))p pub. Then, the users sends the request message REQUEST (username, V, W ) to the server. Step 2. The server, after receiving the request message, calculates X = h(username)p and W = s 2 (V X).
4 An Improved Authentication Protocol for Session Initiation Protocol 327 Then, the server verifies whether W and W are equal. If they are equal, the server generates two random numbers c, r Zn, calculates S = cp, K = cs(v X), SK = h 1 (K r username) and Auth s = h 2 (K W r SK). Then, the server sends the challenge message CHALLENGE(realm, Auth s, S, r) to the users. Step 3. The user, after receiving the challenge message, calculates K = bh(h(p W a) username)s and SK = h 1 (K r username). Then, the users verifies whether Auth s and h 2 (K W r SK) are equal. If they are equal, the users calculates Auth u = h 2 (K W r + 1 SK) and sends the response message RESP ONSE(realm, Auth u ) to the server. Step 4. The server, after receiving the response message, verifies whether Auth u and h 2 (K W r + 1 SK) are equal. If they are equal, the server sets SK as the shared session key. Fig. 1. Authentication phase of the proposed protocol.
5 328 K. Wu et al Password changing phase After the user and the server authenticate each other, the user can change his password using the current session key SK. The below steps will be undertaken by the SIP server and the user. Step 1. The user chooses a new password P W new, a random number a Z n and a nonce N. Then, the server sends the request message E SK (username N h(p W a ) h(username N h(p W a )) and N to the server. Step 2. The server, after receiving the request message, decrypts the message and verifies whether the authentication tag h(username N h(p W a )) is valid. If it is valid, the server computes R = h(h(p W a ) username)s 1 P and sends the response message E SK (R h(username N + 1 R )) to the user. Step 3. The user, after receiving the response message, decrypts the message and verifies whether the authentication tag h(username N + 1 R ) is valid. If it is valid, the user stores R ast, a into his smart card. 3. Attack on Zhang et al. s authentication protocol Suppose that U A is malicious user. Through the registration phase, U A could get his smart card from the SIP server, where the smart card contains R A = h(h(p W a) username)s 1 P and the random number a. Then U A could impersonate another user U i through the following steps. 1) U A computes s 1 P = h(h(p W a) username) 1 R A. 2) U A generates two random numbers P W i, a i and computes R i = h(h(p W i a i ) username i)s 1 P, where username i is the name of U i. 3) U A generates a random number b Z n and calculates V i = br i +h(username)p and W i = bh(h(p W a username))p pub. Then, the users sends the request message REQUEST (username i, V i, W i ) to the server. 4) The server, after receiving the request message, calculates X = h(username i )P and W = s 2 (V i X). Then, the server verifies whether W i and W are equal. It is easy to say that W and W are equal. Then, the server generates two random numbers c, r Z n, calculates S = cp, K = cs(v i X), SK = h 1 (K r username) and Auth s = h 2 (K W r SK). Then, the server sends the challenge message CHALLENGE(realm, Auth s, S, r) to the users. 5) U A calculates K = bh(h(p W i a i ) username i)s and SK = h 1 (K r username). Then, the users verifies whether Auth s and h 2 (K W i r SK) are equal. If they are equal, U A calculates Auth u = h 2 (K W i r + 1 SK) and sends the response message RESP ONSE(realm, Auth u ) to the server. Step 4. The server, after receiving the response message, verifies whether Auth u and h 2 (K W r + 1 SK) are equal. It is easy to say that Auth u and h 2 (K W r + 1 SK) are equal. Then, the server sets SK as the shared session key. Thus, the malicious user U A can impersonate U i to the server easily. Therefore, Zhang et al. s protocol cannot withstand the user impersonation attack.
6 An Improved Authentication Protocol for Session Initiation Protocol Proposed authentication protocol Based on He et al. s work [20], we present an improved authentication protocol for the SIP to overcome weakness in Zhang et al. s protocol. The proposed protocol consists of four phases: the system setup phase, the registration phase, the authentication phase, and the password changing phase System setup phase In this phase, the SIP server generates the system parameters, that are available for public uses. The below steps will be undertaken by the SIP server. Step 1. The server chooses an elliptic curve equation E p (a, b) with the order n and a base point P on the elliptic curve E p (a, b). Step 2. The server chooses a random number s Zn and computes the public key P pub = sp. Step 3. The server chooses three secure hash functions h( ) : {0, 1} {0, 1} k, h 1 : G {0, 1} {0, 1} {0, 1} k and h 2 : G G {0, 1} {0, 1} {0, 1} k, where G denote the addition group generated by P. Step 4. The server keeps s secretly and publishes the system parameters {E p (a, b), P, P pub, h( ), h 1 ( ), h 2 ( )} Registration phase In this phase, the user registers on the SIP server through a secure channel. The below steps will be undertaken by the SIP server and the user. Step 1. The user chooses his password P W and a random number a Z n. Then, the user sends {h(p W a), username} to the server through a secure channel. Step 2. After that, the server computes R = ((s+h(username)) 1 +h(p W a))p. Then, the server stores R into the memory of the smart card and delivers it to the user through a secure channel. Step 3. After receiving the smart card, the user stores a into the memory of the smart card Authentication phase Whenever the user wants to log into the server, he inserts his smart card into a smart card reader. He also inputs his username and password P W. As shown in Fig. 2, the below steps will be undertaken by the SIP server and the user. Step 1. The user generates a random number b Z n and calculates V = b(r h(p W a)p ) = b(s + h(username) 1 P ) and W = h 1 (username V bp ). Then, the users sends the request message REQUEST (username, V, W ) to the server. Step 2. The server, after receiving the request message, calculates T = (s + h(username))v = bp and W = h 1 (username V T ). Then, the server verifies whether W and W are equal. If they are equal, the server generates two random numbers c Z n, calculates S = cp, K = ct, SK = h 1 (K username)
7 330 K. Wu et al. and Auth s = h 2 ( 1 K W SK). Then, the server sends the challenge message CHALLENGE(realm, Auth s, S, r) to the users. Step 3. The user, after receiving the challenge message, calculates K = bh(h(p W a) username)s and SK = h 1 (K r username). Then, the users verifies whether Auth s and h 2 ( 1 K W SK) are equal. If they are equal, the users calculates Auth u = h 2 ( 2 K W SK) and sends the response message RESP ONSE(realm, Auth u ) to the server. Step 4. The server, after receiving the response message, verifies whether Auth u and h 2 ( 2 K W SK) are equal. If they are equal, the server sets SK as the shared session key. Fig. 2. Authentication phase of the proposed protocol Password changing phase After the user and the server authenticate each other, the user can change his password using the current session key SK. The below steps will be undertaken by the SIP server and the user.
8 An Improved Authentication Protocol for Session Initiation Protocol 331 Step 1. The user chooses a new password P W new, a random number a Z n and a nonce N. Then, the server sends the request message E SK (username N h(p W a ) h(username N h(p W a )) and N to the server. Step 2. The server, after receiving the request message, decrypts the message and verifies whether the authentication tag h(username N h(p W a )) is valid. If it is valid, the server computes R = h(h(p W a ) username)s 1 P and sends the response message E SK (R h(username N + 1 R )) to the user. Step 3. The user, after receiving the response message, decrypts the message and verifies whether the authentication tag h(username N + 1 R ) is valid. If it is valid, the user stores R ast, a into his smart card. 5. Security analysis In this section, we demonstrate that the proposed protocol could withstand the user impersonation attack, the server spoofing attack, the privileged insider attack, the stolen-verifier attack, the replay attack, the modification attack, and the man-inthe- middle attack [19 21]. Beside, we demonstrate that the proposed protocol could provide the mutual authentication and the perfect forward secrecy [19 21] User impersonation attack Suppose there is an adversary A wants to impersonate a valid user U i to the server. A should generate a request message REQUEST (username, V, W ) to pass the server s verification, where V = b(r h(p W a)p ) = b(s + h(username) 1 P ) and W = h 1 (username V bp ). However, he cannot generate V and W since he does know the secret information R and the password P W. As a result, the proposed protocol could resist the user impersonation attack Server spoofing attack Suppose there is an adversary A wants to impersonate the server to a valid user U i. A should generate a challenge message CHALLENGE(realm, Auth s, S, r) when he receives a request message REQUEST (username, V, W ), where V = b(r h(p W a)p ) = b(s + h(username) 1 P ), W = h 1 (username V bp ), S = cp, K = ct, SK = h 1 (K username) and Auth s = h 2 ( 1 K W SK). However, he cannot generate Auth s since he does not know the secret key s. As a result the proposed protocol could resist the spoofing attack Privileged insider attack Suppose there is a privileged insider A wants to get the user U i s password P W in the registration phase. However, he cannot get U i s password P W from the registration request message {h(p W a), username} since it is protected by the hash function h( ) and the random number a. As a result, the proposed protocol could resist the privileged insider attack.
9 332 K. Wu et al Stolen-verifier attack In the proposed protocol, the server just needs to maintain his secret key s and maintain no verifier table at all. Then, there is no information about user s passwords stored in the server s database. As a result, the proposed protocol could resist the stolen-verifier attack Replay attack Suppose there is an adversary A eavesdrops a request message REQU EST (username, V, W ) and replays it to the server, where V = b(r h(p W a)p ) = b(s + h(username) 1 P ) and W = h 1 (username V bp ). However, he cannot generate the response message RESP ONSE(realm, Auth u ) when he receives the server s challenge message CHALLENGE(realm, Auth s, S, r) since he does not know the random number b. Suppose there is an adversary A eavesdrops the server s challenge message CHALLENGE(realm, Auth s, S, r) and replays it to the user U i. However, U i could find the attack by verifying if Auth s and h 2 ( 1 K W SK) are equal since U i generates a new random number b in each session. As a result, the proposed protocol could resist the replay attack Modification attack Suppose there is an adversary A eavesdrops a request message REQU EST (username, V, W ), modifies it and replays it to the server, where V = b(r h(p W a) P ) = b(s+h(username) 1 P ) and W = h 1 (username V bp ). However, the message is protected by the hash value W. Any modification of the message could by find by the server in the Step 2) of the authentication phase. We also could show that any modification on the challenge message CHALLENGE(realm, Auth s, S, r) and the response message RESP ONSE(realm, Auth u ) could be found. As a result, the proposed protocol could resist the modification attack Man-in-the- middle attack Suppose there is an adversary s could intercept the messages transmitted between the user and server and replace them with his own messages. We have demonstrated that there is no adversary could generate a request message REQU EST (username, V, W ), a challenge message CHALLENGE(realm, Auth s, S, r) or a response message RESP ONSE(realm, Auth u ). Then, the user or the sever could find the attack by checking the validity of the received message. As a result, the proposed protocol could resist the man-in-the- middle attack Mutual authentication Mutual authentication means that the server and user could verify the legality of each other. According to Section 5.1 and Section 5.2, we could conclude that no adversary could generate valid message to impersonate the user or the server. Then,
10 An Improved Authentication Protocol for Session Initiation Protocol 333 the user and the server could authenticate each other by verifying the validity of received message. As a result, the proposed scheme could provide mutual authentication between the user and the server Perfect forward secrecy Perfect forward secrecy means the adversary cannot get the previous session key even he gets the the long-term keys of the server and the user. Suppose there is an adversary gets the server s key s and the user s key (s + h(username) 1 P. We also assume the adversary gets the request message REQUEST (username, V, W ), the challenge message CHALLENGE(realm, Auth s, S, r), and the response message RESP ONSE(realm, Auth u ), where V = b(r h(p W a)p ), W = h 1 (username V bp ), S = cp, K = ct, SK = h 1 (K username), Auth s = h 2 ( 1 K W SK), and Auth u = h 2 ( 2 K W SK). The adversary could computes T = (s+h(username)) V = bp. In order to get the session key SK = h 1 (K username), he has to compute K = ct = bcp from bp and cp. Then, the adversary has to solve the computational Diffie-Hellman problem. As a result, the proposed scheme could provide the perfect forward secrecy. 6. Comparison and cost analysis In this section, we compare the efficiency of the scheme with that of Zhang et al. s scheme. For convenience, we let M ec and H denote the elliptic curve scale multiplication operation and the hash function operation respectively. The comparisons are listed in Table 1. Table 1. Comparison of computation cost Zhang et al. s scheme The proposed scheme User side 4M ec + 5H 3M ec + 5H Server side 4M ec + 4H 3M ec + 4H Total 8M ec + 9H 6M ec + 9H According to Table 1, we can see that the computation cost of the proposed scheme is lower than that of Zhang et al. s scheme in the user side and the server side. Furthermore, Zhang et al. s scheme is vulnerable to the user impersonation attack and the proposed scheme could overcome such security vulnerability. As a result, the proposed scheme is superior to Zhang et al. s scheme in terms of both of security and efficiency. 7. Conclusions In this paper we presented a cryptanalysis of Zhang et al. s authenticated key agreement for session initiation protocol and demonstrate that their scheme is vulnerable to the user impersonation attack. To address the problem, we proposed an improved authenticated key agreement for session initiation protocol using smart
11 334 K. Wu et al. card. The proposed scheme not only resists the proposed attack, but also has better performance. As a result, the proposed scheme is more Acknowledgments. This research was supported in part by the National Science foundation of China (No ), the Beijing Natural Science Foundation (No ), and the Excellent Young Scholars Research Fund of Beijing Institute of Technology. References [1] Rosenberg J., Schulzrinne H., Camarillo G., Johnston A., Peterson J., Sparks R., Handley M., Schooler E., SIP: session initiation protocol, RFC 3261, [2] Franks J., Hallam-Baker P., Hostetler J., Lawrence S., Leach P., Luotonen A., Stewart L., HTTP authentication: basic and digest access authentication, Internet RFC2617, [3] Yang C., Wang R., Liu W., Secure authentication scheme for session initiation protocol, Computers and security, 2005, Vol. 24, pp [4] Huang H., Wei W., Brown G., A new efficient authentication scheme for session initiation protocol, Proceedings of JCIS 06, 2006, pp [5] Jo H., Lee Y., Kim M., Kim S., Won D., Off-line password-guessing attack to Yang s and Huang s authentication schemes for session initiation protocol, Proceedings of INC 09, 2009, pp [6] Durlanik A., Sogukpinar I., SIP authentication scheme using ECDH, World Enformatika Society Transaction on Engineering Computing and Technology, 2005, Vol. 8, pp [7] Koblitz N., Elliptic curve cryptosystems, Mathematics of Computation, 1987, Vol. 48, pp [8] Miller V., Uses of elliptic curves in cryptography, Advances in Cryptology CRYPTO 85, 1985, pp [9] Wu L., Zhang Y., Wang F., A new provably secure authentication and key agreement protocol for SIP using ECC, Computer Standards and Interfaces, 2009, Vol. 31, pp [10] Canetti R., Krawczyk H., Analysis of key-exchange protocols and their use for building secure channels, Proceedings of EUROCRYPT 2001, 2001, pp [11] Yoon E., Yoo K., A secure and efficient SIP authentication scheme for converged VoIP networks, Computer Communications, 2010, Vol. 33, pp [12] Pu Q., Weaknesses of SIP authentication scheme for converged VoIP networks, IACR Cryptology eprint Archive, 2010, 464. [13] Gokhroo M., Jaidhar C., Tomar A., Cryptanalysis of SIP secure and efficient authentication scheme, Proceedings of ICCSN 2011, 2011, pp [14] Tsai J., Efficient nonce-based authentication scheme for session initiation protocol, International Journal of Network Security, 2009, Vol. 9, pp
12 An Improved Authentication Protocol for Session Initiation Protocol 335 [15] Yoon E., Shin Y., Jeon I., Yoo K., Robust mutual authentication with a key agreement scheme for the session initiation protocol, IETE Technical Review, 2010, Vol. 27, pp [16] Arshad R., Ikram N., Elliptic curve cryptography based mutual authentication scheme for session initation protocol, Multimedia Tools and Applications, 2013, Vol. 66(2), pp [17] Xie Q., A new authenticated key agreement for session initiation protocol, International Journal of Communication Systems, 2012, Vol. 25, pp [18] He D., Chen J., Chen Y., A secure mutual authentication scheme for session initiation protocol using elliptic curve cryptography, Security and Communication Networks, 2012, Vol. 5(12), pp [19] Zhang L., Tang S., Cai Z., Efficient and flexible password authenticated key agreement for voice over internet protocol session initiation protocol using smart card, Internal Journal of Communication Systems, 2013, DOI: /dac.2499 [20] He D., Chen J., Hu J., An ID-based client authentication with key agreement protocol for mobile client-server environment on ECC with provable security, Information Fusion, 2012 Vol. 13(3), pp [21] Shi W., Chen Y., An efficient RSA-based remote user authentication scheme, Romanian Journal of Information Science and Technology, Vol. 15(3), pp
Cryptography. Debiao He. School of Mathematics and Statistics, Wuhan University, Wuhan, People s Republic of China. hedebiao@163.
Weakness in a Mutual Authentication cheme for ession Initiation Protocol using Elliptic Curve Cryptography Debiao He chool of Mathematics and tatistics, Wuhan University, Wuhan, People s Republic of China
Efficient Nonce-based Authentication Scheme for. session initiation protocol
International Journal of Network Security, Vol.9, No.1, PP.12 16, July 2009 12 Efficient Nonce-based Authentication for Session Initiation Protocol Jia Lun Tsai Degree Program for E-learning, Department
Session Initiation Protocol Attacks and Challenges
2012 IACSIT Hong Kong Conferences IPCSIT vol. 29 (2012) (2012) IACSIT Press, Singapore Session Initiation Protocol Attacks and Challenges Hassan Keshavarz +, Mohammad Reza Jabbarpour Sattari and Rafidah
Efficient nonce-based authentication scheme for Session Initiation Protocol
Efficient nonce-based authentication scheme for Session Initiation Protocol Jia Lun Tsai National Chiao Tung University, Taiwan, R.O.C. crousekimo@yahoo.com.tw Abstract: In recent years, Session Initiation
A Multifactor Hash Digest Challenge-Response
A Multifactor Hash Digest Challenge-Response Authentication for Session Initiation Protocol S. Santhosh Baboo Reader in Computer Science, D.G. Vaishnav College Arumbakkam, Chennai-600 106, Tamilnadu. India.
Detection and Prevention Mechanism on Call Hijacking in VoIP System
Detection and Prevention Mechanism on Call Hijacking in VoIP System Amruta Ambre Department of Computer Engineering D.J.Sanghavi College of engineering Mumbai, India Narendra Shekokar, Ph.D Department
Security Enhanced Anonymous Multi-Server Authenticated Key Agreement Scheme using Smart Card and Biometrics
Security Enhanced Anonymous Multi-Server Authenticated Key Agreement Scheme using Smart Card and Biometrics Younsung Choi College of Information and Communication Engineering, Sungkyunkwan University,
A More Robust Authentication Scheme for Roaming Service in Global Mobility Networks Using ECC
International Journal of Network Security, Vol.18, No.2, PP.217-223, Mar. 2016 217 A More Robust Authentication Scheme for Roaming Service in Global Mobility Networks Using ECC Dianli Guo and Fengtong
Proposed SecureSIP Authentication Scheme based on Elliptic Curve Cryptography
Proposed SecureSIP Authentication Scheme based on Elliptic Curve Cryptography Samaneh Sadat Mousavi-Nik MSc. of IT Information Security Tehran University Tehran, Iran M.H. Yaghmaee- Moghaddam School of
A SMART CARD-BASED MOBILE SECURE TRANSACTION SYSTEM FOR MEDICAL TREATMENT EXAMINATION REPORTS. Received January 2010; revised May 2010
International Journal of Innovative Computing, Information and Control ICIC International c 2011 ISSN 1349-4198 Volume 7, Number 5(A), May 2011 pp. 2257 2267 A SMART CARD-BASED MOBILE SECURE TRANSACTION
MANAGING OF AUTHENTICATING PASSWORD BY MEANS OF NUMEROUS SERVERS
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE MANAGING OF AUTHENTICATING PASSWORD BY MEANS OF NUMEROUS SERVERS Kanchupati Kondaiah 1, B.Sudhakar 2 1 M.Tech Student, Dept of CSE,
A Stubborn Security Model Based on Three-factor Authentication and Modified Public Key
International Journal of Network Security, Vol.18, No.6, PP.1060-1070, Nov. 2016 1060 A Stubborn Security Model Based on Three-factor Authentication and Modified Public Key Trung Thanh Ngo and Tae-Young
Single Sign-On Secure Authentication Password Mechanism
Single Sign-On Secure Authentication Password Mechanism Deepali M. Devkate, N.D.Kale ME Student, Department of CE, PVPIT, Bavdhan, SavitribaiPhule University Pune, Maharashtra,India. Assistant Professor,
On the Security Vulnerabilities of a Hash Based Strong Password Authentication Scheme
On the Security Vulnerabilities of a Hash Based Strong Password Authentication Scheme Manoj Kumar Department of Mathematics R. K. College Shamli-Muzaffarnagar,.P.-India - 247776 E-mail: yamu balyan@yahoo.co.in
User authentication in SIP
User authentication in SIP Pauli Vesterinen Helsinki University of Technology pjvester@cc.hut.fi Abstract Today Voice over Internet Protocol (VoIP) is used in large scale to deliver voice and multimedia
CRYPTANALYSIS OF A MORE EFFICIENT AND SECURE DYNAMIC ID-BASED REMOTE USER AUTHENTICATION SCHEME
CRYPTANALYSIS OF A MORE EFFICIENT AND SECURE DYNAMIC ID-BASED REMOTE USER AUTHENTICATION SCHEME Mohammed Aijaz Ahmed 1, D. Rajya Lakshmi 2 and Sayed Abdul Sattar 3 1 Department of Computer Science and
Authentication Protocols Using Hoover-Kausik s Software Token *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 22, 691-699 (2006) Short Paper Authentication Protocols Using Hoover-Kausik s Software Token * WEI-CHI KU AND HUI-LUNG LEE + Department of Computer Science
DATA SECURITY IN CLOUD USING ADVANCED SECURE DE-DUPLICATION
DATA SECURITY IN CLOUD USING ADVANCED SECURE DE-DUPLICATION Hasna.R 1, S.Sangeetha 2 1 PG Scholar, Dhanalakshmi Srinivasan College of Engineering, Coimbatore. 2 Assistant Professor, Dhanalakshmi Srinivasan
SECURITY ANALYSIS OF PASSWORD BASED MUTUAL AUTHENTICATION METHOD FOR REMOTE USER
SECURITY ANALYSIS OF PASSWORD BASED MUTUAL AUTHENTICATION METHOD FOR REMOTE USER Mrs. P.Venkateswari Assistant Professor / CSE Erode Sengunthar Engineering College, Thudupathi ABSTRACT Nowadays Communication
Authentication and Authorization Applications in 4G Networks
Authentication and Authorization Applications in 4G Networks Abstract Libor Dostálek dostalek@prf.jcu.cz Faculty of Science University of South Bohemia Ceske Budejovice, Czech Republic The principle of
ROBUST AND PRIVACY PROTECTION AUTHENTICATION IN CLOUD COMPUTING
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 11, November 2013 pp. 4247 4261 ROBUST AND PRIVACY PROTECTION AUTHENTICATION
A Federated Model for Secure Web-Based Videoconferencing
A Federated Model for Secure Web-Based Videoconferencing Douglas C. Sicker, Ameet Kulkarni, Anand Chavali, and Mudassir Fajandar Interdisciplinary Telecommunications Dept. and Dept. of Computer Science
Securing Session Initiation Protocol for VOIP Services
Securing Session Initiation Protocol for VOIP Services Amina.M.Elmahalwy Information Technology Dept. Faculty of Computers and Information, Menoufia University, Egypt Wail.S.Elkilani Computer Systems Dept.
Client Server Registration Protocol
Client Server Registration Protocol The Client-Server protocol involves these following steps: 1. Login 2. Discovery phase User (Alice or Bob) has K s Server (S) has hash[pw A ].The passwords hashes are
SINGLE SIGN-ON MECHANISM FOR DISTRIBUTED COMPUTING SECURITY ENVIRONMENT
SINGLE SIGN-ON MECHANISM FOR DISTRIBUTED COMPUTING SECURITY ENVIRONMENT K.karthika 1, M. Daya kanimozhi Rani 2 1 K.karthika, Assistant professor, Department of IT, Adhiyamaan College of Engineering, Hosur
Capture Resilient ElGamal Signature Protocols
Capture Resilient ElGamal Signature Protocols Hüseyin Acan 1, Kamer Kaya 2,, and Ali Aydın Selçuk 2 1 Bilkent University, Department of Mathematics acan@fen.bilkent.edu.tr 2 Bilkent University, Department
Anonymous ID-based Group Key Agreement for Wireless Networks
Anonymous ID-based Group Key Agreement for Wireless Networks Zhiguo Wan,KuiRen, Wenjing Lou and Bart Preneel K.U.Leuven, ESAT/SCD, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium Email: {zhiguo.wan,bart.preneel}@esat.kuleuven.be
Security and Privacy Flaws in a Recent Authentication Protocol for EPC C1 G2 RFID Tags
Security and Privacy Flaws in a Recent Authentication Protocol for EPC C1 G2 RFID Tags Seyed Mohammad Alavi 1, Karim Baghery 2 and Behzad Abdolmaleki 3 1 Imam Hossein Comprehensive University Tehran, Iran
On the Security Enhancement of Integrated Electronic Patient Records Information Systems
Computer Science and Information Systems 12(2):857 872 DOI: 10.2298/CSIS141029030K On the Security Enhancement of Integrated Electronic Patient Records Information Systems Muhammad Khurram Khan 1, Ankita
Efficient Unlinkable Secret Handshakes for Anonymous Communications
보안공학연구논문지 (Journal of Security Engineering), 제 7권 제 6호 2010년 12월 Efficient Unlinkable Secret Handshakes for Anonymous Communications Eun-Kyung Ryu 1), Kee-Young Yoo 2), Keum-Sook Ha 3) Abstract The technique
A New Credit Card Payment Scheme Using Mobile Phones Based on Visual Cryptography
A New Credit Card Payment Scheme Using Mobile Phones Based on Visual Cryptography Chao-Wen Chan and Chih-Hao Lin Graduate School of Computer Science and Information Technology, National Taichung Institute
SECURITY IMPROVMENTS TO THE DIFFIE-HELLMAN SCHEMES
www.arpapress.com/volumes/vol8issue1/ijrras_8_1_10.pdf SECURITY IMPROVMENTS TO THE DIFFIE-HELLMAN SCHEMES Malek Jakob Kakish Amman Arab University, Department of Computer Information Systems, P.O.Box 2234,
Authentication protocol for fingerprint feature extraction and IBC in monitoring systems
Authentication protocol for fingerprint feature extraction and IBC in monitoring systems Changgeng Yu; Liping Lai School of Mechanical and Electronic Engineering, Hezhou University, No.8, xihuan Road,
Application of Automatic Variable Password Technique in Das s Remote System Authentication Scheme Using Smart Card
Application of Automatic Variable Password Technique in Das s Remote System Authentication Scheme Using Smart Card C. Koner, Member, IACSIT, C. T. Bhunia, Sr. Member, IEEE and U. Maulik, Sr. Member, IEEE
An Efficient Authenticated Key Agreement Protocol Based on Chaotic Maps with Privacy Protection using Smart Card
Journal of Information Hiding and Multimedia Signal Processing c 2015 ISSN 2073-4212 Ubiquitous International Volume 6, Number 3, May 2015 An Efficient Authenticated Key Agreement Protocol Based on Chaotic
CUNSHENG DING HKUST, Hong Kong. Computer Security. Computer Security. Cunsheng DING, HKUST COMP4631
Cunsheng DING, HKUST Lecture 08: Key Management for One-key Ciphers Topics of this Lecture 1. The generation and distribution of secret keys. 2. A key distribution protocol with a key distribution center.
Single Password, Multiple Accounts
Single Password, Multiple Accounts Mohamed G. Gouda Alex X. Liu 1 Lok M. Leung 2 Mohamed A. Alam 2 Department of Computer Sciences, The University of Texas at Austin, Austin, Texas 78712-0233, U.S.A. {gouda,
Chapter 16: Authentication in Distributed System
Chapter 16: Authentication in Distributed System Ajay Kshemkalyani and Mukesh Singhal Distributed Computing: Principles, Algorithms, and Systems Cambridge University Press A. Kshemkalyani and M. Singhal
A Distributed Session Initiation Protocol Solution for Mobile Ad Hoc Networks Using Elliptic Curve Cryptography
21st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 2015 www.mssanz.org.au/modsim2015 A Distributed Session Initiation Protocol Solution for Mobile Ad Hoc Networks
Authenticated Key Agreement Based on NFC for Mobile Payment
Authenticated Key Agreement Based on NFC for Mobile Payment Bomi Seo 1, Sung Woon Lee 2 *, Hyunsung Kim 1 1 The Department of Cyber Security, Kyungil University, Korea. 2 The Department of Information
Secure File Transfer Using USB
International Journal of Scientific and Research Publications, Volume 2, Issue 4, April 2012 1 Secure File Transfer Using USB Prof. R. M. Goudar, Tushar Jagdale, Ketan Kakade, Amol Kargal, Darshan Marode
Chapter 3. Network Domain Security
Communication System Security, Chapter 3, Draft, L.D. Chen and G. Gong, 2008 1 Chapter 3. Network Domain Security A network can be considered as the physical resource for a communication system. This chapter
An anonymous and untraceable password-based authentication scheme for session initiation protocol using smart cards
INTERNATIONAL JORNAL OF COMMNICATION SYSTEMS Int. J. Commun. Syst. (2014) Published online in Wiley Online Library (wileyonlinelibrary.com)..2848 An anonymous and untraceable password-based authentication
2. SIP Authentication Mechanisms. 2.1 SIP Digest Authentication
ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 10 Towards Public Key Infrastructure less authentication in Session Initiation Protocol Abdullah Al Hasib 1, Abdullah Azfar 2 and Md. Sarwar Morshed 3 1,3
SECURITY ANALYSIS OF A SINGLE SIGN-ON MECHANISM FOR DISTRIBUTED COMPUTER NETWORKS
SECURITY ANALYSIS OF A SINGLE SIGN-ON MECHANISM FOR DISTRIBUTED COMPUTER NETWORKS Abstract: The Single sign-on (SSO) is a new authentication mechanism that enables a legal user with a single credential
A Strong RSA-based and Certificateless-based Signature Scheme
International Journal of Network Security, Vol.18, No.2, PP.201-208, Mar. 2016 201 A Strong RSA-based and Certificateless-based Signature Scheme Chin-Chen Chang 1,2, Chin-Yu Sun 3, and Shih-Chang Chang
Cryptanalysis and security enhancement on the generation of Mu-Varadharajan electronic voting protocol. Vahid Jahandideh and Amir S.
72 Int. J. Electronic Governance, Vol. 3, No. 1, 2010 Cryptanalysis and security enhancement on the generation of Mu-Varadharajan electronic voting protocol Vahid Jahandideh and Amir S. Mortazavi Department
Anonymous Network Information Acquirement Protocol for Mobile Users in Heterogeneous Wireless Networks
International Journal of Network Security, Vol.18, No.1, PP.193-200, Jan. 2016 193 Anonymous Network Information Acquirement Protocol for Mobile Users in Heterogeneous Wireless Networks Guangsong Li 1,
A Vulnerability in the Song Authentication Protocol for Low-Cost RFID Tags
A Vulnerability in the Song Authentication Protocol for Low-Cost RFID Tags Sarah Abughazalah, Konstantinos Markantonakis, and Keith Mayes Smart Card Centre-Information Security Group (SCC-ISG) Royal Holloway,
Anonymous Two-Factor Authentication: Certain Goals Are Beyond Attainment
Anonymous Two-Factor Authentication: Certain Goals Are Beyond Attainment Ding Wang 1,3, Ping Wang 1,3, and Debiao He 2 1 School of EECS, Peking University, Beijing 100871, China 2 National Engineering
Authentication Types. Password-based Authentication. Off-Line Password Guessing
Authentication Types Chapter 2: Security Techniques Background Secret Key Cryptography Public Key Cryptography Hash Functions Authentication Chapter 3: Security on Network and Transport Layer Chapter 4:
Secure Authentication of Distributed Networks by Single Sign-On Mechanism
Secure Authentication of Distributed Networks by Single Sign-On Mechanism Swati Sinha 1, Prof. Sheerin Zadoo 2 P.G.Student, Department of Computer Application, TOCE, Bangalore, Karnataka, India 1 Asst.Professor,
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction 1 Priyadharshni.A, 2 Geo Jenefer.G 1 Master of engineering in computer science, Ponjesly College of Engineering 2 Assistant Professor,
Design an efficient three-party authenticated key exchange protocol in the cloud environment
Design an efficient three-party authenticated key exchange protocol in the cloud environment Chung-Yi Lin a, *, Yuh-Min Chen a, Shu-Yi Liaw b, Chen-Hua Fu c a Institute of Manufacturing Information Systems,
Security issues in Voice over IP: A Review
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue 2 February, 2014 Page No. 3879-3883 Security issues in Voice over IP: A Review Rajni a, Preeti a, Ritu
Final Exam. IT 4823 Information Security Administration. Rescheduling Final Exams. Kerberos. Idea. Ticket
IT 4823 Information Security Administration Public Key Encryption Revisited April 5 Notice: This session is being recorded. Lecture slides prepared by Dr Lawrie Brown for Computer Security: Principles
A Call Conference Room Interception Attack and its Detection
A Call Conference Room Interception Attack and its Detection Nikos Vrakas 1, Dimitris Geneiatakis 2 and Costas Lambrinoudakis 1 1 Department of Digital Systems, University of Piraeus 150 Androutsou St,
TELE 301 Network Management. Lecture 18: Network Security
TELE 301 Network Management Lecture 18: Network Security Haibo Zhang Computer Science, University of Otago TELE301 Lecture 18: Network Security 1 Security of Networks Security is something that is not
86 Int. J. Engineering Systems Modelling and Simulation, Vol. 6, Nos. 1/2, 2014
86 Int. J. Engineering Systems Modelling and Simulation, Vol. 6, Nos. 1/2, 2014 Dual server-based secure data-storage system for cloud storage Woong Go ISAA Lab, Department of Information Security Engineering,
Some Identity Based Strong Bi-Designated Verifier Signature Schemes
Some Identity Based Strong Bi-Designated Verifier Signature Schemes Sunder Lal and Vandani Verma Department of Mathematics, Dr. B.R.A. (Agra), University, Agra-282002 (UP), India. E-mail- sunder_lal2@rediffmail.com,
2.4: Authentication Authentication types Authentication schemes: RSA, Lamport s Hash Mutual Authentication Session Keys Trusted Intermediaries
Chapter 2: Security Techniques Background Secret Key Cryptography Public Key Cryptography Hash Functions Authentication Chapter 3: Security on Network and Transport Layer Chapter 4: Security on the Application
SOMA Cryptography Whitepaper
SOMA Cryptography Whitepaper Draft date: Nov. 1st, 2015 Contents Overview 2 Secure Transport Layer Protocol 3 AES256 Key Generation 3 Login Data Verification 3 Secure Transport Layer Establishment 4 Data
A Generic Framework to Enhance Two- Factor Authentication in Cryptographic Smart-card Applications
A Generic Framework to Enhance Two- Factor Authentication in Cryptographic Smart-card Applications G.Prakash #1, M.Kannan *2 # Research Scholar, Information and Communication Engineering, Anna University
Efficient ID-based authentication and key agreement protocols for the session initiation protocol
Turkish Journal of Electrical Engineering & Computer Sciences http:// journals. tubitak. gov. tr/ elektrik/ Research Article Turk J Elec Eng & Comp Sci (2015) 23: 560 579 c TÜBİTAK doi:10.3906/elk-1207-102
Vulnerability Analysis on Mobile VoIP Supplementary Services and MITM Attack
Vulnerability Analysis on Mobile VoIP Supplementary Services and MITM Attack You Joung Ham Graduate School of Computer Engineering, Hanshin University, 411, Yangsan-dong, Osan, Gyeonggi, Rep. of Korea
Chapter 8 Security. IC322 Fall 2014. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012
Chapter 8 Security IC322 Fall 2014 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 All material copyright 1996-2012 J.F Kurose and K.W. Ross, All
Prevention of Anomalous SIP Messages
International Journal of Future Computer and Communication, Vol., No., October 03 Prevention of Anomalous SIP Messages Ming-Yang Su and Chung-Chun Chen Abstract Voice over internet protocol (VoIP) communication
A novel deniable authentication protocol using generalized ElGamal signature scheme
Information Sciences 177 (2007) 1376 1381 www.elsevier.com/locate/ins A novel deniable authentication protocol using generalized ElGamal signature scheme Wei-Bin Lee a, Chia-Chun Wu a, Woei-Jiunn Tsaur
A Service Platform for Subscription-Based Live Video Streaming
A Service Platform for Subscription-Based Live Video Streaming Kelum Vithana 1, Shantha Fernando 2, Dileeka Dias 3 1 Dialog - University of Moratuwa Mobile Communications Research Laboratory 2 Department
OPENID AUTHENTICATION SECURITY
OPENID AUTHENTICATION SECURITY Erik Lagercrantz and Patrik Sternudd Uppsala, May 17 2009 1 ABSTRACT This documents gives an introduction to OpenID, which is a system for centralised online authentication.
Overview of Cryptographic Tools for Data Security. Murat Kantarcioglu
UT DALLAS Erik Jonsson School of Engineering & Computer Science Overview of Cryptographic Tools for Data Security Murat Kantarcioglu Pag. 1 Purdue University Cryptographic Primitives We will discuss the
Developing and Integrating Java Based SIP Client at Srce
Developing and Integrating Java Based SIP Client at Srce Davor Jovanovi and Danijel Matek University Computing Centre, Zagreb, Croatia Davor.Jovanovic@srce.hr, Danijel.Matek@srce.hr Abstract. In order
Keywords Decryption, Encryption,password attack, Replay attack, steganography, Visual cryptography EXISTING SYSTEM OF KERBEROS
Volume 4, Issue 2, February 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Secure Authentication
WIRELESS PUBLIC KEY INFRASTRUCTURE FOR MOBILE PHONES
WIRELESS PUBLIC KEY INFRASTRUCTURE FOR MOBILE PHONES Balachandra Muniyal 1 Krishna Prakash 2 Shashank Sharma 3 1 Dept. of Information and Communication Technology, Manipal Institute of Technology, Manipal
Signature Amortization Technique for Authenticating Delay Sensitive Stream
Signature Amortization Technique for Authenticating Delay Sensitive Stream M Bruntha 1, Dr J. Premalatha Ph.D. 2 1 M.E., 2 Professor, Department of Information Technology, Kongu Engineering College, Perundurai,
Network Security. HIT Shimrit Tzur-David
Network Security HIT Shimrit Tzur-David 1 Goals: 2 Network Security Understand principles of network security: cryptography and its many uses beyond confidentiality authentication message integrity key
On the Security of an Improved Password Authentication Scheme Based on ECC
On the Security of an Improved Password Authentication Scheme Based on ECC Ding Wang 1,2, Chun-guang Ma 1, and Yu-heng Wang 2,3 1 Harbin Engineering University, Harbin City 150001, China 2 Automobile Management
Part I. Universität Klagenfurt - IWAS Multimedia Kommunikation (VK) M. Euchner; Mai 2001. Siemens AG 2001, ICN M NT
Part I Contents Part I Introduction to Information Security Definition of Crypto Cryptographic Objectives Security Threats and Attacks The process Security Security Services Cryptography Cryptography (code
Research Article Cloud-Based RFID Mutual Authentication Protocol without Leaking Location Privacy to the Cloud
International Journal of Distributed Sensor Networks Article ID 937198 Research Article Cloud-Based RFID Mutual Authentication Protocol without Leaking Location Privacy to the Cloud Qingkuan Dong, Jiaqing
NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES
NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES Ounasser Abid 1, Jaouad Ettanfouhi 2 and Omar Khadir 3 1,2,3 Laboratory of Mathematics, Cryptography and Mechanics, Department of Mathematics, Fstm,
Authentication. Readings. Chapters 9, 10 Sections
Authentication Readings Chapters 9, 10 Sections 11.1-11.3 1 Authentication: Who and How User (human) can be authenticated logging into a workstation using resources of a system issues: humans find it difficult
Formal Modelling of Network Security Properties (Extended Abstract)
Vol.29 (SecTech 2013), pp.25-29 http://dx.doi.org/10.14257/astl.2013.29.05 Formal Modelling of Network Security Properties (Extended Abstract) Gyesik Lee Hankyong National University, Dept. of Computer
CRYPTOGRAPHY IN NETWORK SECURITY
ELE548 Research Essays CRYPTOGRAPHY IN NETWORK SECURITY AUTHOR: SHENGLI LI INSTRUCTOR: DR. JIEN-CHUNG LO Date: March 5, 1999 Computer network brings lots of great benefits and convenience to us. We can
New Efficient Searchable Encryption Schemes from Bilinear Pairings
International Journal of Network Security, Vol.10, No.1, PP.25 31, Jan. 2010 25 New Efficient Searchable Encryption Schemes from Bilinear Pairings Chunxiang Gu and Yuefei Zhu (Corresponding author: Chunxiang
arxiv: v1 [cs.cr] 22 Oct 2013
arxiv:1310.5896v1 [cs.cr] 22 Oct 2013 The Cryptanalysis of Lee s Chaotic Maps-Based Authentication and Key Agreement Scheme using Smart card for Telecare Medicine Information Systems Dheerendra Mishra
Network Security CS 5490/6490 Fall 2015 Lecture Notes 8/26/2015
Network Security CS 5490/6490 Fall 2015 Lecture Notes 8/26/2015 Chapter 2: Introduction to Cryptography What is cryptography? It is a process/art of mangling information in such a way so as to make it
SECURITY ANALYSIS OF A SINGLE SIGN-ON MECHANISM FOR DISTRIBUTED COMPUTER NETWORKS
SECURITY ANALYSIS OF A SINGLE SIGN-ON MECHANISM FOR DISTRIBUTED COMPUTER NETWORKS B. VASAVI Abstract: Single sign-on (SSO) is a new authentication mechanism that enables a legal user with a single credential
Outline. Computer Science 418. Digital Signatures: Observations. Digital Signatures: Definition. Definition 1 (Digital signature) Digital Signatures
Outline Computer Science 418 Digital Signatures Mike Jacobson Department of Computer Science University of Calgary Week 12 1 Digital Signatures 2 Signatures via Public Key Cryptosystems 3 Provable 4 Mike
Comments on "public integrity auditing for dynamic data sharing with multi-user modification"
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers Faculty of Engineering and Information Sciences 2016 Comments on "public integrity auditing for dynamic
BIG DATA: CRYPTOGRAPHICALLY ENFORCED ACCESS CONTROL AND SECURE COMMUNICATION
BIG DATA: CRYPTOGRAPHICALLY ENFORCED ACCESS CONTROL AND SECURE COMMUNICATION 1 AKASH GUPTA, 2 ALOK SHUKLA, 3 S. VENKATESAN 1,2,3 Indian Institute of Information Technology, Allahabad Abstract The evolution
On the Limits of Anonymous Password Authentication
On the Limits of Anonymous Password Authentication Yan-Jiang Yang a Jian Weng b Feng Bao a a Institute for Infocomm Research, Singapore, Email: {yyang,baofeng}@i2r.a-star.edu.sg. b School of Computer Science,
A Study on Asymmetric Key Cryptography Algorithms
A Study on Asymmetric Key Cryptography Algorithms ASAITHAMBI.N School of Computer Science and Engineering, Bharathidasan University, Trichy, asaicarrier@gmail.com Abstract Asymmetric key algorithms use
Network Security. Computer Networking Lecture 08. March 19, 2012. HKU SPACE Community College. HKU SPACE CC CN Lecture 08 1/23
Network Security Computer Networking Lecture 08 HKU SPACE Community College March 19, 2012 HKU SPACE CC CN Lecture 08 1/23 Outline Introduction Cryptography Algorithms Secret Key Algorithm Message Digest
CPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 1 January 9, 2012 CPSC 467b, Lecture 1 1/22 Course Overview Symmetric Cryptography CPSC 467b, Lecture 1 2/22 Course Overview CPSC
Smart RFID for Smart Grid Network
Smart RFID for Smart Grid Network Anjana Krishna Final year PG student, Dept. of CSE(Cyber Security), SNGCE Kolenchery, M.G.University, Kerala, India ABSTRACT: Smart grid network supplies electricity to
Security and Efficiency Analysis on a Simple Keyword Search Scheme over Encrypted Data in Cloud Storage Services
Security and Efficiency Analysis on a Simple Keyword Search Scheme over Encrypted Data in Cloud Storage Services Chun-Ta Li 1, Jau-Ji Shen 2,, and Chin-Wen Lee 2 1 Department of Information Management,
A Generic Framework for Three-Factor Authentication
A Generic Framework for Three-Factor Authentication Jiangshan Yu 1 Guilin Wang 2 Yi Mu 2 Wei Gao 3 1 School of Computer Science University of Birmingham, UK 2 School of Computer Science and Software Engineering
An Efficient and Secure Key Management Scheme for Hierarchical Access Control Based on ECC
An Efficient and Secure Key Management Scheme for Hierarchical Access Control Based on ECC Laxminath Tripathy 1 Nayan Ranjan Paul 2 1Department of Information technology, Eastern Academy of Science and
Improving Security on Smart-Based Password Key Agreement
Improving Security on Smart-Based Password Key Agreement Raja Iyappan P, Krishnaveni V, Karthika M P.G student, Dept of CSE, Dhanalakshmi Srinivasan Engineering College, Tamilnadu, India P.G student, Dept
ISSN 2278-3091. Index Terms Cloud computing, outsourcing data, cloud storage security, public auditability
Outsourcing and Discovering Storage Inconsistencies in Cloud Through TPA Sumathi Karanam 1, GL Varaprasad 2 Student, Department of CSE, QIS College of Engineering and Technology, Ongole, AndhraPradesh,India