• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1125-1128
• /
• 2004

사용자 고유번호와 패스워드 기반의 사용자 인증 매커니즘을 수행하는 네트워크 시스템 환경에서는 스니퍼 프로그램 등을 이용하여 불법 도청함으로써 쉽게 사용자의 패스워드를 알아낼 수 있다. 이러한 불법적인 도청에 의한 패스워드 노출 문제를 해결하는 방법으로 일회용 패스워드, Challenge-Response 인증 방식이 유용하게 사용되며, 클라이언트/서버 환경에서는 별도 동기가 필요 없는 시간을 이용한 일회용 패스워드 방식이 특히 유용하게 사용될 수 있다. 안전성은 Square root problem에 기초를 두고 있고, 프리 플레이 공격, 오프라인 사전적 공격 그리고 서버 등을 포함하여 지금까지 잘 알려진 공격(해킹)들에 대해서 안전성을 높이기 위한 OPI을 제안하고자한다. OPI는 패스워드를 생성하는데 특별한 키를 생성할 필요가 없다는 것이다. OPI는 승인된 자를 확인하는데 걸리는 시간이 적게 소요되며, 특출하다.

• Monthly Duck's Village
• /
• s.253
• /
• pp.10-15
• /
• 2024

35일령 이상 오리의 고병원성 조류인플루엔자(AI) 발생이 전체의 64%에 달하는 가운데 경기도 오리농가들이 조기출하 장려금과 겨울철 난방비 지원 등 보다 근본적인 AI 방역대책을 요구해 귀추가 주목된다. 지난 7월 18일 박하담 한국오리협회장과 김광배 한국오리협회 경기도지회장을 비롯해 경기도 오리농가들은 이강영 경기도 축산동물복지국장, 최경묵 경기도 동물방역위생과장 등과 가진 간담회에서 AI 예방을 위한 대책 마련을 요청했다. 박하담 회장과 김광배 경기도지회장은 충북의 겨울철 난방비 지원 등을 예로 들며 경기도에서도 이같은 지원이 있어야 한다고 거듭 요청했다. 간담회 이후 마련한 식사자리에서 김광배 지회장은 경기도청의 오리관련 정책에 감사함을 표하며, "오리산업의 시초였던 경기도의 오리농가가 대폭 줄어든 것은 사실이지만 이는 도시화와 질병 등 여타의 원인 때문임을 인식하고 있으며 그럼에도 불구하고 경기도의 오리농가들은 내 농장은 내가 지킨다는 생각으로 방역에 최선을 다하며 산업을 발전시켜 나가겠다"고 말했다. 이어 오리산업에 대한 높은 이해도를 바탕으로 현장 밀착형 방역정책을 펼치고 있는 최옥봉 경기도 조류질병관리 팀장에게 감사패를 전달했다. 이날 간담회의 내용을 자세히 중계한다.

• 정보화사회
• /
• s.111
• /
• pp.26-30
• /
• 1997

정보사회가 고도화될수록 통신정보의 불법적인 도청과 함게, 원거리 엑세스에 발생되는 개인식별 문제, 컴퓨터 정보의 무단삭제 및 변조 등의 무결성 문제가 심각한 문제로 대두되고 있다. 이런 문제를 해결하는 암호기술이 정보보호 프로토콜(Cryptographic Protocol:또는 암호 프로토콜)분야이다.

• The Inventors News
• /
• no.38
• /
• pp.2-2
• /
• 2005

기능성 벽지와 관련한 특허출원 증가 - 정부지원연구실, 6백여 건의 특허실적 기록 - MP3 플레이어의 차기 주자 PMP 특허출원 증가 - 불법 도청, 특허로 잡는다 - 기술 특허, 아직 갈 길 멀었다

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1341-1348
• /
• 2016

In this paper, we propose method to enhance security performance using HT-STBC with artificial noise under Wier-Tap channel model that exist with legitimate receiver and illegal eavesdropper. Conventional STBC with artificial noise scheme has a weakness that a limited increase in the BER of the difference between the receiver and an eavesdropper, when used over QPSK modulation. To solve this problem, we suggest HT-STBC combining hadamard transform and STBC with artificial noise for reduce BER of receiver than the conventional scheme and demonstrated through simulation that also increased BER difference between the receiver and an eavesdropper. By the simulation results, when used proposed scheme, showed approximately 3dB improvement in performance compared to the conventional scheme.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.399-409
• /
• 2016

