소수테이블을 이용한 실용적인 다중 키워드 검색가능 암호시스템

Abstract

ABSTRACT Searchable encryption systems provide search on encrypted data while preserving the privacy of the data and the search keywords used in queries. Recently, interest on data outsourcin g has increased due to proliferation of cloud computing service s. Many researches are on going to minimize the trust put on exter nal servers and searchable encryption is one of them. However, most of previous searchable encryption schemes provide only a single keyword boolean search. Although, there have been proposals to provide conjunctive keyword search, most of t hese works use a fixed field which limit their application. In this paper, we propose a field-free conjunctive keyword searcha ble encryption that also provides rank information of search results. Our system uses prime tables and greatest common divisor operation, making our system very efficient. Moreover, our system is practical and can be implemented very easily since it does not require sophisticated cryptographic module. Keywords: searchable encryption, conjunctive keyword search, rank, prim e table접수일(2013년 7월 5일), 수정일(2013년 11월 19일), 게재확정일(2013년 12월 3일)†주저자, sunyujin@koreatech.ac.kr‡교신저자, sangjin@koreatech.ac.kr (Corresponding author)