PKIS: practical keyword index search on cloud datacenter

EURASIP Journal on Wireless Communications and Networking - 2011
Hyun A. Park1, Jae Hyun Park2, Dong Hoon Lee1
1Graduate School of Information and Security, Korea University, 5-Ka, Anam-dong, Sungbuk-ku, Seoul, 136-701, Korea
2Department of Information Systems, Weatherhead School of Management, Case Western Reserve University, 10900 Euclid Avenue, Cleveland, OH, 44106, USA

Tóm tắt

Abstract This paper highlights the importance of the interoperability of the encrypted DB in terms of the characteristics of DB and efficient schemes. Although most prior researches have developed efficient algorithms under the provable security, they do not focus on the interoperability of the encrypted DB. In order to address this lack of practical aspects, we conduct two practical approaches--efficiency and group search in cloud datacenter. The process of this paper is as follows: first, we create two schemes of efficiency and group search--practical keyword index search--I and II; second, we define and analyze group search secrecy and keyword index search privacy in our schemes; third, we experiment on efficient performances over our proposed encrypted DB. As the result, we summarize two major results: (1)our proposed schemes can support a secure group search without re-encrypting all documents under the group-key update and (2)our experiments represent that our scheme is approximately 935 times faster than Golle's scheme and about 16 times faster than Song's scheme for 10,000 documents. Based on our experiments and results, this paper has the following contributions: (1) in the current cloud computing environments, our schemes provide practical, realistic, and secure solutions over the encrypted DB and (2) this paper identifies the importance of interoperability with database management system for designing efficient schemes.

Từ khóa


Tài liệu tham khảo

Armbrust M, Fox A, Griffith R, Joseph AD, Katz RH, Konwinski A, Lee G: Above the clouds: a Berkeley view of cloud computing. Technical Report: EECS-2009-28 2009.

Buyya R: Market-oriented cloud computing: vision, hype, and reality of delivering computing as the 5th utility. 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, ccgrid 2009, 1.

Park H, Byun J, Lee D: Secure index search for groups. TrustBus 2005, LNCS3592 2005, 128-140.

Wang P, Wang H, Pieprzyk J: Threshold privacy preserving key word searches. SOFSEM 2008, LNCS 4910 2008, 646-658.

Song D, Wagner D, Perrig A: Practical techniques for searches on encrypted data. IEEE Symposium on Security and Privacy 2000, 44-55.

Boneh D, Crescenzo GD, Ostrovsky R, Persiano G: Public-key encryption with keyword search. Eurocrypt04, LNCS 3027 2004, 506-522.

Chang YC, Mitzenmacher M: Privacy preserving keyword searches on remote encrypted data. Cryptology (ePrint Archive) 2004.

Goh E: Secure indexes. Cryptology (ePrint Archive) 2004.

Waters B, Balfanz D, Durfee G, Smetters D: Building an encrypted and searchable audit log. NDSS04, The Internet Society 2004, 205-214.

Byun J, Rhee H, Park H, Lee D: "Off-Line Keyword Guessing Attacks on Recent KeywordSearch Schemes over Encrypted Data". SDM2006, Lecture Notes in Computer Science 4165 2006, 75-83.

Boneh D, Waters B: Conjunctive, subset, and range queries on encrypted data. Proceedings of TCC 07 2007.

Hacigumus H, Iyer B, Mehrotra S: Efficient execution of aggregation queries over encrypted relational databases. DASFAA 2004, LNCS 2793 2004, 125-136.

Golle P, Staddon J, Waters B: Secure conjunctive keyword search over encrypted data. ACNS04, LNCS 3089 2004, 31-45.

Hwang Y, Lee P: Public key encryption with conjunctive keyword search and its extension to a multi-user system. Pairing 2007, LNCS 4575 2007, 2-22.

Wang P, Wang H, Pieprzyk J: Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups. CANS 2008, LNCS 2008.

Zerr S, Demidova E, Olmedilla D, Nejdl W, Winslett M, Mitra S: Zerber: r-confidential indexing for distributed documents. EDBT'08: Proceedings of the 11th international conference on Extending database technology 2008, 287-298.

