Earticle

초록

영어

Because of the development of network and computing technology, cloud computing systems, which remotely store data in a third place and retrieves and processes these data with diverse terminals anytime and anywhere, have attracted considerable research attention. If an individual’s sensitive information or information about his/her body is stored as data stored in a cloud with remote storage without encryption, then an attacker or unethical server manager can access these stored data without the permission of the data owner. This is a security problem. Therefore, data stored using remote storage, need to be encrypted. However, in the case of data encrypted using a general encryption algorithm, since the entire set of encrypted data is downloaded to the data owner’s terminal for a safe search and has to be decrypted for the search, the advantages of remote storage are nullified. To solve this problem, searchable encryption systems have been developed. With a searchable encryption system, encrypted data can be searched safely without the process of decryption. This scheme safely stores the index that can search data and enables search with no information spill. However, the existing scheme, which is available for search, produces the same form of trapdoor for multiple searches of a keyword. A number of queries are transferred to the cloud, and the storage manager infers the keyword through these queries. The fact that the information user searches and the searched data content can be figured out through the queries poses a significant problem. Therefore, this research paper suggests a safe scheme for data management by using a one-time trapdoor so that an unethical server manager or attacker cannot infer the content of the search and the data through the queries when the same user searches the same keyword. This is possible because different trapdoors are produced when the same user searches the same keyword.

목차

Abstract
 1. Introduction
 2. Existing Scheme
  2.1. Proxy re-encryption with Keyword Search (PRES)
  2.2. Proxy Re-encryption with Private Searching (PRPS)
 3. Preliminaries
  3.1. Bilinear Maps
  3.2. Security Requirement
 4. Proposed Scheme
  4.1. Notation
  4.2. Definition
  4.3. Data Storage Phase
  4.4. Data Search Phase
  4.5. Data Sharing Phase
 5. Analysis of Proposed Scheme
 6. Conclusion
 Acknowledgments
 References

키워드

저자

• Sun-Ho Lee [ Department of Computer Software Engineering, Soonchunhyang University ]
• Im-Yeong Lee [ Department of Computer Software Engineering, Soonchunhyang University ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605