Practical Inner Product Encryption with Constant Private Key
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 decryp...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-12-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/10/23/8669 |
| _version_ | 1797545766639632384 |
|---|---|
| author | Yi-Fan Tseng Zi-Yuan Liu Raylin Tso |
| author_facet | Yi-Fan Tseng Zi-Yuan Liu Raylin Tso |
| author_sort | Yi-Fan Tseng |
| collection | DOAJ |
| description | 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 <inline-formula><math display="inline"><semantics><mi mathvariant="double-struck">G</mi></semantics></math></inline-formula> element and one <inline-formula><math display="inline"><semantics><msub><mi mathvariant="double-struck">Z</mi><mi>p</mi></msub></semantics></math></inline-formula> 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. |
| first_indexed | 2024-03-10T14:20:38Z |
| format | Article |
| id | doaj.art-9a9934258a7943f2a0ce14ebf1888d33 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T14:20:38Z |
| publishDate | 2020-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-9a9934258a7943f2a0ce14ebf1888d332023-11-20T23:26:42ZengMDPI AGApplied Sciences2076-34172020-12-011023866910.3390/app10238669Practical Inner Product Encryption with Constant Private KeyYi-Fan Tseng0Zi-Yuan Liu1Raylin Tso2Department of Computer Science, National Chengchi University, Taipei 11605, TaiwanDepartment of Computer Science, National Chengchi University, Taipei 11605, TaiwanDepartment of Computer Science, National Chengchi University, Taipei 11605, TaiwanInner 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 <inline-formula><math display="inline"><semantics><mi mathvariant="double-struck">G</mi></semantics></math></inline-formula> element and one <inline-formula><math display="inline"><semantics><msub><mi mathvariant="double-struck">Z</mi><mi>p</mi></msub></semantics></math></inline-formula> 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.https://www.mdpi.com/2076-3417/10/23/8669predicate encryptioninner product encryptionconstant-size private keyefficient decryptionconstant pairing computations |
| spellingShingle | Yi-Fan Tseng Zi-Yuan Liu Raylin Tso Practical Inner Product Encryption with Constant Private Key Applied Sciences predicate encryption inner product encryption constant-size private key efficient decryption constant pairing computations |
| title | Practical Inner Product Encryption with Constant Private Key |
| title_full | Practical Inner Product Encryption with Constant Private Key |
| title_fullStr | Practical Inner Product Encryption with Constant Private Key |
| title_full_unstemmed | Practical Inner Product Encryption with Constant Private Key |
| title_short | Practical Inner Product Encryption with Constant Private Key |
| title_sort | practical inner product encryption with constant private key |
| topic | predicate encryption inner product encryption constant-size private key efficient decryption constant pairing computations |
| url | https://www.mdpi.com/2076-3417/10/23/8669 |
| work_keys_str_mv | AT yifantseng practicalinnerproductencryptionwithconstantprivatekey AT ziyuanliu practicalinnerproductencryptionwithconstantprivatekey AT raylintso practicalinnerproductencryptionwithconstantprivatekey |