Zerr S, Olmedilla D, Nejdl W, Siberski W: Zerber+R: top-k retrieval from a confidential index. EDBT '09: Proc. of the 12th International Conference on Extending Database Technology: Advances in Database Technology 2009, 439-449.

Pang H, Ding X, Xiao X: Embellishing text search queries to protect user privacy. PVLDB 3(1) 2010, 598-607.

Swaminathan A, Mao Y, Su G-M, Gou H, Varna A, He S, Wu M, Oard D: Confidentiality-preserving rank-ordered search. Storage SS'07, in Proc. of the 2007 ACM workshop on Storage security and survivability 2007, 7-12.

Wang C, Cao N, Li J, Ren K, Lou W: Secure ranked keyword search over encrypted cloud data. ICDCS'10, in Proc. of the 2010 IEEE 30th International Conference on Distributed Computing Systems 2010, 253-262.

Cao N, Wang C, Li M, Ren K, Lou W: Privacy-preserving multikeyword ranked search over encrypted cloud data. IEEE INFOCOM 2011.

Li M, Yu S, Cao N, Lou W: Authorized private keyword search over encrypted data in cloud computing. Proc of IEEE ICDCS'11 2011.

Yu S, Wang C, Ren K, Lou W: "Achieving secure, scalable, and fine-grained data access control in cloud computing. IEEE INFOCOM'10 2010.

Hu Y, Perrig A, Johnson DB: Efficient security mechanisms for routing protocols. Network and Distributed System Security Symposium, NDSS'03 2003, 57-73.

Burrnester M, Desmedt Y: A secure and efficient conference key distribution system. The Advances in Cryptology--EUROCRYPT 1994.

Kim Y, Perrig A, Tsudik G: Tree-based group key agreement. ACM Trans Inf Syst Secur 2004, 7(1):60-96. 10.1145/984334.984337

Liao L, Manulis M: Tree-based group key agreement framework for mobile ad-hoc networks. Fut Gener Comput Syst 2007, 23(6):787-803. 10.1016/j.future.2007.01.001

Burmester M, Desmedt Y, Wright RN, Yasinsac A: Accountable Privacy. Security Protocols 2004, LNCS 3957 2006, 83-95.

Ontario: Office of the Information and Privacy Commissioner (IPC)and Netherlands Registratiekamer. Privacy-Enhancing Technologies: The Path to Anonymity, Information and Privacy Commissioner and Registratiekamer 1995. [http://www.ipc.on.ca/english/Resources/Discussion-Papers/Discussion-Papers-Summary/Default.aspx?id=329%26print=1]

Park H, Kim B, Lee D, Chung Y, Zhan J: Secure similarity search. In Grc 2007. IEEE ComputerSociety Press; 2007:598-604.

[http://blogs.msdn.com/msdnts/archive/2006/12/01/row-size-limitation-in-sql-2000-and-2005.aspx]

Abdalla M, Bellare M, Catalano D, Kiltz E, Kohno T, Lange T, Malone-Lee J, Neven G, Paillier P, Ashi H: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. Crypto05, LNCS 3621 2005, 205-222.

Bellovin S, Cheswick W: Privacy-enhanced searches using encrypted bloom filters. Cryptology ePrint Archive, R eport2004/022 2004.

Ballard L, Green M, de Medeiros B, Monrose F: Correlation-resistant storage via keyword-searchable encryption. SPAR Technical Report TR-SP-BGMM-050705

Ballad L, Kamara S, Monrose F: Achieving efficient conjunctive keyword searches over encrypted data. ICICS 2005, LNCS3783 2005, 414-426.

Ogata W, Kurosawa K: Oblivious keyword search. J Complexity 2004, 20: 356-371. 10.1016/j.jco.2003.08.023

Park H, Hong J, Park J, Zhan J, Lee D: Combined authentication based multi-level access control in mobile application for DailyLifeService. IEEE Trans Mobile Comput 2010, 9(6):824-837.

Park H, Park J, Choi J, Lee D: Toward an integrated system between cloud computing and smartcard application. In ICCIT 2010. IEEE Computer Society Press; 2010:580-587.

Thông tin
Thông tin xuất bản

EURASIP Journal on Wireless Communications and Networking

Thông tin tác giả