English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88668/118332 (75%)
Visitors : 23510910      Online Users : 66
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/112443
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/112443


    Title: Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption
    Authors: 左瑞麟
    Huang, Kaibin
    Tso, Ray-Lin
    Chen, Yu Chi
    Contributors: 資科系
    Keywords: Public key cryptography;Security of data;Semantic Web;Semantics;Testing;Ciphertexts;Equality tests;Searchable encryptions;Semantic security;Standard model;Cryptography
    Date: 2017-11
    Issue Date: 2017-08-31 13:48:24 (UTC+8)
    Abstract: Public key encryption with equality test (PKE-ET) is a public key encryption with an extra functionality, so-called 'equality test'. An authorized third party can verify the equivalence between two ciphertexts encrypted under different public keys, while the decryption keeps unavailable. However, the privacy of most existing PKE-ET schemes drop to one-way security owing to the 'equality test' functionality. In this work, we propose a novel architecture called filtered equality test (FET), which 'filtered' denotes only few receiver-selected messages can be equality tested. In such model, we propose an equality test scheme, PKE-FET, which is the first one to be proved (somewhat) semantic secure. The concrete PKE-FET scheme and its rigorous security proof in the standard model are proposed. Furthermore, FET is also applied to construct a searchable encryption named PE-MKS, which is inherently proved semantic secure (so called the indistinguishability against chosen keyword attacks) in the standard model.
    Relation: Journal of Computer and System Sciences, 89, 400-409
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/j.jcss.2017.06.001
    DOI: 10.1016/j.jcss.2017.06.001
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    409.pdf503KbAdobe PDF232View/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