Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ÄÄÇ»ÅÍ ¹× Åë½Å½Ã½ºÅÛ
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
Ŭ¶ó¿ìµå ÄÄÇ»Æÿ¡¼ ÇÁ¶óÀ̹ö½Ã º¸È£¸¦ Áö¿øÇÏ´Â µ¥ÀÌÅÍ ÇÊÅ͸µ ±â¹Ý º´·Ä ¿µ¿ª ÁúÀÇ Ã³¸® ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Privacy-Preserving Parallel Range Query Processing Algorithm Based on Data Filtering in Cloud Computing |
ÀúÀÚ(Author) |
±èÇüÁø
ÀåÀç¿ì
Hyeong Jin Kim
Jae-Woo Chang
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 10 NO. 09 PP. 0243 ~ 0250 (2021. 09) |
Çѱ۳»¿ë (Korean Abstract) |
Ãֱ٠Ŭ¶ó¿ìµå ÄÄÇ»ÆÃÀÌ ¹ßÀüÇÔ¿¡ µû¶ó µ¥ÀÌÅͺ£À̽º ¾Æ¿ô¼Ò½Ì¿¡ ´ëÇÑ °ü½ÉÀÌ Áõ°¡ÇÏ°í ÀÖ´Ù. ±×·¯³ª µ¥ÀÌÅͺ£À̽º¸¦ ¾Æ¿ô¼Ò½ÌÇÏ´Â °æ¿ì, µ¥ÀÌÅÍ ¼ÒÀ¯ÀÚÀÇ Á¤º¸°¡ ³»ºÎ ¹× ¿ÜºÎ °ø°ÝÀÚ¿¡°Ô ³ëÃâµÇ´Â ¹®Á¦Á¡À» Áö´Ñ´Ù. µû¶ó¼ º» ³í¹®¿¡¼´Â ÇÁ¶óÀ̹ö½Ã º¸È£¸¦ Áö¿øÇÏ´Â º´·Ä ¿µ¿ª ÁúÀÇó¸® ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀº Paillier ¾ÏÈ£È ½Ã½ºÅÛÀ» »ç¿ëÇÏ¿© µ¥ÀÌÅÍ º¸È£, ÁúÀÇ º¸È£, Á¢±Ù ÆÐÅÏ º¸È£¸¦ Áö¿øÇÑ´Ù. ¶ÇÇÑ ±âÁ¸ ¾Ë°í¸®Áò¿¡¼ ¿µ¿ª °ãħÀ» È®ÀÎÇÏ´Â ÇÁ·ÎÅäÄÝ(SRO)ÀÇ ¿¬»ê ºñ¿ëÀ» ÁÙÀ̱â À§ÇØ garbled ¼Å¶(circuit) À» ÅëÇØ SRO ÇÁ·ÎÅäÄÝÀÇ È¿À²¼ºÀ» Çâ»ó½ÃŲ´Ù. Á¦¾ÈÇÏ´Â º´·Ä ¿µ¿ª ÁúÀÇ Ã³¸® ¾Ë°í¸®ÁòÀº Å©°Ô 2´Ü°è·Î ±¸¼ºµÈ´Ù. ÀÌ´Â kd-Æ®¸®¸¦ º´·ÄÀûÀ¸·Î Ž»öÇÏ°í ÁúÀǸ¦ Æ÷ÇÔÇÏ´Â ´Ü¸» ³ëµåÀÇ µ¥ÀÌÅ͸¦ ¾ÈÀüÇÏ°Ô ÃßÃâÇÏ´Â º´·Ä kd-Æ®¸® Ž»ö ´Ü°è¿Í ´Ù¼öÀÇ thread¸¦ ÅëÇØ ÁúÀÇ ¿µ¿ª¿¡ Æ÷ÇÔµÈ µ¥ÀÌÅ͸¦ º´·Ä Ž»öÇÏ´Â º´·Ä µ¥ÀÌÅÍ Å½»ö ´Ü°è·Î ±¸¼ºµÈ´Ù. ÇÑÆí, Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀº ¾ÏÈ£È ¿¬»ê ÇÁ·ÎÅäÄÝ°ú À妽º Ž»öÀÇ º´·Äȸ¦ ÅëÇØ ¿ì¼öÇÑ ÁúÀÇ Ã³¸® ¼º´ÉÀ» Á¦°øÇÑ´Ù. Á¦¾ÈÇÏ´Â º´·Ä ¿µ¿ª ÁúÀÇ Ã³¸® ¾Ë°í¸®ÁòÀº thread ¼ö¿¡ ºñ·ÊÇÏ¿© ¼º´ÉÀÌ Çâ»óµÊÀ» ¾Ë ¼ö ÀÖ°í 10 thread »ó¿¡¼ ±âÁ¸ ±â¹ýÀº 38ÃÊ, Á¦¾ÈÇÏ´Â ±â¹ýÀº 11ÃÊ·Î ¾à 3.4¹èÀÇ ¼º´É Çâ»óÀÌ ÀÖÀ½À» º¸ÀδÙ. |
¿µ¹®³»¿ë (English Abstract) |
Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm. |
Å°¿öµå(Keyword) |
ÇÁ¶óÀ̹ö½Ã º¸È£
Ŭ¶ó¿ìµå ÄÄÇ»ÆÃ
¿µ¿ª ÁúÀÇ Ã³¸®
Paillier ¾ÏÈ£È ½Ã½ºÅÛ
º´·ÄÈ
Garbled Circuit
Privacy-preserving
Cloud Computing
Range Query Processing
Paillier Cryptosystem
Parallelism
Garbled Circuit
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|