264 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author임을규-
dc.date.accessioned2018-07-26T08:47:56Z-
dc.date.available2018-07-26T08:47:56Z-
dc.date.issued2013-10-
dc.identifier.citationProceedings of the 2013 Research in Adaptive & Convergent Systems, 2013, P.322-327en_US
dc.identifier.isbn978-145032348-2-
dc.identifier.urihttp://dl.acm.org/citation.cfm?doid=2513228.2513300-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/73196-
dc.description.abstractThis paper proposes a method to calculate similarities of software without any source code information. The proposed method can be used for various applications such as detecting the source code theft and copyright infringement, as well as locating updated parts of software including malware. To determine the similarities of software, we used an approach that matches similar functions included in software. Our function-based matching process is composed of two steps. In step 1, the structural information of call graph in binary file is used to match functions, and the matched functions are not processed in step 2 to reduce the number of detailed matching. In step 2, by using instruction mnemonics, N-gram similarity-based matching is performed. Using the structural matching proposed in this paper, about 30% improvement in the matching performance is achieved with the four-tuple matching which also reduces the false positive rate compared to previous studies. Our other experimental results showed that, in comparison to source code-based approaches, our proposed method has only about 3% difference in similarity calculation with real software samples. Therefore, we argue that our proposed method makes a contribution in the field of binary-based software similarity calculation.en_US
dc.description.sponsorshipThis research was supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (NIPA-2013-H0301-13-4009) supervised by the NIPA (National IT Industry Promotion Agency)en_US
dc.language.isoenen_US
dc.publisher2013 ACM New York, NY, USAen_US
dc.subjectBinary Analysisen_US
dc.subjectStatic Analysisen_US
dc.subjectSoftware Similarityen_US
dc.subjectCall Graphen_US
dc.subjectFunction Matchingen_US
dc.subjectN-gramen_US
dc.subjectMalwareen_US
dc.titleFunction matching-based binary-level software similarity calculationen_US
dc.typeArticleen_US
dc.identifier.doi10.1145/2513228.2513300-
dc.relation.page322-327-
dc.contributor.googleauthorLee, Yeo Reum-
dc.contributor.googleauthorKang, BooJoong-
dc.contributor.googleauthorIm, Eul Gyu-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF COMPUTER SCIENCE-
dc.identifier.pidimeg-
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE(컴퓨터소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE