Anonymous Authentication Scheme without Verification Table for Wireless Environments
スポンサーリンク
概要
- 論文の詳細を見る
Lee and Kwon proposed an anonymous authentication scheme based on Zhu et al.'s scheme. However, Lee et al.'s scheme has two disadvantages. Firstly, their scheme is vulnerable to off-line dictionary attacks. An adversary can guess a user password from the user's login messages eavesdropped by the adversary. Secondly, an authentication server called a home agent requires a verification table, which violates the original advantage of Zhu et al.'s scheme. That is, it increases the key management costs of the home agent. In this letter, we show the weaknesses of Lee et al.'s scheme and another three existing schemes. Then, we propose a new secure scheme without the verification table, while providing security for off-line dictionary attacks and other attacks except for a certain type of combined attacks.
- The Institute of Electronics, Information and Communication Engineersの論文
著者
-
Morii Masakatu
Graduate School Of Engineering Kobe University
-
ISAWA Ryoichi
Graduate School of Science and Technology, Kobe University
関連論文
- A Chosen-IV Key Recovery Attack on Py and Pypy
- A-6-8 Improved Bitslice Network for Computing the TIB3 S-Box
- Fast WEP-Key Recovery Attack Using Only Encrypted IP Packets
- Reversible Watermark with Large Capacity Based on the Prediction Error Expansion
- Fingerprinting Protocol Based on Distributed Providers Using Oblivious Transfer(Cryptography,Information Theory and Its Applications)
- Reversible Watermark with Large Capacity Based on the Prediction Error
- Reversible Watermark with Large Capacity Using the Predictive Coding
- S-Box Bitslice Networks as Network Computing
- New Weakness in the Key-Scheduling Algorithm of RC4
- Internal-State Reconstruction of a Stream Cipher RC4(Information Security)(Information Theory and Its Applications)
- Compression Functions Suitable for the Multi-Property-Preserving Transform
- Systematic Generation of Tardos's Fingerprint Codes
- A Probabilistic Algorithm for Computing the Weight Distribution of LDPC Codes
- On the Condition for Detecting (t+μ)-error by Reed-Solomon Decoder Based on the Welch-Berlekamp Algorithm
- Generalized Classes of Weak Keys on RC4 Using Predictive State
- Irreducible m-Term Polynomial and Its Application to Multiplication over GF(2^m)
- Cryptanalysis for RC4 and Breaking WEP/WPA-TKIP
- Falsification Attacks against WPA-TKIP in a Realistic Environment
- On the Probabilistic Computation Method with Reliability for the Weight Distribution of LDPC Codes
- Comprehensive Analysis of Initial Keystream Biases of RC4
- Anonymous Authentication Scheme without Verification Table for Wireless Environments