Publications-Periodical Articles
Article View/Open
Publication Export
Google ScholarTM
NCCU Library
Citation Infomation
-
Loading...Loading...
Related Publications in TAIR
| Title | Practical Inner Product Encryption with Constant Private Key |
| Creator | 曾一凡 Tseng, Yi-Fan Liu, Zi-Yuan Tso, Raylin |
| Contributor | 資科系 |
| Date | 2020-12 |
| Date Issued | 27-Oct-2021 10:58:30 (UTC+8) |
| Summary | Inner product encryption, first introduced by Katz et al., is a type of predicate encryption in which a ciphertext and a private key correspond to an attribute vector and a predicate vector, respectively. Only if the attribute and predicate vectors satisfy the inner product predicate will the decryption in this scheme be correct. In addition, the ability to use inner product encryption as an underlying building block to construct other useful cryptographic primitives has been demonstrated in the context of anonymous identity-based encryption and hidden vector encryption. However, the computing cost and communication cost of performing inner product encryption are very high at present. To resolve this problem, we introduce an efficient inner product encryption approach in this work. Specifically, the size of the private key is only one G element and one Zp element, and decryption requires only one pairing computation. The formal security proof and implementation result are also demonstrated. Compared with other state-of-the-art schemes, our scheme is the most efficient in terms of the number of pairing computations for decryption and the private key length. |
| Relation | Applied Sciences, Vol.10, No.23, 8669 |
| Type | article |
| DOI | https://doi.org/10.3390/app10238669 |
| dc.contributor | 資科系 | - |
| dc.creator (作者) | 曾一凡 | - |
| dc.creator (作者) | Tseng, Yi-Fan | - |
| dc.creator (作者) | Liu, Zi-Yuan | - |
| dc.creator (作者) | Tso, Raylin | - |
| dc.date (日期) | 2020-12 | - |
| dc.date.accessioned | 27-Oct-2021 10:58:30 (UTC+8) | - |
| dc.date.available | 27-Oct-2021 10:58:30 (UTC+8) | - |
| dc.date.issued (上傳時間) | 27-Oct-2021 10:58:30 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/137554 | - |
| dc.description.abstract (摘要) | Inner product encryption, first introduced by Katz et al., is a type of predicate encryption in which a ciphertext and a private key correspond to an attribute vector and a predicate vector, respectively. Only if the attribute and predicate vectors satisfy the inner product predicate will the decryption in this scheme be correct. In addition, the ability to use inner product encryption as an underlying building block to construct other useful cryptographic primitives has been demonstrated in the context of anonymous identity-based encryption and hidden vector encryption. However, the computing cost and communication cost of performing inner product encryption are very high at present. To resolve this problem, we introduce an efficient inner product encryption approach in this work. Specifically, the size of the private key is only one G element and one Zp element, and decryption requires only one pairing computation. The formal security proof and implementation result are also demonstrated. Compared with other state-of-the-art schemes, our scheme is the most efficient in terms of the number of pairing computations for decryption and the private key length. | - |
| dc.format.extent | 343760 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Applied Sciences, Vol.10, No.23, 8669 | - |
| dc.title (題名) | Practical Inner Product Encryption with Constant Private Key | - |
| dc.type (資料類型) | article | - |
| dc.identifier.doi (DOI) | 10.3390/app10238669 | - |
| dc.doi.uri (DOI) | https://doi.org/10.3390/app10238669 | - |