The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2013 vol.62)
pp: 2266-2277
Peng Xu , Huazhong University of Science and Technology, Wuhan
Hai Jin , Huazhong University of Science and Technology, Wuhan
Qianhong Wu , Beihang Univerisity, Beijing
Wei Wang , Peking University, Shenzhen
ABSTRACT
Public-key encryption with keyword search (PEKS) is a versatile tool. It allows a third party knowing the search trapdoor of a keyword to search encrypted documents containing that keyword without decrypting the documents or knowing the keyword. However, it is shown that the keyword will be compromised by a malicious third party under a keyword guess attack (KGA) if the keyword space is in a polynomial size. We address this problem with a keyword privacy enhanced variant of PEKS referred to as public-key encryption with fuzzy keyword search (PEFKS). In PEFKS, each keyword corresponds to an exact keyword search trapdoor and a fuzzy keyword search trapdoor. Two or more keywords share the same fuzzy keyword trapdoor. To search encrypted documents containing a specific keyword, only the fuzzy keyword search trapdoor is provided to the third party, i.e., the searcher. Thus, in PEFKS, a malicious searcher can no longer learn the exact keyword to be searched even if the keyword space is small. We propose a universal transformation which converts any anonymous identity-based encryption (IBE) scheme into a secure PEFKS scheme. Following the generic construction, we instantiate the first PEFKS scheme proven to be secure under KGA in the case that the keyword space is in a polynomial size.
INDEX TERMS
Keyword search, Receivers, Encryption, Servers, Public key,identity-based encryption, Public-key encryption with keyword search, keyword guessing attack, public-key encryption with fuzzy keyword search
CITATION
Peng Xu, Hai Jin, Qianhong Wu, Wei Wang, "Public-Key Encryption with Fuzzy Keyword Search: A Provably Secure Scheme under Keyword Guessing Attack", IEEE Transactions on Computers, vol.62, no. 11, pp. 2266-2277, Nov. 2013, doi:10.1109/TC.2012.215
REFERENCES
[1] S. Kamara and K. Lauter, "Cryptographic Cloud Storage," Proc. 14th Int'l Conf. Financial Cryptography and Data Security (FC '10), pp. 136-149, 2010.
[2] D.X. Song, D. Wagner, and A. Perrig, "Practical Techniques for Searches on Encrypted Data," Proc. IEEE Symp. Security and Privacy, pp. 44-55, 2000.
[3] E.-J. Goh, "Secure Indexes," Cryptology ePrint Archive: Report 2003/216, http://eprint.iacr.org/2003216.pdf, 2013.
[4] R. Agrawal et al., "Order Preserving Encryption for Numeric Data," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 563-574, 2004.
[5] R. Curtmola et al., "Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions," Proc. 13th ACM Conf. Computer and Comm. Security, pp. 79-88, 2006.
[6] D. Boneh et al., "Public Key Encyrption with Keyword Search," Proc. Ann. Int'l Advances in Cryptology (EUROCRYPT '04), pp. 506-522, 2004.
[7] W. Harrower, "Searching Encrypted Data," technical report, Dept. of Computing, Imperial College London, 2009.
[8] J.W. Byun et al., "Offline Keyword Guessing Attacks on Recent Keyword Search Schemes over Encrypted Data," Proc. Third VLDB Int'l Conf. Secure Data Management, pp. 75-83, 2006.
[9] D.J. Park, K. Kim, and P.J. Lee, "Public Key Encryption with Conjunctive Field Keyword Search," Proc. Fifth Int'l Conf. Information Security Applications (WISA '04), pp. 73-86, 2004.
[10] I.R. Jeong et al., "Constructing PEKS Schemes Secure against Keyword Guessing Attacks Is Possible?" Computer Comm., vol. 32, no. 2, pp. 394-396, 2009.
[11] D. Boneh and M. Franklin, "Identity-Based Encryption from the Weil Pairing," Proc. 21st Ann. Int'l Advances in Cryptology (CRYPTO '01), pp. 213-239, 2001.
[12] M. Abdalla et al., "Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions," Proc. Ann. Int'l Advances in Cryptology (CRYPTO '05), pp. 205-222, 2005.
[13] X. Boyen and B. Waters, "Anonymous Hierarchical Identity-Based Encryption (without Random Oracles)," Proc. Ann. Int'l Advances in Cryptology (CRYPTO '06), pp. 290-307, 2006.
[14] C. Gentry, "Practical Identity-Based Encyrption without Random Oracles," Proc. Ann. Int'l Advances in Cryptology (EUROCRYPT '06), pp. 445-464, 2006.
[15] L. Ducas, "Anonymity from Asymmetry: New Constructions for Anonymous Hibe," Proc. Int'l Conf. Topics in Cryptology (CT-RSA '10), pp. 148-164, 2010.
[16] C.-I. Fan, L.-Y. Huang, and P.-H. Ho, "Anonymous Multireceiver Identity-Based Encryption," IEEE Trans. Computers, vol. 59, no. 9, pp. 1239-1249, Sept. 2010.
[17] L. Ballard, S. Kamara, and F. Monrose, "Achieving Efficient Conjunctive Keyword Searches over Encrypted Data," Proc. Seventh Int'l Conf. Information and Comm. Security (ICICS '05), pp. 414-426, 2005.
[18] E.-K. Ryu and T. Takagi, "Efficient Conjunctive Keyword-Searchable Encryption," Proc. 21st Int'l Conf. Advanced Information Networking and Applications Workshops (AINAW '07), pp. 409-414, 2007.
[19] Y.H. Hwang and P.J. Lee, "Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-User System," Proc. Pairing Based Cryptography Conf., pp. 2-22, 2007.
[20] J. Bethencourt et al., "Anonymous Multi-Attribute Encryption with Range Query and Conditional Decryption," Technical Report CMU-CS-06-135, Carnegie Mellon Univ., 2006.
[21] E. Shi et al., "Multidimensional Range Query over Encrypted Data," Technical Report CMU-CS-06-135 Carnegie Mellon Univ., 2007.
[22] D. Boneh and B. Waters, "Conjunctive, Subset, and Range Queries on Encrypted Data," Proc. Fourth Conf. Theory of Cryptography (TCC '07), pp. 535-554, 2007.
[23] J. Camenisch et al., "Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data," Proc. 12th Int'l Conf. Practice and Theory in Public Key Cryptography (PKC '09), pp. 196-214, 2009.
[24] A.J. Menezes, T. Okamoto, and S.A. Vanstone, "Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field," IEEE Trans. Information Theory, vol. 39, no. 5, pp. 1639-1646, Sept. 1993.
[25] G. Frey, M. Muller, and H.-G. Ruck, "The Tate Pairing and the Discrete Logarithm Applied to Elliptic Curve Cryptosystems," IEEE Trans. Information Theory, vol. 45, no. 5, pp. 1717-1719, July 1999.
[26] M. Brysbaert and B. New, "Moving Beyond Kucera and Francis: A Critical Evaluation of Current Word Frequency Norms and the Introduction of a New and Improved Word Frequency Measure for American English," Behavior Research Methods, vol. 49, no. 4, pp. 977-990, 2009.
[27] M. Brysbaert and B. New, "SUBTLEXus: American Word Frequencies," http:/subtlexus.lexique.org/, 2009.
[28] I.V. Blair, G.R. Urland, and J.E. Ma, "Using Internet Search Engines to Estimate Word Frequency," Behavior Research Methods Instruments and Computers, vol. 34, no. 2, pp. 286-290, 2002.
92 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool