ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Address Permutation for Privacy-Preserving Searchable Symmetric Encryption
Cited 2 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
최대선, 김승현, 이윤호
발행일
201202
출처
ETRI Journal, v.34 no.1, pp.66-75
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.12.0111.0243
협약과제
11MS1600, 모바일 ID 보안 및 프라이버시를 위한 스마트 지갑 기술 개발, 진승헌
초록
This paper proposes a privacy-preserving database encryption scheme that provides access pattern hiding against a service provider. The proposed scheme uses a session key to permute indices of database records each time they are accessed. The proposed scheme can achieve access pattern hiding in situations in which an adversary cannot access the inside of the database directly, by separating the entity with an index table and data table and permuting both the index and position where the data are stored. Moreover, it is very efficient since only O(1) server computation and communication cost are required in terms of the number of the data stored. It can be applied to cloud computing, where the intermediate entities such as cloud computing service provider can violate the privacy of users or patients. © 2012 ETRI.
키워드
Access pattern, Database security, Privacy, Searchable symmetric encryption
KSP 제안 키워드
Access pattern, Cloud computing service, Communication cost, Data Table, Database Security, Database encryption, Encryption Scheme, Index table, Pattern hiding, Privacy-preserving, Service Provider