English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88613/118155 (75%)
Visitors : 23493757      Online Users : 341
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/111670
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/111670


    Title: A shareable keyword search over encrypted data in cloud computing
    Authors: 左瑞麟
    Xu, Li
    Weng, Chi-Yao
    Yuan, Lun-Pin
    Wu, Mu-En
    Tso, Raylin
    Sun, Hung-Min
    Contributors: 資科系
    Keywords: Access control;Cloud computing;Cryptography;Data privacy;Search engines;Cloud computing environments;Cloud storages;ID-based encryption;Keyword search;Original structures;Performance analysis;Searchable encryptions;Searching ability;Digital storage
    Date: 2015-09
    Issue Date: 2017-08-08 16:40:24 (UTC+8)
    Abstract: Cloud storage is one of the most important applications in our daily lives. User can store their own data into cloud storage and remotely access the saved data. Owing to the social media develops, users can share the digital files to other users, leading to the amount of data growing rapidly and searching abilities necessarily. In the some cases, servers cannot avoid data leakage even if the server provides complete access control. The encrypted data is a best way to resolve this problem but it may eliminate original structure and searching may become impossible. Applying searchable encryption for each receiver may produce messy duplication and occupy the quota of cloud storage from each receiver. User requires keeping their shared documents belonging up to date which are compared with the latest version. To this aim, we thus propose a sharable ID-based encryption with keyword search in cloud computing environment, which enables users to search in data owners’ shared storage while preserving privacy of data. For the performance analysis, we demonstrate the compared resultant with others ID-based or ID-relative encryption. In addition to that, we show the formal proof to verify the security of our proposed. © 2015 Springer Science+Business Media New York
    Relation: Journal of Supercomputing
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1007/s11227-015-1515-8
    DOI: 10.1007/s11227-015-1515-8
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    s11227-015-1515-8.pdf1049KbAdobe PDF124View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback