Flexible Multimedia Stream Authentication

2011 ◽  
pp. 315-334
Author(s):  
Tieyan Li
Keyword(s):  
Performance Analysis ◽  
Layered Structure ◽  
Authentication Scheme ◽  
Multimedia Content ◽  
Multiple Sources ◽  
Security Issues ◽  
Multimedia Stream ◽  
Authentication Schemes ◽  
And Performance ◽  
Flexible Model

The multimedia community is moving from monolithic applications to more flexible and scalable proliferate solutions. Security issues such as access control and authentication of multimedia content have been intensively studied in the literature. In particular, stream authentication tends to be more complicated since a stream may be transcoded by intermediate proxies or composed by multiple sources. Traditional stream authentication schemes consider a stream as a group of packets and authenticate these packets over an erasure channel. However, by fixing the packets in transmission, any packet manipulation will cause authentication failure. In this chapter, we assume a more flexible model where a proxy, between a sender and a receiver, is able to make transcoding operations over a stream. We describe a flexible stream authentication framework that allows the so called packet independent stream authentication schemes to make transcoding operations on the packets and commit the changes, which are not applicable n packet-based stream authentication schemes. Such a stream authentication scheme based on the layered structure of a stream is elaborated in details w.r.t., the encoding, packing, amortizing, and verifying methods. The security and performance analysis show that the packet independent stream authentication schemes achieve higher authentication rate with less overhead per packet, as compared with that of packet based schemes.

An Efficient Mobile User Authentication Scheme with User Anonymity for Wireless Communications

2014 ◽  
Vol 631-632 ◽  
pp. 906-909
Author(s):  
Wei Jing Li ◽  
Ping Zhu ◽  
Hua Zhang ◽  
Zheng Ping Jin
Keyword(s):  
Wireless Communications ◽  
Performance Analysis ◽  
Elliptic Curve Cryptography ◽  
User Authentication ◽  
Mobile User ◽  
User Anonymity ◽  
Authentication Scheme ◽  
User Authentication Scheme ◽  
Authentication Schemes ◽  
And Performance

Recently, many mobile user authentication schemes with user anonymity for wireless communications have been proposed. In 2012, Li and Lee proposed a novel user authentication and privacy preserving scheme with smart cards for wireless communications. In 2013, Jeon et al. proposed an improved user authentication scheme, and claimed their scheme achieves user anonymity and more efficient. On the basis of their work, we put forward a new user authentication scheme using elliptic curve cryptography with user anonymity for wireless communications. The security and performance analysis show that the new scheme is more secure and efficient for wireless communications.

scholarly journals An Anonymous and Efficient ECC-Based Authentication Scheme for SIP

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Yousheng Zhou ◽  
Xinyun Chen
Keyword(s):  
Performance Analysis ◽  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Impersonation Attack ◽  
Authentication Schemes ◽  
And Performance ◽  
Secure Authentication ◽  
Key Compromise Impersonation

Session initiation protocol (SIP), a widely used signal protocol for controlling multimedia communication sessions, is under numerous attacks when performing the authentication steps between the user and server. So secure authentication schemes are needed to be presented for SIP. Recently, Arshad et al. advanced novel schemes for SIP using elliptic curve cryptography (ECC) and claimed their schemes can resist various attacks. However, Lu et al. found that Arshad et al.’s scheme cannot resist trace and key-compromise impersonation attacks; hence, it cannot provide proper mutual authentication. Meanwhile, an enhanced scheme was advanced by Lu et al. and they stated that their scheme can stand up to possible known attacks. Nevertheless, in this paper, we conclude that Arshad and Nikooghadam’s scheme is insecure against impersonation attack and Lu et al.’s scheme is still vulnerable to impersonation attack. To overcome these weaknesses of their schemes, we present a novel anonymous ECC-based scheme for SIP. Security analysis and performance analysis show that our proposed scheme can resist various known attacks and efficient in the meantime.

