The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
SSE(검색 가능한 대칭 암호화) 방식은 암호화된 데이터를 복호화하지 않고 검색하는 방법입니다. 본 논문에서는 부분 문자열 검색 문제를 해결합니다. D 문서와 패턴의 p, 우리는 모든 발생을 찾습니다 p in D. 여기서는 문서와 패턴을 문자열로 정의합니다. 결정론적 유한 자동장치인 방향성 비순환 단어 그래프(DAWG)는 일반 텍스트에서 부분 문자열 검색 문제를 해결하는 것으로 알려져 있습니다. DAWG의 모든 전환이 고유한 기호를 갖도록 DAWG를 개선합니다. 또한 향상된 DAWG를 사용하여 공간 효율적이고 안전한 하위 문자열 SSE 체계를 제시합니다. 제안하는 부분 문자열 SSE 방식은 간단한 구조의 인덱스로 구성되며 크기는 O(n) 전체 크기 n 문서의.
Hiroaki YAMAMOTO
Shinshu University
Ryosuke ODA
Shinshu University
Yoshihiro WACHI
NTT COMWARE CORPORATION
Hiroshi FUJIWARA
Shinshu University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Hiroaki YAMAMOTO, Ryosuke ODA, Yoshihiro WACHI, Hiroshi FUJIWARA, "Substring Searchable Symmetric Encryption Based on an Improved DAWG" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 12, pp. 1578-1590, December 2022, doi: 10.1587/transfun.2021EAP1122.
Abstract: A searchable symmetric encryption (SSE) scheme is a method that searches encrypted data without decrypting it. In this paper, we address the substring search problem such that for a set D of documents and a pattern p, we find all occurrences of p in D. Here, a document and a pattern are defined as a string. A directed acyclic word graph (DAWG), which is a deterministic finite automaton, is known for solving a substring search problem on a plaintext. We improve a DAWG so that all transitions of a DAWG have distinct symbols. Besides, we present a space-efficient and secure substring SSE scheme using an improved DAWG. The proposed substring SSE scheme consists of an index with a simple structure, and the size is O(n) for the total size n of documents.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021EAP1122/_p
부
@ARTICLE{e105-a_12_1578,
author={Hiroaki YAMAMOTO, Ryosuke ODA, Yoshihiro WACHI, Hiroshi FUJIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Substring Searchable Symmetric Encryption Based on an Improved DAWG},
year={2022},
volume={E105-A},
number={12},
pages={1578-1590},
abstract={A searchable symmetric encryption (SSE) scheme is a method that searches encrypted data without decrypting it. In this paper, we address the substring search problem such that for a set D of documents and a pattern p, we find all occurrences of p in D. Here, a document and a pattern are defined as a string. A directed acyclic word graph (DAWG), which is a deterministic finite automaton, is known for solving a substring search problem on a plaintext. We improve a DAWG so that all transitions of a DAWG have distinct symbols. Besides, we present a space-efficient and secure substring SSE scheme using an improved DAWG. The proposed substring SSE scheme consists of an index with a simple structure, and the size is O(n) for the total size n of documents.},
keywords={},
doi={10.1587/transfun.2021EAP1122},
ISSN={1745-1337},
month={December},}
부
TY - JOUR
TI - Substring Searchable Symmetric Encryption Based on an Improved DAWG
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1578
EP - 1590
AU - Hiroaki YAMAMOTO
AU - Ryosuke ODA
AU - Yoshihiro WACHI
AU - Hiroshi FUJIWARA
PY - 2022
DO - 10.1587/transfun.2021EAP1122
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2022
AB - A searchable symmetric encryption (SSE) scheme is a method that searches encrypted data without decrypting it. In this paper, we address the substring search problem such that for a set D of documents and a pattern p, we find all occurrences of p in D. Here, a document and a pattern are defined as a string. A directed acyclic word graph (DAWG), which is a deterministic finite automaton, is known for solving a substring search problem on a plaintext. We improve a DAWG so that all transitions of a DAWG have distinct symbols. Besides, we present a space-efficient and secure substring SSE scheme using an improved DAWG. The proposed substring SSE scheme consists of an index with a simple structure, and the size is O(n) for the total size n of documents.
ER -