Skip to main content
main-content

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

2014 | OriginalPaper | Buchkapitel

4. Range Query over Encrypted Metering Data for Financial Audit

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

Smart grid, envisioned as an indispensable power infrastructure, is featured by real-time and two-way communications. However, how to securely retrieve and audit the communicated metering data for validation testing is still challenging for smart grid. In this chapter, we introduce a novel privacy-preserving range query scheme over encrypted metering data, named PaRQ, to address the privacy issues in financial auditing for smart grid. The PaRQ allows a residential user to store metering data on a cloud server in an encrypted form. When financial auditing is needed, an authorized requester can send its range query tokens to the cloud server to retrieve the metering data. Specifically, the PaRQ constructs a hidden vector encryption (HVE) based range query predicate to encrypt the searchable attributes and session keys of the encrypted data. Meanwhile, the requester’s rang query can be transferred into two query tokens, which are used to find the matched query results.
Literatur
1.
Zurück zum Zitat R. Zeng, Y. Jiang, C. Lin, and X. Shen, “Dependability analysis of control center networks in smart grid using stochastic petri nets,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 9, pp. 1721–1730, 2012. CrossRef R. Zeng, Y. Jiang, C. Lin, and X. Shen, “Dependability analysis of control center networks in smart grid using stochastic petri nets,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 9, pp. 1721–1730, 2012. CrossRef
2.
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
4.
Zurück zum Zitat X. Liang, X. Li, R. Lu, X. Lin, and X. Shen, “Udp: Usage-based dynamic pricing with privacy preservation for smart grid.,” IEEE Transactions on Smart Grid, vol. 4, no. 1, pp. 141–150, 2013. CrossRef X. Liang, X. Li, R. Lu, X. Lin, and X. Shen, “Udp: Usage-based dynamic pricing with privacy preservation for smart grid.,” IEEE Transactions on Smart Grid, vol. 4, no. 1, pp. 141–150, 2013. CrossRef
5.
Zurück zum Zitat R. Yu, Y. Zhang, S. Gjessing, C. Yuen, S. Xie, and M. Guizani, “Cognitive radio based hierarchical communications infrastructure for smart grid,” IEEE Network, vol. 25, no. 5, pp. 6–14, 2011. CrossRef R. Yu, Y. Zhang, S. Gjessing, C. Yuen, S. Xie, and M. Guizani, “Cognitive radio based hierarchical communications infrastructure for smart grid,” IEEE Network, vol. 25, no. 5, pp. 6–14, 2011. CrossRef
6.
Zurück zum Zitat C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-preserving public auditing for data storage security in cloud computing,” in Proc. INFOCOM, pp. 1–9, 2010. C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-preserving public auditing for data storage security in cloud computing,” in Proc. INFOCOM, pp. 1–9, 2010.
7.
Zurück zum Zitat X. Li, X. Liang, R. Lu, X. Shen, X. Lin, and H. Zhu, “Securing smart grid: cyber attacks, countermeasures, and challenges,” IEEE Communications Magazine, vol. 50, no. 8, pp. 38–45, 2012. CrossRef X. Li, X. Liang, R. Lu, X. Shen, X. Lin, and H. Zhu, “Securing smart grid: cyber attacks, countermeasures, and challenges,” IEEE Communications Magazine, vol. 50, no. 8, pp. 38–45, 2012. CrossRef
8.
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.
9.
Zurück zum Zitat J. Daemen, V. Rijmen, and A. Proposal, “Rijndael,” in Proc. AESCC, 1998. J. Daemen, V. Rijmen, and A. Proposal, “Rijndael,” in Proc. AESCC, 1998.
10.
Zurück zum Zitat D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Proc. CRYPTO, pp. 213–229, Springer, 2001. D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Proc. CRYPTO, pp. 213–229, Springer, 2001.
11.
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
12.
Zurück zum Zitat E. Shi, J. Bethencourt, T. Chan, D. Song, and A. Perrig, “Multi-dimensional range query over encrypted data,” in Proc. SP, pp. 350–364, 2007. E. Shi, J. Bethencourt, T. Chan, D. Song, and A. Perrig, “Multi-dimensional range query over encrypted data,” in Proc. SP, pp. 350–364, 2007.
13.
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
14.
Zurück zum Zitat A. Boldyreva, N. Chenette, and A. O’Neill, “Order-preserving encryption revisited: Improved security analysis and alternative solutions,” in Proc. CRYPTO, pp. 578–595, Springer, 2011. A. Boldyreva, N. Chenette, and A. O’Neill, “Order-preserving encryption revisited: Improved security analysis and alternative solutions,” in Proc. CRYPTO, pp. 578–595, Springer, 2011.
15.
Zurück zum Zitat D. Bertsekas, R. Gallager, and P. Humblet, Data networks, vol. 2. Prentice-Hall International, 1992. D. Bertsekas, R. Gallager, and P. Humblet, Data networks, vol. 2. Prentice-Hall International, 1992.
16.
Zurück zum Zitat J. Walrand, “A probabilistic look at networks of quasi-reversible queues,” IEEE Transactions on Information Theory, vol. 29, no. 6, pp. 825–831, 1983. CrossRefMATHMathSciNet J. Walrand, “A probabilistic look at networks of quasi-reversible queues,” IEEE Transactions on Information Theory, vol. 29, no. 6, pp. 825–831, 1983. CrossRefMATHMathSciNet
18.
Zurück zum Zitat P. Parikh, M. Kanabar, and T. Sidhu, “Opportunities and challenges of wireless communication technologies for smart grid applications,” in Proc. PESGM, pp. 1–7, 2010. P. Parikh, M. Kanabar, and T. Sidhu, “Opportunities and challenges of wireless communication technologies for smart grid applications,” in Proc. PESGM, pp. 1–7, 2010.
19.
Zurück zum Zitat H. Li, X. Liang, R. Lu, X. Lin, and X. Shen, “Edr: an efficient demand response scheme for achieving forward secrecy in smart grid,” in Proc. GLOBECOM, pp. 929–934, IEEE, 2012. H. Li, X. Liang, R. Lu, X. Lin, and X. Shen, “Edr: an efficient demand response scheme for achieving forward secrecy in smart grid,” in Proc. GLOBECOM, pp. 929–934, IEEE, 2012.
20.
Zurück zum Zitat G. Acs and C. Castelluccia, “I have a dream!(differentially private smart metering),” in Proc. IH, pp. 118–132, Springer, 2011. G. Acs and C. Castelluccia, “I have a dream!(differentially private smart metering),” in Proc. IH, pp. 118–132, Springer, 2011.
21.
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.
22.
Zurück zum Zitat M. Wen, R. Lu, J. Lei, H. Li, X. Liang, and X. S. Shen, “Sesa: an efficient searchable encryption scheme for auction in emerging smart grid marketing,” Security and Communication Networks, vol. 7, no. 1, p. 234–244, 2013. CrossRef M. Wen, R. Lu, J. Lei, H. Li, X. Liang, and X. S. Shen, “Sesa: an efficient searchable encryption scheme for auction in emerging smart grid marketing,” Security and Communication Networks, vol. 7, no. 1, p. 234–244, 2013. CrossRef
23.
Zurück zum Zitat R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proc. SIGMOD, pp. 563–574, ACM, 2004. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proc. SIGMOD, pp. 563–574, ACM, 2004.
24.
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.
25.
Zurück zum Zitat J. Park, “Efficient hidden vector encryption for conjunctive queries on encrypted data,” IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 10, pp. 1483–1497, 2011. CrossRef J. Park, “Efficient hidden vector encryption for conjunctive queries on encrypted data,” IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 10, pp. 1483–1497, 2011. CrossRef
26.
Zurück zum Zitat J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Proc. EUROCRYPT, pp. 146–162, Springer, 2008. J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Proc. EUROCRYPT, pp. 146–162, Springer, 2008.
27.
Zurück zum Zitat V. Iovino and G. Persiano, “Hidden-vector encryption with groups of prime order,” in Proc. Pairing, pp. 75–88, Springer, 2008. V. Iovino and G. Persiano, “Hidden-vector encryption with groups of prime order,” in Proc. Pairing, pp. 75–88, Springer, 2008.
Metadaten
Titel
Range Query over Encrypted Metering Data for Financial Audit
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_4

Premium Partner