政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/111905

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113822/144841 (79%)
Visitors : 51838841 Online Users : 364

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 > Item 140.119/111905

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/111905

Title:	Efficient public key encryption with user-friendly keywords search for searchable cloud storage
Authors:	左瑞麟 Chen, Kuo-Chang Chen, Yu-Chi Horng, Gwoboa Tso, Raylin
Contributors:	資訊科學系
Keywords:	Cryptography;Digital storage;Intelligent control;Intelligent systems;Mobile security;Search engines;Security of data;Cloud storages;Keyword search;Searchable encryptions;security;trapdoor;Public key cryptography
Date:	2015
Issue Date:	2017-08-10 15:16:56 (UTC+8)
Abstract:	Protecting private data becomes very important in communication with the widespread adoption of the cloud storage system; for example, Dropbox, SkyDrive and iCloud. A user should be able to access his private data from cloud, and efficiently retrieves data which he wants. In fact, a straightforward solution to protecting user`s private data is encryption. Relying on keyword search over the encrypted data is very useful and efficient to retrieve from the untrusted cloud storage. In this scenario, a sender can send encrypted data, and the receiver can generate trapdoors from keywords to retrieve those data which include the keywords. Recently, Zhang and Zhang proposed a field-free public key encryption with user-friendly keywords search. In this paper, we present a searchable public key encryption with user-friendly keywords search. The proposed scheme is secure based on secret sharing and the hardness of discrete logarithm problem. It is more efficient than Zhang and Zhang`s scheme on computation. Moreover, we also analyze that this scheme satisfies some properties, which is suitable to data deliver/retrieval in cloud storage. © 2015 The authors and IOS Press. All rights reserved.
Relation:	Frontiers in Artificial Intelligence and Applications, 274, 724-733 International Computer Symposium, ICS 2014; Taichung; Taiwan; 12 December 2014 到 14 December 2014; 代碼 111725
Data Type:	conference
DOI 連結:	http://dx.doi.org/10.3233/978-1-61499-484-8-724
DOI:	10.3233/978-1-61499-484-8-724
Appears in Collections:	[資訊科學系] 會議論文

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML2	673	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - Feedback