Abstract
With the deployment of smart meters at individual households, smart grid can collect metering data of users’ power consumption. However, users’ power usage patterns would also be revealed. To preserve the users’ privacy, metering data is mostly encrypted by cryptographic algorithms. When data mining is needed to support decision making or ensure reliability, to find useful information from the encrypted data is very important for smart grid. Most of the traditional keyword searching schemes rarely consider both users’ data privacy and requesters’ query privacy. In particular, the power system data in smart grid has multidimensional attributes; thus, how to query over the encrypted multidimensional data on all dimensions is a challenging issue in smart grid. To achieve finer grained conjunctive query, this chapter introduces an Efficient Conjunctive Query (ECQ) scheme. Specifically, the ECQ incorporates the idea of public key encryption and conjunctive keywords search to achieve conjunctive query without data and query privacy leakage. Security analysis demonstrates that the ECQ can achieve the security requirements, namely, data confidentiality, integrity and privacy, as well as query privacy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. Lu, X. Liang, X. Li, X. Lin, and X. Shen, “Eppa: An efficient and privacy-preserving aggregation scheme for secure smart grid communications,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 9, pp. 1621–1631, 2012.
H. Li, R. Lu, L. Zhou, B. Yang, and X. Shen, “An efficient merkle-tree-based authentication scheme for smart grid,” IEEE Systems Journal, vol. pp, no. 99, pp. 1–9, 2013.
D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proc. Eurocrypt, pp. 506–522, Springer, 2004.
M. Wen, R. Lu, K. Zhang, J. Lei, X. Liang, and X. Shen, “Parq: A privacy-preserving range query scheme over encrypted metering data for smart grid,” IEEE Transactions on Emerging Topics in Computing, vol. 1, no. 1, pp. 178–191, 2013.
B. Zhang and F. Zhang, “An efficient public key encryption with conjunctive-subset keywords search,” Journal of Network and Computer Applications, vol. 34, no. 1, pp. 262–267, 2011.
J. Baek, R. Safavi-Naini, and W. Susilo, “On the integration of public key data encryption and public key encryption with keyword search,” in Proc. ISC, pp. 217–232, Springer, 2006.
Q. Liu, G. Wang, and J. Wu, “An efficient privacy preserving keyword search scheme in cloud computing,” in Proc. CSE, vol. 2, pp. 715–720, IEEE, 2009.
B. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu, “Secure multidimensional range queries over outsourced data,” The International Journal on Very Large Data Bases, vol. 21, no. 3, pp. 333–358, 2012.
J. Shao, Z. Cao, X. Liang, and H. Lin, “Proxy re-encryption with keyword search,” Information Sciences, vol. 180, no. 13, pp. 2576–2587, 2010.
B. Libert and J.-J. Quisquater, “The exact security of an identity based signature and its applications.,” IACR Cryptology ePrint Archive, vol. 2004, p. 102, 2004.
M. Wen, R. Lu, X. Liang, H. Li, and X. S. Shen, “Ecq: An efficient conjunctive query scheme over encrypted multidimensional data in smart grid,” in Proc. Globcom, to appear.
M. Scott, “Efficient implementation of cryptographic pairings,” in [Online]. http://www.pairing-conference.org/2007/invited/Scottslide.pdf, 2007.
S. Galbraith, “Pairings,” LondonN Mathematical Society Lecture Note Series, vol. 317, p. 183, 2006.
J. W. Byun, H. S. Rhee, H.-A. Park, and D. H. Lee, “Off-line keyword guessing attacks on recent keyword search schemes over encrypted data,” in Proc. SDM, pp. 75–83, Springer, 2006.
H. S. Rhee, J. H. Park, W. Susilo, and D. H. Lee, “Trapdoor security in a searchable public-key encryption scheme with a designated tester,” Journal of Systems and Software, vol. 83, no. 5, pp. 763–771, 2010.
J. Camenisch, M. Kohlweiss, A. Rial, and C. Sheedy, “Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data,” in Proc. PKC, pp. 196–214, Springer, 2009.
P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Proc. ACNS, pp. 31–45, Springer, 2004.
J. W. Byun, D. H. Lee, and J. Lim, “Efficient conjunctive keyword search on encrypted data storage system,” in Proc. EuroPKI, pp. 184–196, Springer, 2006.
R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proc. CCS, pp. 79–88, ACM, 2006.
D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Proc. TCC, pp. 535–554, 2007.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 The Author(s)
About this chapter
Cite this chapter
Wen, M., Lu, R., Liang, X., Lei, J., Shen, X.(. (2014). Conjunctive Query over Encrypted Multidimensional Data. In: Querying over Encrypted Data in Smart Grids. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-06355-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-06355-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06354-6
Online ISBN: 978-3-319-06355-3
eBook Packages: Computer ScienceComputer Science (R0)