Skip to main content
main-content

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

2014 | OriginalPaper | Buchkapitel

3. Conjunctive Query over Encrypted Multidimensional Data

verfasst von : Mi Wen, Rongxing Lu, Xiaohui Liang, Jingsheng Lei, Xuemin (Sherman) Shen

Erschienen in: Querying over Encrypted Data in Smart Grids

Verlag: Springer International Publishing

share
TEILEN

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.
Literatur
1.
Zurück zum Zitat 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. CrossRef 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. CrossRef
2.
Zurück zum Zitat 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. 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.
3.
Zurück zum Zitat D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proc. Eurocrypt, pp. 506–522, Springer, 2004. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proc. Eurocrypt, pp. 506–522, Springer, 2004.
4.
Zurück zum Zitat 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. CrossRef 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. CrossRef
5.
Zurück zum Zitat 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. CrossRef 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. CrossRef
6.
Zurück zum Zitat 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. 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.
7.
Zurück zum Zitat 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. 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.
8.
Zurück zum Zitat 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. CrossRef 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. CrossRef
9.
Zurück zum Zitat 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. CrossRefMATHMathSciNet 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. CrossRefMATHMathSciNet
10.
Zurück zum Zitat 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. 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.
11.
Zurück zum Zitat 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. 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.
13.
Zurück zum Zitat S. Galbraith, “Pairings,” LondonN Mathematical Society Lecture Note Series, vol. 317, p. 183, 2006. MathSciNet S. Galbraith, “Pairings,” LondonN Mathematical Society Lecture Note Series, vol. 317, p. 183, 2006. MathSciNet
14.
Zurück zum Zitat 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. 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.
15.
Zurück zum Zitat 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. CrossRef 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. CrossRef
16.
Zurück zum Zitat 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. 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.
17.
Zurück zum Zitat P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Proc. ACNS, pp. 31–45, Springer, 2004. P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Proc. ACNS, pp. 31–45, Springer, 2004.
18.
Zurück zum Zitat 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. 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.
19.
Zurück zum Zitat 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. 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.
20.
Zurück zum Zitat D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Proc. TCC, pp. 535–554, 2007. D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Proc. TCC, pp. 535–554, 2007.
Metadaten
Titel
Conjunctive Query over Encrypted Multidimensional Data
verfasst von
Mi Wen
Rongxing Lu
Xiaohui Liang
Jingsheng Lei
Xuemin (Sherman) Shen
Copyright-Jahr
2014
DOI
https://doi.org/10.1007/978-3-319-06355-3_3

Premium Partner