• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (D)
• /
• pp.67-69
• /
• 2006

P2P 검색 네트워크에서 노드간의 정확한 자료를 검색하는 방법은 중요한 연구주제이며 다양한 종류의 기법들이 제안되어 있다. 본 논문은 그 중에서 Gnutella 네트워크를 기반으로 기존의 검색 결과를 이용하여 다음 번 자료 검색 시 높은 확률로 정확한 자료를 찾을 수 있게 도와주는 검색 방법인 APS 방식의 단점을 지적하고 거리에 따른 자료의 분포를 알 수 있는 인덱스인 Attenuated bloom filter를 교환하고 이를 검색에 이용하여 APS의 문제점들을 해결하고 동시에 전반적인 검색성공률을 높이는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2007년도 한국컴퓨터종합학술대회논문집 Vol.34 No.1 (D)
• /
• pp.225-228
• /
• 2007

센서 네트워크는 일반적으로 자원이 극히 한정되어있는 센서 노드를 이용하여 구성이 되게 된다. 센서노드의 대역폭, 계산 능력, 메모리, 전력과 같이 많은 부분에서 일반적인 네트워크 노드보다 훨씬 적은 자원만을 사용할 수 있다. 이 중 전력은 센서 노드를 동작하게 해주는 매우 중요한 요소이기 때문에, 효율적으로 전력 사용이 필요하다. 전력 소모를 줄이는 방법에는 여러 가지가 존재하게 되는데, 본 논문에서는 센서 노드에서 송신하는 데이터의 크기를 줄이는 방법에 대해서 제안하였다. 제안하는 방법은 bloom filter를 이용하여 데이터의 내용을 필터링하도록 하였다. 그리고 기존 데이터 대신 작은 크기의 필터링 된 값을 베이스 스테이션으로 전송함으로 전력 소모를 줄이게 된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2014년도 춘계학술발표대회
• /
• pp.338-339
• /
• 2014

전투무선망은 망토폴로지 변화가 심하고 대역폭, 전원 등 자원이 제한되는 ad-hoc 망의 특성을 가지기 때문에 발생하는 데이터 전송 지연은 임무 성공에 결정적 영향을 미칠 수 있다. 따라서 전투무선망에는 망토폴로지 변화에 강한 AODV 를 기반으로 성능 개선을 위한 다양한 방법들이 제안 되어 왔다. 그러나 Reactive 방식의 알고리즘이 가지는 경로탐색시간 동안 데이터를 보낼 수 없는 문제로 인하여 발생하는 지연시간을 줄이기 위한 연구는 부족한 실정이다. 본 연구에서는 Bloom Filter 에 담아 미리 수집한 이웃 노드의 정보를 이용하여 AODV 의 경로탐색 및 경로복구시간 동안 데이터를 전송하는 것으로 전송지연을 줄인다. 제안된 방법을 적용 시 AODV 를 이용할 때보다 향상된 지연시간 성능을 얻을 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2011년도 추계학술발표대회
• /
• pp.768-769
• /
• 2011

VANET(Vehicular Ad-hoc Network)는 MANET(Mobile Ad-hoc Network)의 한 형태로, 다수의 차량들이 무선통신을 이용하여 차량 간 통신 또는 차량과 RSU(Road Side Unit)사이의 통신을 제공하는 차세대 네트워킹 기술이다. VANET환경에서 기존의 그룹 서명 방식을 이용한 메시지 서명 및 검증이 이루어진다면, 통신 차량이 많아질수록 오버헤드가 발생하는 단점을 지니고 있다. 이에 따라, 본 논문에서는 다수의 차량 간 통신 시에 보다 효율적인 메시지 검증을 위해 Bloom Filter를 이용한 메시지 일괄 검증 기법을 제안한다.

• Convergence Security Journal
• /
• 제13권4호
• /
• pp.47-52
• /
• 2013

VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks which is consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many fields. It provides traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. In VANET, it has been studies that group signature method for user privacy. However, among a group of group key generation phase and group key update phase, RSU(Road-Side Unit) and the computational overhead of the vehicle occur. In this paper, we propose an efficient group key management techniques with CBF(Counting Bloom Filter). Our group key management method is reduced to the computational overhead of RSU and vehicles at the group key generation and renewal stage. In addition, our method is a technique to update group key itself.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권6호
• /
• pp.2115-2130
• /
• 2022

