The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
So far, engineers have proposed many authentication protocols to repair drawbacks of GSM system. Among them, Peinado's method can solve those and provide an anonymous channel for mobile users, an intruder therefore is unable to trace the identity and the location of the user. However, we find that authenticating VLR does not be performed at the first time when MS joins into a new visiting VLR to ask...
Recently, a secure authentication scheme with anonymity for wireless communications has been proposed. In this paper, we demonstrate some security flaws of this scheme and propose an improvement to solve these problems.
A new watermark method for detecting image tampering is proposed in this paper. First, an authentication number is created by using a pair of watermark pixels as the coefficients of a linear function. The central pixel of a host block as the input data to the linear function. The authentication information of that block is then embedded into the host image using the LSB matching revisited embedding...
A new fragile watermarking scheme for image authentication and location of areas that have been tampered with is proposed in this paper. Based on a quadratic-residue theorem, the proposed scheme generates the watermark block-by-block in the cover image. To improve security by preventing malicious attacks, such as the vector quantization attack, a pseudo-random number generator using a private key...
The advances of network technologies and digital devices facilitate users to exchange multimedia data over the public networks. However, this also raises significant concerns about how to protect sensitive multimedia data from being illegally modified. Therefore, this paper proposes a fragile watermarking scheme to detect illegitimate alterations of a watermarked image. The proposed method hides a...
In this paper, a new oblivious fragile watermarking using discrete cosine transform is proposed. It is inspired by Wong's public key watermarking scheme proposed in 1998 and aims to improve its vulnerability towards possible attacks indicated by Barreto and Holliman. Instead of making use of contextual information and making it an inter-block dependent scheme, as suggested by Barreto, we adopt another...
With the rapid development of Internet, e-mail authentication becomes more and more important. However, many existing e-mail authentication protocols are not secure enough. In 2005, Sun et al. proposed two e-mail protocols and claimed that can provide perfect forward secrecy. In 2007, Raphael showed the weaknesses of the two e-mail protocols.The first protocol can??t securely against unknown key-share...
Providing confidential communications and with integrity over an insecure network is an important issue. To achieve these goals, a common key, called session key, has to be established between communicating parties, and several key agreement schemes have been proposed. However, most of them were designed to establish one session key for each communication. To reduce the communication cost, establishing...
Two VQ-based image-tamper-proofing schemes for digital grayscale images are presented in this paper. The first scheme, which we call Scheme-1, partitions a VQ codebook into two sub-codebooks called the sub-codebook 0 and the sub-codebook 1. The sub-codebook 0 is used to imply embed authentication bit 0, and sub-codebook 1 is used to imply authentication bit 1. Once an intruder has modified the signed...
Lossless data hiding enables the embedding of messages in a host image without any loss of content. In this paper, we present a lossless data hiding technique based on histogram modification for image authentication that is lossless in the sense that if the marked image is deemed authentic, the embedding distortion can be completely removed from the marked image after the embedded message has been...
Authenticated key agreement protocol is an essential cryptographic tool for permitting two participants, Alice and Bob, who never met before to authenticate each other and negotiate a common session key in an insecure network. In 1999, Seo and Sweeney first proposed an authenticated key agreement protocol using a pre-shared password. Later, Tseng pointed out that Seo and Sweeney's protocol suffered...
Recently, Peyravian and Jeffries proposed an efficient password authentication scheme with key agreement, which utilizes no extra tokens and freely updates account numbers and passwords for users. Unfortunately, due to the fact that the integrity is not well protected, it is still vulnerable to the fatal weaknesses. To overcome these security flaws, we propose an enhanced version with novel architecture...
In this paper, we present an image authentication scheme for halftone images based on the error diffusion technique. Our scheme converts a gray-level image into a halftone image by using the error diffusion technique and embeds the authentication codes in the obtained halftone image at the same time. From the experimental results, our proposed scheme can detect the tampered places according to the...
With the popularity of wireless communication, the security of mobile networks becomes more and more important. However, due to the computation limitation, many existing authentication key agreement protocols are not suitable for wireless mobile networks. In 2005, Sui et al. proposed an efficient authentication key agreement protocol, but their protocol can not resist the off-line password guessing...
Over the insecure network environment, key agreement is essential for protecting the messages exchanged between two communication parties. And to achieve high security requirements, key agreement schemes providing mutual authentication are commonly used in modern information security systems. In 2005, Lee and Lee proposed a novel authentication with key agreement scheme. But we find that Lee-Lee's...
In 2003, Yang, Chang, and Hwang proposed an enhanced scheme of Peyravivan-Zunic's password authentication scheme by using the Diffie-Hellman scheme. Later, Yoon, Ryu, and Yoo demonstrated that Yang-Chang-Hwang's scheme is vulnerable to a stolen-verifier attack and a denial-of-service attack, and then proposed an improved scheme. In this paper, we show that Yoon-Ryu-Yoo's scheme is still vulnerable...
To address copyright protection and content authentication, researchers have proposed various digital watermarking methods. In this paper, an improved, multipurpose method is proposed where the authentication watermark and the robust watermark are embedded in the wavelet transform domain. Through a series of experiment, supportive evidence is provided to demonstrate the proposed method being effective...
The aim of deniable authenticated protocol allows the receiver to identity the source of a given message but not prove the identity of the sender to a third party. In this article, we propose a new non-interactive deniable authenticated protocol based on Diffie-Hellman key distribution protocol. It has lower communication costs and computational complexity than previously proposed schemes
A conference key is a secret common key among a group of users by which they can encrypt and decrypt messages to converse securely in a conference. This paper proposes a conference key distribution protocol for networking system. A lock is used to lock the conference key and is constructed such that only the private keys of legitimate users are matched. Therefore the lock is then put on the pubic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.