Abstract
Public key Encryption with Keyword Search (PEKS) scheme enables a sender to send encrypted data to a third party using the receiver’s public key. The receiver who owns the private key is able to give the third party the ability of search for some relevant data items by keywords without revealing the content of data and keywords. In this paper, we study the problem of PEKS construction without using bilinear maps. Our construction is based on the action of a matrix group on a set of vectors. The security of our system relies on the difficulty of discrete logarithm problem in the matrix group. Experimental results we obtained indicated that our construction over GF(2)is very efficient in terms of the time complexity.
This work was supported by the project "Design and implementation of FPGA-cryptography IP cores" (No. B2012-18-02TĐ).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public-key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 31–45. Springer, Heidelberg (2004)
Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205–222. Springer, Heidelberg (2005)
Baek, J., Safavi-Naini, R., Susilo, W.: On the integration of public key data encryption and public key encryption with keyword search. In: Katsikas, S.K., López, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 217–232. Springer, Heidelberg (2006)
Hwang, Y.-H., Lee, P.J.: Public key encryption with conjunctive keyword search and its extension to a multi-user system. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 2–22. Springer, Heidelberg (2007)
Boneh, D., Waters, B.: Conjunctive, Subset, and Range Queries on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535–554. Springer, Heidelberg (2007)
Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with key-word search revisited. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part I. LNCS, vol. 5072, pp. 1249–1259. Springer, Heidelberg (2008)
Tang, Q., Chen, L.: Public-Key Encryption with Registered Keyword Search. In: Martinelli, F., Preneel, B. (eds.) EuroPKI 2009. LNCS, vol. 6391, pp. 163–178. Springer, Heidelberg (2010)
Di Crescenzo, G., Saraswat, V.: Public key encryption with searchable keywords based on Jacobi symbols. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 282–296. Springer, Heidelberg (2007)
Khader, D.: Public Key Encryption with Keyword Search based on K-Resilient IBE. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3982, pp. 298–308. Springer, Heidelberg (2006)
Ibraimi, L., Nikova, S., Hartel, P., Jonker, W.: Public-Key encryption with Delegated Search. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 532–549. Springer, Heidelberg (2011)
Menezes, A., Wu, Y.-H.: The discrete logarithm problem in GL(n, q). Ars Combinatorica 47, 23–32 (1997)
Tang, Q.: Revisit the Concept of PEKS: Problems and a Possible Solution. Technical Report TR-CTIT-08-54 (2008) ISSN 1381–3625
Byun, J.W., Rhee, H.S., Park, H.-A., Lee, D.-H.: Offline keyword guessing attack on recent keyword search schemes. In: Jonker, W., Petković, M. (eds.) SDM 2006. LNCS, vol. 4165, pp. 75–83. Springer, Heidelberg (2006)
Heng, S.-H., Kurosawa, K.: k-Resilient Identity-Based Encryption in the Standard Model. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 67–80. Springer, Heidelberg (2004)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: 34.5.5: The subset-sum problem. In: Introduction to Algorithms, 3rd edn. MIT Press and McGraw-Hill (2009) ISBN 0–262–03293–7
Nguyen, T.D., Van Dang, H.: Quasi-inverse Based Cryptography. In: Murgante, B., Misra, S., Carlini, M., Torre, C.M., Nguyen, H.-Q., Taniar, D., Apduhan, B.O., Gervasi, O. (eds.) ICCSA 2013, Part IV. LNCS, vol. 7974, pp. 629–642. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Phan, T.Q., Dang, V.H., Nguyen, T.D. (2014). A Novel Construction for PEKS Scheme Using Matrix Group. In: Jeong, YS., Park, YH., Hsu, CH., Park, J. (eds) Ubiquitous Information Technologies and Applications. Lecture Notes in Electrical Engineering, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41671-2_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-41671-2_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41670-5
Online ISBN: 978-3-642-41671-2
eBook Packages: EngineeringEngineering (R0)