상세정보
학술대회
How to Construct a New Encryption Scheme Supporting Range Queries on Encrypted Database
- 발행일
- 200711
- 출처
- International Conference on Convergence Information Technology (ICCIT) 2007, pp.1402-1407
- 협약과제
- 07MK2500, 개인정보 DB를 위한 통합형 보안 기술 개발, 남택용
- 초록
- When the traditional encryption algorithms are applied to the database, efficiency degradation occurs because the orders of ciphertext and plaintext are not the same. Therefore, the encryption mechanisms suitable for database environment are required. We propose an encryption mechanism that can support range queries without exposing the order of plaintext. This method is more powerful than the previous order-preserving methods and is expected to handle data more efficiently than other methods including auxiliary B+-tree. © 2007 IEEE.
- KSP 제안 키워드
- B+-tree, Encrypted Database, Encryption Scheme, Encryption algorithm, Encryption mechanisms, Order-preserving, Range queries