ISCAS OpenIR
multi-user private keyword search for cloud computing
Yang Yanjiang; Lu Haibing; Weng Jian
2011
Conference Name2011 3rd IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2011
SourceProceedings - 2011 3rd IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2011
Pages264-271
Conference DateNovember 29, 2011 - December 1, 2011
Conference PlaceAthens, Greece
Indexed TypeEI
ISBN9780769546223
Department(1) Institute for Infocomm Research Singapore Singapore; (2) Dept. of Operations Management and Information Systems Leavey School of Business Santa Clara University United States; (3) Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University Guangzhou China; (4) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China; (5) State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications China
English AbstractEnterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities. © 2011 IEEE.; Enterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities. © 2011 IEEE.
KeywordCloud Computing Data Privacy Database Systems Industry Outsourcing Search Engines
SponsorshipUniversity of Piraeus, Department of Digital Systems; OpenGridForum; IEEE; IEEE Computer Society; Cloud Computing Society; Univ. Aegean, Dep. Inf. Commun. Syst. Eng.
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/16304
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Yang Yanjiang,Lu Haibing,Weng Jian. multi-user private keyword search for cloud computing[C],2011:264-271.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yang Yanjiang]'s Articles
[Lu Haibing]'s Articles
[Weng Jian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yang Yanjiang]'s Articles
[Lu Haibing]'s Articles
[Weng Jian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yang Yanjiang]'s Articles
[Lu Haibing]'s Articles
[Weng Jian]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.