• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1998.12a
• /
• pp.243-252
• /
• 1998

비밀분산은 비밀정보의 관리나 multiparty 프로토콜, 그룹 암호방식등의 분야에서 매우 중요한 부분이다. 따라서 본 논문에서는 일방향 해쉬함수에 기반한 효율적인 온라인 비밀분산 방식을 제안하고자 한다. 제안하는 방식은 하나의 share만으로 여러 개의 비밀을 분산할 수 있고, 액세스 구조가 변하는 경우에 notice board에 공개된 값들만 변경하면 각 참가자들은 기존의 share를 그대로 사용할 수 있다. 또한 참가자들의 부정이 있는 경우 그 수에 관계없이 부정한 참가자의 신분을 밝혀낼 수 있으며, 기존의 방식보다 계산상 효율적이라는 장점이 있다.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.831-836
• /
• 2006

In this paper, we propose a secure and efficient secret sharing scheme Based on wide pipe hash function This scheme provides the property to share multiple secrets and allows participants to be added/deleted dynamically, without haying to redistribute new secret shares. Proposed scheme has advantage to detect cheating and identify of all cheater, regardless of their number. Futhermore, it is more secure and efficient than previous schemes based on hash function.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3128-3137
• /
• 2000

Secret sharing scheme is a cryptographic protocol in which a dealer distribures shares of a secret among a set of participants such that only authorized set of participants can recover the secret at a later. Secret sharing is an important cryptographic primitive in management of secret information, secure multiparty protocol and group-oriented cryptography, etc. In this paper, we propose an efficient, on-line secret sharing scheme based on one-way hash function. This scheme provides the property to share multiple secrets and allows participants to be added/deleted dynamically, without having to redistributo new shares. Proposed scheme has advantage to detect cheating and identify of all cheater, regardless of then number. Frthermore, it is more eficient than previous schemes.

• Journal of Digital Convergence
• /
• v.9 no.3
• /
• pp.11-19
• /
• 2011

The spread of computer and network gets various social and economic activities done quickly and efficiently. As a result, it makes a crime using network easy and increases the vulnerability of a social system. As there is a crime as a social being, we need to give careful consideration to the crime occurring in virtual space. Accordingly, the purpose of this paper is to investigate the regulatory need of the Criminal Procedure concerning the network security issues as the new legal and regulatory space that begins to be realized from the late of 20th century because of the extent of social threat. Above all, we addresses whether the amendment of existing legal regulations is necessary, based on the special characteristics of the virtual space.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.4
• /
• pp.1-5
• /
• 2001

This study presents an electronic catalogue based cutting parameter selection system using MS Access software. The proposed system has been designed to electronically select proper cutting conditions based on the stored data base. The existing approaches used in most small and medium sized companies are basically to use manufacturing engineer's experience or to find the recommended values from the manufacturing engineer handbook. These processes are often time consuming and inconsistent, especially when a new engineer is involved. Therefore, this study proposes a simple, yet quick and consistent electronic catalogue based cutting parameter selection method which uses MS Access in terms of programming and database implementation. Consequently, the proposed system could automatically generate the proper cutting conditions (feed, depth of cut, and cutting speed) as soon as the input data (proper information about the tool and work material) is given. Thanks to the simple structure and popularity of the MS Access, the engineer could be quickly accustomed to the system and easily modify/insert/delete the database if necessary.