Gyeongsangbuk-do moved its provincial office in October, 2015 and has been building a new town with a goal to construct a truly self-sufficient city with the population of 100,000 people before 2027. However, a new town tends to be dualized in terms of its administrative districts, so it is raising a lot of problems regarding from city construction up to operation. In order to solve those problems, this author has selected Si Gun Gu integration that was chosen as a major task to do in 2012 among the basic plans to revise the local administration system announced by the promotional committee to reorganize administrative districts as the range of this research and analyzed how it is going on in Andong-si and Yecheon-gun where a provincial office new town is being constructed. The main contents of this study regard the theoretical model to reform the local administration system, basic plans to revise the local administration system, and necessity and directions for reorganizing administrative districts in Andong-si and Yecheon-gun. Based on that, this author suggests integration of administrative districts as a way for a provincial office new town to establish its identity and grow as a sustainable, new growth focus city in Gyeongsangbuk-do.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2213-2218
• /
• 2016

In this paper, we propose a new relay selection scheme which can decrease the secrecy outage probability in a relay communication network with multiple relays and an eavesdropper. In the conventional relay selection scheme, a relay transmits jamming signal toward an eavesdropper to decrease the successful decoding probability of the eavesdropper. The coventional scheme has a critical problem that the successful decoding probability of a receiver also decreases. The new relay selection scheme proposed in this paper can significantly enhance the secrecy outage probability by selecting a pair of relays which can increase the successful decoding probability of the receiver while decreasing the successful decoding probability of the eavesdropper. We performed extensive computer simulation based on Monte-Carlo. The simulation results reveal that the proposed relay selection scheme can improve the secrecy outage probability by 10 to 50 times compared to the existing relay selection scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.415-421
• /
• 2005

Passive RFID tag does not have its own power, so it has very poor computation abilities and it can deliver signals in very short range. From the facts, most RFID Tag security schemes assumed that the backward channel from tags to a reader is safe from eavesdropping. However, eavesdroppers near a tag can overhear message from a tag illegally. In this paper, we propose a method to protect the backward channel from eavesdropping by illegal readers. The proposed scheme can overcome the problems of conventional schemes such as randomized tree walking, which have been proposed to secure tag information in tree-walking algorithm as an anti-collision scheme for RFID tags. We showed the efficiency of our proposed method by using an analytical model, and it is also shown that the proposed method can provide the probability of eavesdropping in some standardized RFID tag system such as EPCglobal, ISO, uCode near to '0'.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.295-302
• /
• 2013

In the network coding, throughput can be increased by allowing the transformation of the received data at the intermediate nodes. However, the adversary can obtain more information at the intermediate nodes and make troubles for decoding of transmitted data at the sink nodes by modifying transmitted data at the compromised nodes. In order to resist the adversary activities, various information theoretic or cryptographic secure network coding schemes are proposed. Recently, a secure network coding based on the cryptographic hash function can be used at the random network coding. However, because of the computational resource requirement for cryptographic hash functions, networks with limited computational resources such as sensor nodes have difficulties to use the cryptographic solution. In this paper, we propose a new secure network coding scheme which uses linear transformations and table lookup and safely transmits n-1 packets at the random network coding under the assumption that the adversary can eavesdrop at most n-1 nodes. It is shown that the proposed scheme is an all-or-nothing transform (AONT) and weakly secure network coding in the information theory.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.49-61
• /
• 2003

Electronic voting schemes must provide universal verifiability and receipt-freeness, as well as basic properties such as privacy, eligibility, to make the election fair and transparent. But it is difficult to provide both universal verifiability and receipt-freeness because they are mutually contradictory in their objective. To date, most electronic voting schemes provide only one of these properties and those few that provide both properties are not practical due to heavy computational load. In this paper, we present an efficient electronic voting scheme that provides both properties. The proposed scheme uses a trusted third party called HR(Honest Randomizer) and requires only one-way untappable channels from HRs to voters. Among the schemes that assume only one-way untappable channel this scheme requires the least amount of computation. Among the schemes that provide both properties, this scheme uses the weakest physical assumption. We also discuss the security of the system and compare our scheme with other related schemes.