• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.166-169
• /
• 2006

Almost all network systems provide an authentication mechanism based on user ID and password. In such system, it is easy to obtain the user password using a sniffer program with illegal eavesdropping. The one-time password and challenge-response method are useful authentication schemes that protect the user passwords against eavesdropping. In client/server environments, the one-time password scheme using time is especially useful because it solves the synchronization problem. In this paper, we present a new identification scheme: OPI(One Pass Identification). The security of OPI is based on the square root problem, and OPI is secure: against the well known attacks including pre-play attack, off-line dictionary attack and server comprise. A number of pass of OPI is one, and OPI processes the password and does not need the key. We think that OPI is excellent for the consuming time to verify the prover.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3319-3338
• /
• 2016

Cloud storage is becoming more and more popular because of its elasticity and pay-as-you-go storage service manner. In some cloud storage scenarios, the data that are stored in the cloud may be shared by a group of users. To verify the integrity of cloud data in this kind of applications, many auditing schemes for shared cloud data have been proposed. However, all of these schemes do not consider the access authorization problem for users, which makes the revoked users still able to access the shared cloud data belonging to the group. In order to deal with this problem, we propose a novel public auditing scheme for shared cloud data in this paper. Different from previous work, in our scheme, the user in a group cannot any longer access the shared cloud data belonging to this group once this user is revoked. In addition, we propose a new random masking technique to make our scheme preserve both data privacy and identity privacy. Furthermore, our scheme supports to enroll a new user in a group and revoke an old user from a group. We analyze the security of the proposed scheme and justify its performance by concrete implementations.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.141-144
• /
• 2003

We present a new password system, called dual password system, with the user verification procedure. Dual password system is the first password system in the world preventing the exposure of secret information to imposter at the terminal. User of dual password system matches two alphabets at same location of first password and second password iteratively for inputting password. Therefore, the deriving method of first password and second password from the password is important in dual password system. Related to the deriving method of first password and second password from password, a new problem, called dual password derivation problem, is defined, and the evaluation factors for the solutions of the dual password derivation problem are presented.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.3
• /
• pp.69-78
• /
• 2019

The amount of data is increasing significantly as information and communication technology advances, mobile, cloud computing, the Internet of Things and social network services become commonplace. As the data grows exponentially, there is a growing demand for services that recommend the information that users want from large amounts of data. Collaborative filtering method is commonly used in information recommendation methods. One of the problems with collaborative filtering-based recommendation method is the cold start problem. In this paper, we propose a method to improve the cold start problem. That is, it solves the cold start problem by mapping the item evaluation data that does not exist to the initial user to the automatically generated data from the mobile app. We describe the main contents of the proposed method and explain the proposed method through the book recommendation scenario. We show the superiority of the proposed method through comparison with existing methods.

• Journal of Korean Society of Transportation
• /
• v.14 no.3
• /
• pp.27-44
• /
• 1996

The purpose of the thesis is providing a new formulation for the transit assignment problem. The existing models dealing with the transit assignment problem don't consider the congestion effects due to the insufficient capacity of transit vehicles. Besides, these models don't provide solutions satisfying the Wardrop's user equilibrium conditions. The congestion effects are considered to be concentrated at the transit stops. For the transit lines, the waiting times at the transit stops are dependent on the passenger flows. The new model suggests the route section cost function analogous to the link performance function of the auto assignment to reflect the congestion effects in congested transit network. With the asymmetric cost function, the variational inequality programming is used to obtain the solutions satisfying Wardrop's condition. The diagonalization algorithm is introduced to solve this model. Finally, the results are compared with those of EMME/2.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.152-155
• /
• 2002

In recent years, with the spread of communication media, such as a cellular phone and E-mail, we are able to communicate with others without any restriction of position or time. However, complexity of communicative context has increased so that user has to guess a partner user's situation and status in order to use various medias efficiently. This problem will grow larger as new media are brought in the expanding communications network. To solve this problem, we propose the system that guesses the context in communication by a user's media from the position information on PHS (Personal Handy phone System) and schedule information from schedule application. In this system a user's agent guesses automatically the context that owner has set, and answers the demand of the context from a partner user. Moreover, the agent decides a suitable answer, when there is a demand of communication by the media, which cannot be used.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.119-128
• /
• 2002

In case certification between user and service provider is achieved, problem that user's identity is revealed is occurring by social issue, so it was presented identity escrow scheme to solve these problem. In identity escrow scheme, the issuer who have correct user's identity transmits securely anonymity authentication information to user, and user achieves authentication phase with service provider keeping oneself anonymity using this. In this paper, we present requirement for security and trusty of identity escrow scheme and propose new mechanism that can security this. Also, propose method that service provider can deliver securely contents to user and propose mechanism that improve that support ky recovery at encryption communication that using secret key that it was generated by key agreement between users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2069-2085
• /
• 2021

A Social Networking Service (SNS) platform provides digital footprints to discover users' interests and track the social diffusion of product adoptions. How to identify a small set of seed users in a SNS who is potential to adopt a new promoting product with high probability, is a key question in social networks. Existing works approached this as a social influence maximization problem. However, these approaches relied heavily on text information for topic modeling and neglected the impact of seed users' relation in the model. To this end, in this paper, we first develop a general product adoption function integrating both users' interest and social influence, where the user interest model relies on historical user behavior and the seed users' evaluations without any text information. Accordingly, we formulate a product adoption maximization problem and prove NP-hardness of this problem. We then design an efficient algorithm to solve this problem. We further devise a method to automatically learn the parameter in the proposed adoption function from users' past behaviors. Finally, experimental results show the soundness of our proposed adoption decision function and the effectiveness of the proposed seed selection method for product adoption maximization.

• Journal of KIISE:Software and Applications
• /
• v.33 no.11
• /
• pp.953-964
• /
• 2006

Due to the usefulness of the collaborative filtering, it has been widely used in both the research and commercial field. However, there are still some challenges for it to be more efficient, especially the scalability problem, the sparsity problem and the cold start problem. In this paper. we address these problems and provide a novel distributed approach based on agents collaboration for the problems. We have tried to solve the scalability problem by making each agent save its users ratings and broadcast them to the users friends so that only friends ratings and his own ratings are kept in an agents local database. To reduce quality degradation of recommendation caused by the lack of rating data, we introduce a method using friends opinions instead of real rating data when they are not available. We also suggest a collaborative filtering algorithm based on user profile to provide new users with recommendation service. Experiments show that our suggested approach is helpful to the new user problem as well as is more scalable than traditional centralized CF filtering systems and alleviate the sparsity problem.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.2
• /
• pp.373-381
• /
• 2017

Currently, various types of user authentication methods based on public certificates are used in domestic financial transactions. Such an authorized certificate method has a problem that a different security module must be installed every time a user connects an individual financial company to a web server. Also, the financial company relying on this authentication method has a problem that a new security module should be additionally installed for each financial institution whenever a next generation authentication method such as biometric authentication is newly introduced. In order to solve these problems, we propose an integrated authentication system that handles user authentication on behalf of each financial institution in financial transactions, and proposes an integrated authentication protocol that handles secure user authentication between user and financial company web server. The new authentication protocol is a modified version of OAuth2.0 that increases security and efficiency. It is characterized by performing a challenge-response protocol with a pre-shared secret key between the authentication server and the financial company web server. This gives users a convenient and secure Single Sign-On (SSO) effect.