• Journal of Information Technology Services
• /
• v.8 no.2
• /
• pp.117-136
• /
• 2009

Over the years a password has been used as a popular authentication method between a client and a server because of its easy-to-memorize property. But, most password-based authentication services have focused on a same password authentication scheme which provides an authentication and key exchange between a client and a server with the same password. With rapid change of communication environments in the fields such as mobile networks, home networking, etc., the end-to-end security allowing users to hold different password is considered as one of main concerns. In this paper, we consider a new authentication service of how each client with different own password is able to authenticate each other, which is a quite new service paradigm among the existing services. This new service can be used in the current or next generation network environment where a mobile user in cell A wants to establish a secure end-to-end channel with users in ceil B, C, and D using only their memorable passwords. This end-to-end security service minimizes the interferences from the operator controlled by network components. To achieve this end-to-end security, we propose an authentication and key exchange service for group users in different realm, and analyze its security in a formal way. We also discuss a generic construction with the existing authentication schemes.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.18-27
• /
• 2008

This paper is to study a subclass of group-oriented cryptographic scheme: Many-to-one encryption and authentication scheme. The many-to-one encryption and authentication scheme is to solve a practical problem, i.e., the scenario that the number of the receivers is very small compared with the number of the senders and a receiver may serve millions of senders. Compared with the traditional methods, the burdens of the receiver and the KGC are reduced greatly. How to revoke a sender from his receiver's legitimate sender group is also proposed and it is efficient compared with some traditional methods. The proposed scheme is proven in the random oracle models. The computational complexity of our scheme is independent of the number of the senders. At the end of the paper, an example is given to show how to use our scheme in online software registration and update.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.75-88
• /
• 2011

Messages need to transmit to the neighbors securely in wireless sensor network, because a sensor node is deployed in hostile area. Thus it is necessary to support secure communication. One of the most important communication part is secure multicast. Especially, group rekeying is a big problem for multicast key management. So, group rekeying must be proceed securely when secrete information is exposed by attacker. Many group rekeying schemes have been studied for ad hoc networks. However, these schemes are Ill1desirable in WSNs. In this paper, we proposed a novel group rekeying scheme in WSNs that it has very powerful security.

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1502-1508
• /
• 2017

A musical key is a fundamental concept in Western music theory. It is a collective characterization of pitches and chords that together create a musical perception of the entire piece. It is based on a group of pitches in a scale with which a music is constructed. Each key specifies the set of seven primary chromatic notes that are used out of the twelve possible notes. This paper presents a method that identifies the key of a song using Hidden Markov Models given a sequence of chroma features. Given an input song, a sequence of chroma features are computed. It is then classified into one of the 24 keys using a discrete Hidden Markov Models. The proposed method can help musicians and disc-jockeys in mixing a segment of tracks to create a medley. When tested on 120 songs, the success rate of the music key identification reached around 87.5%.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.5 no.1
• /
• pp.31-38
• /
• 1980

The purpose of this paper is to exhibit existing replacement models and to develop new replacement models for managing equipments in large organizations, private or public. Some of the models in this paper are well known and in use, and some are not. All these models are classified, depending on main factors which play key roles on the models. One group is the models in which the economic factor plays a key role, and the other is those in which both the economic factor and the effectiveness factor play key roles.

• Food Science of Animal Resources
• /
• v.34 no.5
• /
• pp.700-708
• /
• 2014

The volatile composition of veal has yet to be reported and is one of the important factors determining meat character and quality. To identify the most important aroma compounds in veal from Holstein bull calves fed one of three diets, samples were subjected to solid-phase microextraction (SPME) combined with gas chromatography-quadrupole mass spectrometry (GC-MS). Most of the important odorants were aldehydes and alcohols. For group A (veal calves fed entirely on milk for 90 d before slaughter), the most abundant compound class was the aldehydes (52.231%), while that was alcohols (26.260%) in group C (veal calves fed starter diet for at least 60 d before slaughter). In both classes the absolute percentages of the volatile compounds in veal were different indicating that the veal diet significantly (p<0.05) affected headspace volatile composition in veal as determined by principal component analysis (PCA). Twenty three volatile compounds showed significance by using a partial least-squared discriminate analysis (PLS-DA) (VIP>1). The establishment of the global volatile signature of veal may be a useful tool to define the beef diet that improves the organoleptic characteristics of the meat and consequently impacts both its taste and economic value.

• Journal of Veterinary Science
• /
• v.19 no.6
• /
• pp.846-849
• /
• 2018

A group of benign Theileria species, which are often referred to as T. orientalis/T. buffeli/T. sergenti group, has low pathogenicity in cattle. Herein, we report on Theileria spp. in cattle on a farm from China. Based on phylogenetic analysis of the major piroplasm surface protein gene sequences, we detected 6 genotypes that were categorized as Types 1, 2, 3, 4, and 5 as well as an additional Type 9 genotype. The new epidemiological features of the T. orientalis/T. buffeli/T. sergenti parasites in China indicate a greater diversity in the genetics of these species than had been previously thought.

• Journal of the Korea Convergence Society
• /
• v.7 no.1
• /
• pp.49-55
• /
• 2016

In a delegate authentication, a user can lend his/her own authentication data to the third parties to let them be authenticated instead of himself/herself. The user authentication schemes based on the memory of unique data such as password, are vulnerable to this type of attack. Biometric authentication could minimize the risk of delegate authentication since it uses the biometric data unique by each person. Group authentication scheme is used to prove that each group member belongs to the corresponding group. For applications such as an electronic voting or a mobile meeting where the number of group members is changing dynamically, a new group authentication method is needed to reflect the status of group in real time. In this paper, we propose biometric authentication based dynamic group signature scheme. The proposed scheme is composed of biometric key generation, group public key creation, group signature generation, group signature verification and member update protocols. The proposed member update protocol is secure against colluding attacks of existing members and could reflect group status in real time.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.865-874
• /
• 2010

Recently, Hao et al. proposed a privacy preservation protocol based on group signature scheme for secure vehicular communications to overcome a well-recognized problems of secure VANETs based on PKI. However, although efficient group signature schemes have been proposed in cryptographic literatures, group signature itself is still a rather much time consuming operation. In this paper, we propose a more efficient privacy preservation protocol than that of Hao et al. In order to design a more efficient anonymous authentication protocol, we consider a key-insulated signature scheme as our cryptographic building block. We demonstrate experimental results to confirm that the proposed protocol is more efficient than the previous scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1184-1192
• /
• 2000

Multicast has communication mechanism that is able to transfer voice, video for only the specific user group. As compared to unicast, multicast is more susceptive to attack such as masquerading, malicious replay, denial of service, repudiation and traffic observation, because of the multicast has much more communication links than unicast communication. Multicast-specific security threats can affect not only a group's receivers, but a potentially large proportion of the internet. In this paper, we proposed the multicast security model that is able to secure multi-group communication in CBT(Core Based Tree), which is multicast routing. And designed the multicast key distribution protocol that can offer authentication, user privacy using core (be does as Authentication Server) in the proposed model.