http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An Enhanced Password Authentication Scheme Providing Password Updating without Smart Cards
Chin-Chen Chang,Hao-Chuan Tsai,Yi-Hui Chen 보안공학연구지원센터 2007 International Journal of Security and Its Applicat Vol.1 No.2
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 a stolen-verifier attack and a server spoofing attack under some reasonable assumption. In addition, we propose an improved scheme to eliminate such security flaws.
Constructing a Conversation Key in Three-Party Communications Environment
Chin-Chen Chang,Yu-Wei Su,Chia-Yin Lee 보안공학연구지원센터 2008 International Journal of Multimedia and Ubiquitous Vol.3 No.1
This article proposes an efficient, less communication rounds, three-party encrypted key exchange protocol to achieve the authentication requirement. The protocol is provided with (1) no asymmetric encryption algorithm which is adopted to reduce the costs (such as any public-key infrastructure); (2) using pre-shared key to prevent adversaries that masquerade as legal users after guessing attacks; (3) avoiding the variant man-in-the-middle attacks on Diffie-Hellman based protocols; (4) achieving mutual authentication. With these four features, the proposed protocol is suitable for being applied for establishing secure channels between two clients, which are supported with the same trusted server.
A Conference Key Distribution Scheme Using Interpolating Polynomials
Chin-Chen Chang,Chu-Hsing Lin,Chien-Yuan Chen 보안공학연구지원센터 2007 International Journal of Security and Its Applicat Vol.1 No.2
Conference keys are secret keys used by a group of users commonly and with which they can encipher (or decipher) messages such that communications are secure. Based on the Diffie and Hellman’s PKDS, a conference key distribution scheme is presented in this paper. A sealed lock is used to lock the conference key in such a way that only the private keys of the invited members are matched. Then the sealed lock is thus made public or distributed to all the users, only legitimate users can disclose it and obtain the conference key. In our scheme, the construction of a sealed lock is simple and the revelation of a conference key is efficient
A Friendly Password Mutual Authentication Scheme for Remote-Login Network Systems
Chin-Chen Chang,Chia-Yin Lee 보안공학연구지원센터 2008 International Journal of Multimedia and Ubiquitous Vol.3 No.1
In 2000, Sun proposed a user authentication scheme without using a password table but the user’s password is assigned by the server. Due to this reason, Wu and Chieu proposed an improved scheme to overcome the drawback in 2003. Their scheme provides users to choose and change passwords freely. However, Yang and Wang has presented the possible attacks on Wu-Chieu scheme in 2004. In this article, we proposed an efficient scheme to avoid the weakness of Wu-Chieu scheme. Besides, our scheme provides the feature of mutual authentication between the user and the server.
Reversible Data Hiding Scheme for VQ Indices Based on Absolute Difference Trees
( Chin-chen Chang ),( Thai-son Nguyen ),( Chia-chen Lin ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.7
Reversible data hiding is a technique for recovering original images without any distortion after secret data are extracted from the image. The technique continues to attract attention from many researchers. In this paper, we introduce a new reversible data hiding scheme based on the adjacent index differences of vector quantization (VQ) indices. The proposed scheme exploits the differences between two adjacent indices to embed secret data. Experimental results show that our scheme can achieve a lower compression rate than an earlier scheme by Yang and Lin. Our scheme`s average compression rate, 0.44 bpp, outperforms that of Yang and Lin`s scheme, which averages 0.53 bpp. Moreover, the embedding capacity of our scheme can rise to 1.45 bpi, which also is superior to that of Chang et al.`s scheme [35] (1.00 bpi)Yang and Lin`s scheme [27] (0.91 bpi) as well as Chang et al.`s scheme [26] (0.74 bpi).
A Verifiable and Traceable Secondhand Digital Media Market Protocol
( Chin-ling Chen ),( Chin-chang Chen ) 한국인터넷정보학회 2011 KSII Transactions on Internet and Information Syst Vol.5 No.8
As used product transactions are currently on the rise, the demand for transactions of secondhand digital content will grow in the future; thus, learning to make secure transactions while avoiding cyber attacks becomes an important issue. In this paper, we combine the new buyer`s secret key, the new buyer`s watermark to embed in resold digital content, and the reseller`s encrypted watermark, which can prove legal ownership of the reseller. Using the privacy homomorphism property of RSA and exponential calculus, the original seller of digital content can verify the legality of the reseller and the new buyer. We also reduced the load of encryption/decryption digital content using a partial encryption/decryption algorithm to make our protocol more efficient and practical. In the proposed protocol, the seller is not able to conduct piracy and easily frame any other innocent secondhand buyer when a case of piracy is found. In fact, piracy can be clearly traced using the privacy homomorphism property of RSA and the embedded watermark mechanism. Further, in the proposed protocol, the seller himself can trace the piracy using exponential calculus. Since it is unnecessary to trust third party participation, the conspiracy problem is resolved and the new buyer is not required to participate in the dispute. Moreover, the seller, reseller and new buyer can simultaneously benefit from the secondhand transaction.