Encryption Scheme Supporting Range Queries on Encrypted Privacy Databases in Big Data Service Era
Security and privacy issues are magnified by velocity, volume, and variety of big data, such as large-scale cloud infrastructures, diversity of data sources and formats, streaming nature of data acquisition and high volume inter-cloud migration. Therefore
- PDF / 216,658 Bytes
- 8 Pages / 439.37 x 666.142 pts Page_size
- 37 Downloads / 176 Views
Abstract Security and privacy issues are magnified by velocity, volume, and variety of big data, such as large-scale cloud infrastructures, diversity of data sources and formats, streaming nature of data acquisition and high volume intercloud migration. Therefore, traditional security mechanisms, which are tailored to securing small scale static (as opposed to streaming) data, are inadequate. In this paper, we proposed Bucket ID Transformation that is a new encryption mechanism and the scheme can range search without order-preserving. Bucket ID Transformation is performed by recursive HMAC as many as a value of Bucket ID. As a future desk, we plan to carry out simulated experiments for performance evaluation and compare the results, and design and verify a provably secure encryption mechanism. Keywords Big data
Encryption Range query Privacy data Security
1 Introduction When traditional encryption algorithm apply to the database, efficiency decline problem was occurred because order of encoded data are not equal to order of plaintext. To overcome this limit, Haciquimus proposed bucket based index [1] J. W. Lee Electronics and Telecommunications Research Institute (ETRI), 218 Gajeong-ro, Yuseong-gu, Daejeon 305-700, Korea e-mail: [email protected] N. Park (&) Department of Computer Education, Teachers College, Jeju National University, 61 Iljudong-ro, Jeju-si, Jeju Special Self-Governing Province 690-781, Korea e-mail: [email protected]
S.-S. Yeo et al. (eds.), Computer Science and its Applications, Lecture Notes in Electrical Engineering 203, DOI: 10.1007/978-94-007-5699-1_76, Springer Science+Business Media Dordrecht 2012
739
740
J. W. Lee and N. Park
that can bring performance improvement for queries over encrypted data. Besides, Order-Preserving Encryption scheme that is possible range queries over encrypted data without decryption was proposed by Sun [2], Agrawal [3], Ets. But, Encrypted data by Order-Preserving Encryption Scheme was exposed order of plaintext, As a result, the scheme cannot secure against inference attack. Especially, the scheme cannot used for rank scale [4–13]. Use of order-preserving function is desirable for efficiency. On the other side, obviously, order-preserving function cannot prevent the inference attack. Therefore, it needed stabilize tradeoff to solve the problem. In this paper, we proposed Bucket ID Transformation that is a new encryption mechanism and the scheme can range search without order-preserving. Bucket ID Transformation is performed by recursive HMAC as many as a value of Bucket ID.The proposed method, whose order is not exposed, has a more enhanced security than Sun and Agrawal and is also more efficient compared to Damiani’s method as it can recover the original value by transmitting queries d q n times (q: bucket size, d: number of transmitted queries of damiani, n: number of nodes) to the database.
2 Related Work 2.1 Bucket Based Index Hacigumus et al [1] proposed the technique that queries encrypted data. This is based on the definition of the
Data Loading...