scholarly journals Robust and Efficient Authentication Scheme for Session Initiation Protocol

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Yanrong Lu ◽  
Lixiang Li ◽  
Yixian Yang
Keyword(s):  
Performance Analysis ◽  
Key Agreement ◽  
Mutual Authentication ◽  
Session Initiation Protocol ◽  
Authentication Scheme ◽  
Application Layer ◽  
Crucial Issue ◽  
Authentication And Key Agreement ◽  
Authentication Schemes ◽  
Key Compromise Impersonation

The session initiation protocol (SIP) is a powerful application-layer protocol which is used as a signaling one for establishing, modifying, and terminating sessions among participants. Authentication is becoming an increasingly crucial issue when a user asks to access SIP services. Hitherto, many authentication schemes have been proposed to enhance the security of SIP. In 2014, Arshad and Nikooghadam proposed an enhanced authentication and key agreement scheme for SIP and claimed that their scheme could withstand various attacks. However, in this paper, we show that Arshad and Nikooghadam’s authentication scheme is still susceptible to key-compromise impersonation and trace attacks and does not provide proper mutual authentication. To conquer the flaws, we propose a secure and efficient ECC-based authentication scheme for SIP. Through the informal and formal security analyses, we demonstrate that our scheme is resilient to possible known attacks including the attacks found in Arshad et al.’s scheme. In addition, the performance analysis shows that our scheme has similar or better efficiency in comparison with other existing ECC-based authentication schemes for SIP.

Lightweight Communication Overhead Authentication Scheme Using Smart Card

2016 ◽  
Vol 1 (3) ◽  
pp. 597 ◽  
Author(s):  
Ahmed Y. F. Al_Sahlani ◽  
Songfeng Lu
Keyword(s):  
Smart Card ◽  
Wide Spectrum ◽  
Remote Access ◽  
Authentication Scheme ◽  
Communication Overhead ◽  
Computation Cost ◽  
Authorized User ◽  
Authentication Schemes ◽  
And Performance ◽  
Remote User

<p>Authentication takes its place to grant authorized user a remote access to certain online resources. As well, prevent unauthorized user from accessing that resources. Unforyunatly most of authentication schemes consider only security factors without taking in consideration the communication resources required. Recently, Li et. al. proposed an enhanced smart card based remote user password authentication scheme. We analyzed their scheme and we pointed out that, their scheme required high communication overhead. Furthermore, their scheme suffer from forgery, user impersonation and server impersonation attacks. Through this paper to address aforesaid weaknesses, we propose a Lightweight communication overhead authentication scheme using smart card. The security and performance analysis shows that, our proposed scheme is lightweight communication and computation cost as well secure and can withstand wide spectrum of malicious attacks, like forgery, insider, replay and stolen smart card attack. Besides, our scheme encompasses desired security attributes. Therefore, it is suitable for practical use compared to other related scheme. </p>

DIRECTED USER AUTHENTICATION SCHEME BASED ON DISCRETE LOGARITHM

1999 ◽  
Vol 09 (05n06) ◽  
pp. 299-306 ◽  
Author(s):  
SHAOHUA TANG ◽  
WEIHUA MA
Keyword(s):  
User Authentication ◽  
Mutual Authentication ◽  
Discrete Logarithm ◽  
Authentication Scheme ◽  
User Authentication Scheme ◽  
Authentication Schemes ◽  
And Performance

One new concept, "directed" authentication is presented in this letter. By "directed", we mean "of one direction", i.e., only the specified verifier can validate the verifiee's identity, anyone else cannot verify it without the help of this specified verifier. One strong directed authentication scheme based on the discrete logarithm is proposed in this letter, and the security and performance of which are also analyzed. It is shown in this letter that the proposed scheme is secure and the performance is superior to those of the mutual authentication schemes based on ID-based cryptosystems.

Sign in / Sign up

Export Citation Format

Share Document