Publications-Proceedings
Article View/Open
Publication Export
Google ScholarTM
NCCU Library
Citation Infomation
-
Loading...Loading...
Related Publications in TAIR
| Title | Practical Predicate Encryption for Inner Product |
| Creator | 左瑞麟; 曾一凡 Tso, Raylin; Tseng, Yi-Fan Liu, Zi-Yuan |
| Contributor | 資科系 |
| Key Words | Predicate Encryption ; Inner Product Encryption ; Constant-size Private Key ; Efficient Decryption ; Constant Pairing Computations |
| Date | 2020-07 |
| Date Issued | 9-Dec-2021 16:10:21 (UTC+8) |
| Summary | Inner product encryption is a powerful cryptographic primitive, where a private key and a ciphertext are both associated with a predicate vector and an attribute vector, respectively. A successful decryption requires the inner product of the predicate vector and the attribute vector to be zero. Most of the existing inner product encryption schemes suffer either long private key or heavy decryption cost. In this manuscript, an efficient inner product encryption is proposed. The length for a private key is only an element in G and an element in Zp. Besides, only one pairing computation is needed for decryption. Moreover, both formal security proof and implementation result are demonstrated in this manuscript. To the best of our knowledge, our scheme is the most efficient one in terms of the private key length and the number of pairings computation for decryption. |
| Relation | Proceedings of Secrypt 2020, Fordham University, pp.553-558 |
| Type | conference |
| DOI | https://doi.org/10.5220/0009804605530558 |
| dc.contributor | 資科系 | - |
| dc.creator (作者) | 左瑞麟; 曾一凡 | - |
| dc.creator (作者) | Tso, Raylin; Tseng, Yi-Fan | - |
| dc.creator (作者) | Liu, Zi-Yuan | - |
| dc.date (日期) | 2020-07 | - |
| dc.date.accessioned | 9-Dec-2021 16:10:21 (UTC+8) | - |
| dc.date.available | 9-Dec-2021 16:10:21 (UTC+8) | - |
| dc.date.issued (上傳時間) | 9-Dec-2021 16:10:21 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/138289 | - |
| dc.description.abstract (摘要) | Inner product encryption is a powerful cryptographic primitive, where a private key and a ciphertext are both associated with a predicate vector and an attribute vector, respectively. A successful decryption requires the inner product of the predicate vector and the attribute vector to be zero. Most of the existing inner product encryption schemes suffer either long private key or heavy decryption cost. In this manuscript, an efficient inner product encryption is proposed. The length for a private key is only an element in G and an element in Zp. Besides, only one pairing computation is needed for decryption. Moreover, both formal security proof and implementation result are demonstrated in this manuscript. To the best of our knowledge, our scheme is the most efficient one in terms of the private key length and the number of pairings computation for decryption. | - |
| dc.format.extent | 188614 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Proceedings of Secrypt 2020, Fordham University, pp.553-558 | - |
| dc.subject (關鍵詞) | Predicate Encryption ; Inner Product Encryption ; Constant-size Private Key ; Efficient Decryption ; Constant Pairing Computations | - |
| dc.title (題名) | Practical Predicate Encryption for Inner Product | - |
| dc.type (資料類型) | conference | - |
| dc.identifier.doi (DOI) | 10.5220/0009804605530558 | - |
| dc.doi.uri (DOI) | https://doi.org/10.5220/0009804605530558 | - |