透過您的圖書館登入
IP:3.135.246.193
  • 學位論文

適地性系統的資料外包安全性研究

SUDO: A Secure Database Outsourcing Solution for Location-based Systems

指導教授 : 陳伶志
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


Location-based systems (LBS) represent an emerging genre of applications that exploit positioning technologies and facilitate a wide range of location-based services. Unlike conventional information systems, LBS data management is challenging because LBS data is high dimensional and spatio-temporal in nature, and information leakage may result in location related privacy crises. The issue has become even more complicated, as database outsourcing has become inevitable in view of the emerging popularity of LBS deployment. In this paper, we tackle the research challenge and propose a SecUre Database Outsourcing system, called SUDO. By combining the techniques of Hilbert space-filling curves, different invertible encryption algorithms, and genuine mixed data, we show that SUDO is capable of preserving location privacy and ownership of data for LBS against different attacks. Moreover, the proposed solution is simple, effective, and scalable; and it shows promise in supporting LBS data management with outsourced databases.

並列摘要


Location-based systems (LBS) represent an emerging genre of applications that exploit positioning technologies and facilitate a wide range of location-based services. Unlike conventional information systems, LBS data management is challenging because LBS data is high dimensional and spatio-temporal in nature, and information leakage may result in location related privacy crises. The issue has become even more complicated, as database outsourcing has become inevitable in view of the emerging popularity of LBS deployment. In this paper, we tackle the research challenge and propose a SecUre Database Outsourcing system, called SUDO. By combining the techniques of Hilbert space-filling curves, different invertible encryption algorithms, and genuine mixed data, we show that SUDO is capable of preserving location privacy and ownership of data for LBS against different attacks. Moreover, the proposed solution is simple, effective, and scalable; and it shows promise in supporting LBS data management with outsourced databases.

參考文獻


[1] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Order-preserving encryption for numeric data. In ACM SIGMOD, 2004.
[2] R. Bayer and E. McCreight. Organization and maintenance of large ordered indices. In Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control (SIGFIDET ’70), pages 107–141, New
York, NY, USA, 1970. ACM.
[3] R. Bayer and K. Unterauer. Prefix b-trees. ACM Trans. Database Syst., 2(1): 11–26, Mar. 1977.
[4] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. SIGMOD Rec., 19(2):322–331, May 1990.

延伸閱讀