1. NCCU Academic Hub
  2. 學術產出
  3. 資訊學院
  4. 期刊論文
  5. Item

學術產出-期刊論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 Private Predicate Encryption for Inner Product from Key-Homomorphic Pseudorandom Function
作者 左瑞麟; 曾一凡
Tso, Raylin; Tseng, Yi-Fan; Liu, Zi-Yuan; Hsu,  Jen-Chieh
貢獻者 資科系
日期 2021-02
上傳時間 23-十二月-2021 15:39:27 (UTC+8)
摘要 Predicate encryption (PE), formalized by Katz et al., is a new paradigm of public-key encryption that conceptually captures the public-key encryption that supports fine-grained access control policy. Because of the nature of PE, it is used for cloud storage so that users can retrieve encrypted data without revealing any information about the data to cloud servers and other users. Although lots of PE schemes have been studied, the predicate-hiding security is seldom considered; that is, the user’s secret key may leak sensitive information of the predicate. Additionally, the security of the current predicate-hiding PE schemes relies on the discrete logarithm assumption which cannot resist the quantum attacks in the future. In this paper, we propose a generic PE for inner product under symmetric-key setting, called private IPE, from specific key-homomorphic pseudorandom function (PRF). The rigorous proofs are provided to show that the construction is payload-hiding, attribute-hiding, and predicate-hiding secure. With the advantage of the generic construction, if the underlying PRF can resist quantum attacks, then, through our proposed generic construction, a quantum-resistant private IPE can be obtained.
關聯 Security and Communication Networks, Vol.2021, pp.1-12
資料類型 article
DOI https://doi.org/10.1155/2021/6678194
dc.contributor 資科系-
dc.creator (作者) 左瑞麟; 曾一凡-
dc.creator (作者) Tso, Raylin; Tseng, Yi-Fan; Liu, Zi-Yuan; Hsu,  Jen-Chieh-
dc.date (日期) 2021-02-
dc.date.accessioned 23-十二月-2021 15:39:27 (UTC+8)-
dc.date.available 23-十二月-2021 15:39:27 (UTC+8)-
dc.date.issued (上傳時間) 23-十二月-2021 15:39:27 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/138319-
dc.description.abstract (摘要) Predicate encryption (PE), formalized by Katz et al., is a new paradigm of public-key encryption that conceptually captures the public-key encryption that supports fine-grained access control policy. Because of the nature of PE, it is used for cloud storage so that users can retrieve encrypted data without revealing any information about the data to cloud servers and other users. Although lots of PE schemes have been studied, the predicate-hiding security is seldom considered; that is, the user’s secret key may leak sensitive information of the predicate. Additionally, the security of the current predicate-hiding PE schemes relies on the discrete logarithm assumption which cannot resist the quantum attacks in the future. In this paper, we propose a generic PE for inner product under symmetric-key setting, called private IPE, from specific key-homomorphic pseudorandom function (PRF). The rigorous proofs are provided to show that the construction is payload-hiding, attribute-hiding, and predicate-hiding secure. With the advantage of the generic construction, if the underlying PRF can resist quantum attacks, then, through our proposed generic construction, a quantum-resistant private IPE can be obtained.-
dc.format.extent 1474436 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) Security and Communication Networks, Vol.2021, pp.1-12-
dc.title (題名) Private Predicate Encryption for Inner Product from Key-Homomorphic Pseudorandom Function-
dc.type (資料類型) article-
dc.identifier.doi (DOI) 10.1155/2021/6678194-
dc.doi.uri (DOI) https://doi.org/10.1155/2021/6678194-