With the development of over-the-top (OTT) services, the demand for content is increasing, and you can easily and conveniently acquire various content in the online environment. As a result, copyrighted content can be easily copied and distributed, resulting in serious copyright infringement. Some special forms of online service providers (OSP) use filtering-based technologies to protect copyrights, but illegal uploaders use methods that bypass traditional filters. Uploading with a title that bypasses the filter cannot use a similar search method to detect illegal content. In this paper, we propose a technique for profiling the Heavy Uploader by normalizing the bypassed content title and efficiently detecting illegal content. First, the word is extracted from the normalized title and converted into a bit-array to detect illegal works. This Bloom Filter method has a characteristic that there are false positives but no false negatives. The false positive rate has a trade-off relationship with processing performance. As the false positive rate increases, the processing performance increases, and when the false positive rate decreases, the processing performance increases. We increased the detection rate by directly comparing the word to the result of increasing the false positive rate of the Bloom Filter. The processing time was also as fast as when the false positive rate was increased. Afterwards, we create a function that includes information about overall piracy and identify clustering-based heavy uploaders. Analyze the behavior of heavy uploaders to find the first uploader and detect the source site.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제43권7호
• /
• pp.93-103
• /
• 2006

Network solutions for protecting against worm attacks that complement partial end system patch deployment is a pressing problem. In the content-based worm filtering, the challenges focus on the detection accuracy and its performance enhancement problem. We present a worm filter architecture using the bloom filter for deployment at high-speed transit points on the Internet, including firewalls and gateways. Content-based packet filtering at multi-gigabit line rates, in general, is a challenging problem due to the signature explosion problem that curtails performance. We show that for worm malware, in particular, buffer overflow worms which comprise a large segment of recent outbreaks, scalable -- accurate, cut-through, and extensible -- filtering performance is feasible. We demonstrate the efficacy of the design by implementing it on an Intel IXP network processor platform with gigabit interfaces. We benchmark the worm filter network appliance on a suite of current/past worms, showing multi-gigabit line speed filtering prowess with minimal footprint on end-to-end network performance.

• The Journal of Korean Institute of Next Generation Computing
• /
• 제14권5호
• /
• pp.60-70
• /
• 2018

A software defined storage (SDS) is being deployed in cloud environment to allow multiple users to virtualize physical servers, but a solution for optimizing space efficiency with limited physical resources is needed. In the conventional data deduplication system, it is difficult to deduplicate redundant data uploaded to distributed storages. In this paper, we propose a distributed deduplication method using similarity-based clustering and multi-layer bloom filter. Rabin hash is applied to determine the degree of similarity between virtual machine servers and cluster similar virtual machines. Therefore, it improves the performance compared to deduplication efficiency for individual storage nodes. In addition, a multi-layer bloom filter incorporated into the deduplication process to shorten processing time by reducing the number of the false positives. Experimental results show that the proposed method improves the deduplication ratio by 9% compared to deduplication method using IP address based clusters without any difference in processing time.

• Journal of KIISE:Information Networking
• /
• 제37권3호
• /
• pp.175-186
• /
• 2010

Due to the emergence of new application programs and the fast growth of Internet users, Internet routers are required to provide the quality of services according to the class of input packets, which is identified by wire-speed packet classification. For a pre-defined rule set, by performing multi-dimensional search using various header fields of an input packet, packet classification determines the highest priority rule matching to the input packet. Efficient packet classification algorithms have been widely studied. Tuple pruning algorithm provides fast classification performance using hash-based search against the candidate tuples that may include matching rules. Bloom filter is an efficient data structure composed of a bit vector which represents the membership information of each element included in a given set. It is used as a pre-filter determining whether a specific input is a member of a set or not. This paper proposes new tuple pruning algorithms using Bloom filters, which effectively remove unnecessary tuples which do not include matching rules. Using the database known to be similar to actual rule sets used in Internet routers, simulation results show that the proposed tuple pruning algorithm provides faster packet classification as well as consumes smaller memory amount compared with the previous tuple pruning algorithm.

• Journal of Digital Contents Society
• /
• 제19권2호
• /
• pp.327-334
• /
• 2018

When a PC is infected with a malicious code, it communicates with the control and command (C&C) server and, by the attacker's instructions, spreads to the internal network and acquires information. The company focuses on preventing attacks from the outside in advance, but malicious codes aiming at APT attacks are infiltrated into the inside somehow. In order to prevent the spread of the damage, it is necessary to perform internal monitoring to detect a PC that is infected with malicious code and attempts to communicate with the C&C server. In this paper, a destination IP monitoring method is proposed in this paper using Bloom filter to quickly and effectively check whether the destination IP of many packets is in the blacklist.