Abstract

In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-size ciphertexts and the other features constant-size secret-keys. Our NIPE schemes imply an identity-based revocation (IBR) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. Any previous IBR scheme with constant-size ciphertexts or constant-size secret-keys was not adaptively secure in the standard model. This paper also presents two zero inner-product encryption (ZIPE) schemes each of which has constant-size ciphertexts or constant-size secret-keys and is adaptively secure under the DLIN assumption in the standard model. They imply an identity-based broadcast encryption system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. We also extend the proposed ZIPE schemes in two directions, one is a fully-attribute-hiding ZIPE scheme with constant-size secret-keys, and the other a hierarchical ZIPE scheme with constant-size ciphertexts.

Highlights

  • 1.1 BackgroundFunctional encryption (FE) is an advanced concept of encryption or a generalization of public-key encryption (PKE) and identity-based encryption (IBE)

  • Identity-based broadcast encryption (IBBE) [1,8,12,16,30] and revocation (IBR) [21] schemes can be thought of as functional encryption systems where a ciphertext is encrypted for a set of identities S = {I D1, . . . , I Dn} in IBBE

  • Katz et al [19] introduced a functional encryption scheme for zero inner products, zero inner product encryption (ZIPE) where a ciphertext encrypted with vector x can be decrypted by any key associated with vector v such that v · x = 0, i.e., relation RZIPE(v, x) = 1 iff v · x = 0

Read more

Summary

Background

Functional encryption (FE) is an advanced concept of encryption or a generalization of public-key encryption (PKE) and identity-based encryption (IBE). Katz et al [19] introduced a functional encryption scheme for zero inner products, zero inner product encryption (ZIPE) where a ciphertext encrypted with vector x can be decrypted by any key associated with vector v such that v · x = 0, i.e., relation RZIPE(v, x) = 1 iff v · x = 0. Their scheme is selectively secure in the standard model and the ciphertext size is linear in the dimension of vectors, n, it achieves an additional security property, attribute-hiding, in which x is hidden from the ciphertext. No ZIPE scheme with constant-size secret-keys has been presented

Our result
Related works
Key techniques
Notations
Dual pairing vector spaces by direct product of symmetric pairing groups
Special matrix subgroups
Key ideas in constructing the proposed NIPE scheme
Dual orthonormal basis generator
Construction
Lemmas for the Proof of Theorem 1
Proof outline
Proof of Theorem 1
Construction and security
ZIPE scheme with constant-size ciphertexts
10.1 Construction and security
11 Comparison
12 Hierarchical ZIPE scheme with constant-size ciphertexts
12.1 Dual orthonormal basis generator
12.2 Construction and security
13 Concluding remarks
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.