The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2011 vol.23)
pp: 1483-1497
Jong Hwan Park , Kyung Hee University, Young-in
ABSTRACT
Predicate encryption has received considerable attention in applications where private and sensitive data about users can be stored in untrusted database (DB) servers. It allows users to store encrypted data at DB servers, and yet retain the ability to search those databases without revealing anything else about the encrypted data. Hidden Vector Encryption (HVE) is a type of predicate encryption that supports the fine-grained conjunctive combination of equality queries, comparison queries, and subset queries on encrypted data. The currently known HVE schemes, which are all pairing-based, either work in composite-order groups or require a token size of O(\ell ) and O(\ell ) pairing computations for one search query with \ell conjuncts. In this paper, we present a new HVE scheme that not only works in prime-order groups but also requires a token size of O(1) and only O(1) pairing computations regardless of \ell. Our HVE construction also yields a more efficient, anonymous, identity-based encryption scheme than existing schemes, which is secure in the standard model. To achieve our goal, we introduce novel techniques for both hiding attributes in prime-order groups and reducing the number of pairing computations to O(1). Our techniques are quite general so that they can be applied to both symmetric and asymmetric bilinear maps.
INDEX TERMS
Hidden vector encryption, database privacy, search on encrypted data, bilinear maps.
CITATION
Jong Hwan Park, "Efficient Hidden Vector Encryption for Conjunctive Queries on Encrypted Data", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 10, pp. 1483-1497, October 2011, doi:10.1109/TKDE.2010.206
REFERENCES
[1] J. Katz, A. Sahai, and B. Waters, "Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products," Proc. Theory and Applications of Cryptographic Techniques 27th Ann. Int'l Conf. Advances in Cryptology (EUROCRYPT '08), vol. 4965, pp. 146-162, 2008.
[2] D. Boneh and B. Waters, "Conjunctive, Subset, and Range Queries on Encryted Data," Proc. Conf. Theory of Cryptography (TCC '07), vol. 4392, pp. 535-554, 2007.
[3] E. Shi and B. Waters, "Delegating Capabilites in Predicate Encryption Systems," Proc. Int'l Colloquium Automata, Languages and Programming (ICALP '08), vol. 5126, pp. 560-578, 2008.
[4] V. Iovino and G. Persiano, "Hidden-Vector Encryption with Groups of Prime Order," Proc. Int'l Conf. Pairing-Based Cryptography (Pairing '08), vol. 5209, pp. 75-88, 2008.
[5] X. Boyen, "A Tapestry of Identity-Based Encryption: Practical Frameworks Compared," Int'l J. Applied Cryptography, vol. 1, no. 1, pp. 3-21, 2008.
[6] D. Boyen and B. Waters, "Anonymous Hierarchical Identity-Based Encryption (without Random Oracles)," Proc. Ann. Int'l Cryptology Conf. (CRYPTO '06), vol. 4117, pp. 290-307, 2006.
[7] E. Shen, E. Shi, and B. Waters, "Predicate Privacy in Encryption Systems," Proc. Theory of Cryptography Conf. (TCC '09), vol. 5444, pp. 457-473, 2009.
[8] D. Boneh, X. Boyen, and H. Shacham, "Short Group Signatures," Proc. CRYPTO '04, vol. 3152, pp. 41-55, 2004.
[9] D. Boneh, G.D. Crescenzo, R. Octrovsky, and G. Persiano, "Public Key Encryption with Keyword Search," Proc. EUROCRYPT '04, vol. 3027, pp. 506-522, 2004.
[10] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, "Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extentions," Proc. CRYPTO '05, vol. 3621, pp. 205-222, 2005.
[11] D. Boneh and M. Franklin, "Identity-Based Encryption from the Weil Pairing," Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '01), vol. 2139, pp. 213-229, 2001.
[12] C. Gentry, "Practical Identity-Based Encryption without Random Oracles," Proc. Ann. Int'l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT '06), vol. 4004, pp. 445-464, 2006.
[13] J.H. Seo, T. Kobayashi, M. Oukubo, and K. Suzuki, "Anonymous Hierarchical Identity-Based Enryption with Constant Size Ciphertexts," Proc. Int'l Conf. Practice and Theory in Public Key Cryptography (PKC '09), vol. 5443, pp. 215-234, 2009.
[14] D. Boneh, A. Sahai, and B. Waters, "Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys," Proc. EUROCRYPT '06, vol. 4004, pp. 573-592, 2006.
[15] D. Boneh and B. Waters, "A Fully Collusion Resistant Broadcast Trace and Revoke System with Public Traceability," Proc. ACM Conf. Computer and Comm. Security (CCS '06), pp. 211-220, 2006.
[16] E. Shi, J. Bethancourt, H.T.H. Chan, D.X. Song, and A. Perrig, "Multi-Dimensional Range Queries over Encrypted Data," Proc. IEEE Symp. Security and Privacy, pp. 350-364, 2007.
[17] V. Shoup, "Lower Bounds for Discrete Logarithms and Related Problems," Proc. Ann. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '97), vol. 1233, pp. 256-266, 1997.
[18] D. Boneh and X. Boyen, "Efficient Selective-ID Secure Identity Based Encryption without Random Oracles," Proc. EUROCRYPT '04, vol. 3027, pp. 223-238, 2004.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool