|
タマダ ハルアキ
TAMADA HARUAKI
玉田 春昭 所属 京都産業大学 情報理工学部 情報理工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2016 |
| 形態種別 | 研究論文（国際会議プロシーディングス） |
| 査読 | 査読あり |
| 標題 | Fast Comparison of Software Birthmarks for Detecting the Theft with the Search Engine |
| 執筆形態 | その他 |
| 掲載誌名 | 2016 4TH INTL CONF ON APPLIED COMPUTING AND INFORMATION TECHNOLOGY/3RD INTL CONF ON COMPUTATIONAL SCIENCE/INTELLIGENCE AND APPLIED INFORMATICS/1ST INTL CONF ON BIG DATA, CLOUD COMPUTING, DATA SCIENCE & ENGINEERING (ACIT-CSII-BCD) |
| 出版社・発行元 | IEEE |
| 巻・号・頁 | pp.152-157 |
| 著者・共著者 | Jun Nakamura,Haruaki Tamada |
| 概要 | The software birthmarks were proposed for detecting the software theft, which is suspected a copy. The birthmark system extracts native characteristics of a program. Then, the system computes the similarity between two birthmarks. This paper proposes the reduction method of the comparison time for the birthmark system. The conventional birthmark systems did not care the comparison time. Therefore, the enormous amount of programs could not compare practically for requiring quite a huge comparison time. To solve the problem, we tackled to reduce the comparison time with the search engine. So that we introduce the pre-comparison phase into conventional birthmark procedures to narrow the defendant programs. We implemented the proposed method with Apache Solr search engine and evaluated the method. The result was shown that the method for UC birthmark dramatically reduces the comparison time 81.35%, and narrows the target programs 74.81%. On the other hand, the results were not good in the default threshold epsilon = 0.75 ( high false negative rates C-FN = 67.01%, and low accuracies M-a = 34.18%). However, the results were improved C-FN = 21.17% and M-a = 78.56% in average by lowering epsilon = 0.25. |
| DOI | 10.1109/ACIT-CSII-BCD.2016.38 |