Hidden-vector encryption with groups of prime order. (English) Zbl 1186.94449
Galbraith, Steven D. (ed.) et al., Pairing-based cryptography – Pairing 2008. Second international conference, Egham, UK, September 1–3, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85503-3/pbk). Lecture Notes in Computer Science 5209, 75-88 (2008).
Summary: Predicate encryption schemes are encryption schemes in which each ciphertext Ct is associated with a binary attribute vector \(\mathbf{x}=(x_1,\dots,x_n)\) and keys \(K\) are associated with predicates. A key \(K\) can decrypt a ciphertext Ct if and only if the attribute vector of the ciphertext satisfies the predicate of the key. Predicate encryption schemes can be used to implement fine-grained access control on encrypted data and to perform search on encrypted data.
Hidden vector encryption schemes [D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data”, Lect. Notes Comput. Sci. 4392, 535–554 (2007; Zbl 1156.94335)] are encryption schemes in which each ciphertext Ct is associated with a binary vector \(\mathbf{x}=(x_1,\dots,x_n)\) and each key \(K\) is associated with binary vector \(\mathbf{y}=(y_1,\dots,y_n)\) with “don’t care” entries (denoted with \(\star )\). Key \(K\) can decrypt ciphertext Ct if and only if \(\mathbf{x}\) and \(\mathbf{y}\) agree for all \(i\) for which \(y_i\neq \star\).
Hidden vector encryption schemes are an important type of predicate encryption schemes as they can be used to construct more sophisticated predicate encryption schemes (supporting for example range and subset queries).
We give a construction for hidden-vector encryption from standard complexity assumptions on bilinear groups of prime order. Previous constructions were in bilinear groups of composite order and thus resulted in less efficient schemes. Our construction is both payload-hiding and attribute-hiding meaning that also the privacy of the attribute vector, besides privacy of the cleartext, is guaranteed.
For the entire collection see [Zbl 1155.94002].
Hidden vector encryption schemes [D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data”, Lect. Notes Comput. Sci. 4392, 535–554 (2007; Zbl 1156.94335)] are encryption schemes in which each ciphertext Ct is associated with a binary vector \(\mathbf{x}=(x_1,\dots,x_n)\) and each key \(K\) is associated with binary vector \(\mathbf{y}=(y_1,\dots,y_n)\) with “don’t care” entries (denoted with \(\star )\). Key \(K\) can decrypt ciphertext Ct if and only if \(\mathbf{x}\) and \(\mathbf{y}\) agree for all \(i\) for which \(y_i\neq \star\).
Hidden vector encryption schemes are an important type of predicate encryption schemes as they can be used to construct more sophisticated predicate encryption schemes (supporting for example range and subset queries).
We give a construction for hidden-vector encryption from standard complexity assumptions on bilinear groups of prime order. Previous constructions were in bilinear groups of composite order and thus resulted in less efficient schemes. Our construction is both payload-hiding and attribute-hiding meaning that also the privacy of the attribute vector, besides privacy of the cleartext, is guaranteed.
For the entire collection see [Zbl 1155.94002].
MSC:
| 94A60 | Cryptography |
Citations:
Zbl 1156.94335References:
| [1] | Boneh, D.; Boyen, X.; Shacham, H.; Franklin, M., Short group signatures, Advances in Cryptology - CRYPTO 2004, 41-55 (2004), Heidelberg: Springer, Heidelberg · Zbl 1104.94044 |
| [2] | Boneh, D.; Di Crescenzo, G.; Ostrovsky, R.; Persiano, G.; Cachin, C.; Camenisch, J. L., Public key encryption with keyword search, Advances in Cryptology - EUROCRYPT 2004, 506-522 (2004), Heidelberg: Springer, Heidelberg · Zbl 1122.68424 |
| [3] | Boyen, X.; Waters, B.; Dwork, C., Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles), Advances in Cryptology - CRYPTO 2006, 290-307 (2006), Heidelberg: Springer, Heidelberg · Zbl 1161.94390 · doi:10.1007/11818175_17 |
| [4] | Boneh, D.; Waters, B.; Vadhan, S. P., Conjunctive, subset and range queries on encrypted data, Theory of Cryptography, 535-554 (2007), Heidelberg: Springer, Heidelberg · Zbl 1156.94335 · doi:10.1007/978-3-540-70936-7_29 |
| [5] | Goyal, V.; Pandey, O.; Sahai, A.; Waters, B., Attribute-Based Encryption for Fine-Grained Access Control for Encrypted Data, ACM CCS 2006 13th Conference on Computer and Communications Security, 89-98 (2006), New York: ACM Press, New York · doi:10.1145/1180405.1180418 |
| [6] | Katz, J.; Sahai, A.; Waters, B.; Smart, N., Predicate Encryption Supporting Disjunction, Polynomial Equations, and Inner Products, Advances in Cryptology - EUROCRYPT 2008 (2008), Heidelberg: Springer, Heidelberg · Zbl 1149.94323 · doi:10.1007/978-3-540-78967-3_9 |
| [7] | Shi, E.; Bethencourt, J.; Chan, H.; Song, D.; Perrig, A., Multi-Dimensional Range Query over Encrypted Data, 2007 IEEE Symposium on Security and Privacy (2007), Los Alamitos: IEEE Computer Society Press, Los Alamitos |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
