• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦

Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) ÇÁ·Î±×·¥ÀÇ ±¸Á¶Àû Ư¼ºÀ» »ç¿ëÇÑ ÀÚ¹Ù ¹ö½º¸¶Å©
¿µ¹®Á¦¸ñ(English Title) Java Birthmark based on Structural Characteristics of Programs
ÀúÀÚ(Author) ÀåÁØÇõ   Á¶À¯±Ù   È«Áö¸¸   Joonhyouk Jang   Yookun Cho   Jiman Hong  
¿ø¹®¼ö·Ïó(Citation) VOL 18 NO. 11 PP. 0794 ~ 0798 (2012. 11)
Çѱ۳»¿ë
(Korean Abstract)
¼ÒÇÁÆ®¿þ¾î ¹ö½º¸¶Å©(Software Birthmark)´Â ÇÁ·Î±×·¥ ½ÇÇà ÆÄÀϷκÎÅÍ ÇÁ·Î±×·¥ÀÇ °íÀ¯ÇÑ Á¤º¸¸¦ ÃßÃâÇÏ´Â ±â¹ýÀÌ´Ù. ¹ö½º¸¶Å©´Â ÇÁ·Î±×·¥À» º¯Çü½ÃÅ°´õ¶óµµ Á¦°ÅÇϱâ Èûµé°í, Ÿ ÇÁ·Î±×·¥°ú ±¸ºÐµÇ´Â Ư¼ºÀ» ´ë»óÀ¸·ÎÇϹǷΠÇÁ·Î±×·¥ÀÇ µµ¿ëÀ» ÆǺ°Çϱâ À§ÇØ ¿øº» ÇÁ·Î±×·¥°úÀÇ À¯»çµµ¸¦ ÃøÁ¤Çϰųª ¾Ç¼º Äڵ带 ŽÁö ÇÏ´Â µ¥ »ç¿ëµÈ´Ù. º» ³í¹®¿¡¼­´Â ±×·¡ÇÁ ±â¹Ý ½ÇÇà ÆÄÀÏ ±¸Á¶ ºñ±³ ±â¹ýÀ» ±â¹ÝÀ¸·Î ÇÑ ÀÚ¹Ù ¹ö½º¸¶Å©¸¦ Á¦¾ÈÇÏ¿´´Ù. Á¦¾È ±â¹ýÀº µÎ ÇÁ·Î±×·¥ÀÇ ½ÇÇà ÆÄÀÏ¿¡¼­ ¸Þ¼Òµå È£Ãâ ±×·¡ÇÁ¿Í °¢ ¸Þ¼ÒµåÀÇ Á¦¾î È帧 ±×·¡ÇÁ¸¦ ºÐ¼®ÇÏ°í, ³ëµå ÀÚüÀÇ Á¤º¸¿Í ±×·¡ÇÁ »óÀÇ °ü°è Á¤º¸¸¦ »ç¿ëÇÏ¿© ±×·¡ÇÁ ³» °¢ ³ëµåµéÀ» ºñ±³ÇÑ´Ù. ½ÇÇèÀ» ÅëÇØ ±âÁ¸ ±â¹ýµé°ú ºñ±³ÇÏ¿© Á¦¾È ±â¹ýÀÌ ³ôÀº ½Å·Ú¼º(Credibility)°ú °­Àμº(Resilience)À» º¸ÀÓÀ» È®ÀÎÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
A software birthmark is a set of characteristics extracted from an executable program. Software birthmarks are difficult to remove by modifying the program binary code and are specific enough to distinguish from other programs. Software birthmark techniques are used to detect program theft by determining the similarity between two different programs. In this paper, we propose a software birthmark based on a graph-based structural comparison scheme. The proposed scheme analyzes the method call graph and the control flow graphs for the methods, and calculates the structural similarity of the binary codes of the two programs at the basic block level and the method level. In a comparison of two graphs, information pertaining to a node and its relationship with other nodes is used to find the most similar pair of nodes. Through experiments on Java class files, we verify the credibility and the resilience of the proposed scheme.
Å°¿öµå(Keyword) ¼ÒÇÁÆ®¿þ¾î º¸¾È   ¼ÒÇÁÆ®¿þ¾î ¹ö½º¸¶Å©   ¹ÙÀ̳ʸ® ºñ±³   Software Security   Software Birthmark   Binary Comparison  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå