Skip to main content

Privacy-Enhanced Data Collection Scheme for Smart-Metering

  • Conference paper
  • First Online:
Information Security and Cryptology (Inscrypt 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9589))

Included in the following conference series:

Abstract

New types of devices, such as smart-meters, wearables and home appliances, have been connected to the Internet recently. Data they send is usually very privacy sensitive, containing personal information about, e.g., household consumption, health status or behavior profiles of family members. In this paper, we propose a cryptographic scheme for the protection of data collection systems that is secure (in the sense of data authenticity and integrity) and privacy-friendly at the same time. This functionality is achieved by designing a novel group signature that provides signature anonymity, unlinkability and untraceability while retaining features for malicious user identification. Besides the full cryptographic specification, we also provide implementation results that confirm the computational efficiency of the scheme allowing easy deployment on existing devices.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    RA’s key contribution is necessary to prevent malicious users from submitting malformed keys allowing attacks on RA’s secrets.

References

  1. Alpar, G., Hoepman, J.H., Lueks, W.: An attack against fixed value discrete logarithm representations. Cryptology ePrint Archive, Report 2013/120 (2013)

    Google Scholar 

  2. Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41–55. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS 2004, pp. 168–177. ACM, New York, NY, USA (2004)

    Google Scholar 

  4. Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography, PKC 2009, pp. 481–500. Irvine, Springer, Berlin, Heidelberg (2009)

    Google Scholar 

  5. Camenisch, J.L., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268–289. Springer, Berlin, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Camenisch, J.L., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126–144. Springer, Berlin, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Camenisch, J.L., Stadler, M.A.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Berlin, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical report (1997)

    Google Scholar 

  9. Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, pp. 21–30. ACM, New York, NY, USA (2002)

    Google Scholar 

  10. Delerablée, C., Pointcheval, D.: Dynamic fully anonymous short group signatures. In: Nguyen, P.Q. (ed.) Progress in Cryptology-VIETCRYPT 2006. LNCS, vol. 4341, pp. 193–210. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 416–426. ACM, New York, NY, USA (1990). http://doi.acm.org/10.1145/100216.100272

  12. Ferrara, A.L., Green, M., Hohenberger, S., Pedersen, M.Ø.: Practical short signature batch verification. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 309–324. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Berlin, Heidelberg (1987)

    Google Scholar 

  14. Finster, S., Baumgart, I.: Pseudonymous smart metering without a trusted third party. In: 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 1723–1728, July 2013

    Google Scholar 

  15. Gallagher, P., Kerry, C.: FIPS PUB 186-4: Digital signature standard (DSS) (2013). http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf

  16. GMP: The GNU multiple precision arithmetic library (2015). https://gmplib.org

  17. Hajny, J., Dzurenda, P., Malina, L.: Privacy-PAC: privacy-enhanced physical access control. In: Proceedings of the 13th Workshop on Privacy in the Electronic Society, WPES 2014, pp. 93–96. ACM, New York, NY, USA (2014). http://doi.acm.org/10.1145/2665943.2665969

  18. Hajny, J., Malina, L.: Unlinkable attribute-based credentials with practical revocation on smart-cards. In: Mangard, S. (ed.) CARDIS 2012. LNCS, vol. 7771, pp. 62–76. Springer, Berlin, Heidelberg (2013)

    Chapter  Google Scholar 

  19. Hajny, J., Malina, L., Tethal, O.: Privacy-friendly access control based on personal attributes. In: Yoshida, M., Mouri, K. (eds.) IWSEC 2014. LNCS, vol. 8639, pp. 1–16. Springer, Heidelberg (2014). http://dx.doi.org/10.1007/978-3-319-09843-2_1

    Google Scholar 

  20. Hwang, J.Y., Lee, S., Chung, B.H., Cho, H.S., Nyang, D.: Short group signatures with controllable linkability. In: 2011 Workshop on Lightweight Security & Privacy: Devices, Protocols and Applications (LightSec), pp. 44–52. IEEE (2011)

    Google Scholar 

  21. Kim, K., Yie, I., Lim, S., Nyang, D.: Batch verification and finding invalid signatures in a group signature scheme. IJ Netw. Secur. 13(2), 61–70 (2011)

    Google Scholar 

  22. Lapon, J., Kohlweiss, M., De Decker, B., Naessens, V.: Analysis of revocation strategies for anonymous idemix credentials. In: De Decker, B., Lapon, J., Naessens, V., Uhl, A. (eds.) CMS 2011. LNCS, vol. 7025, pp. 3–17. Springer, Berlin, Heidelberg (2011). http://dx.doi.org/10.1007/978-3-642-24712-5_1

    Chapter  Google Scholar 

  23. Lin, X., Sun, X., Ho, P.H., Shen, X.: GSIS: a secure and privacy preserving protocol for vehicular communications. IEEE Trans. Veh. Technol. 56, 3442–3456 (2007)

    Article  Google Scholar 

  24. Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275–292. Springer, Berlin, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308–318. Springer, Berlin, Heidelberg (1998)

    Chapter  Google Scholar 

  26. Paquin, C.: U-prove cryptographic specification v1.1. Technical report, Microsoft Corporation (2011)

    Google Scholar 

  27. Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Berlin, Heidelberg (1996). http://dx.doi.org/10.1007/3-540-68339-9_33

    Chapter  Google Scholar 

  28. Raya, M., Hubaux, J.P.: Securing vehicular ad hoc networks. J. Comput. Secur. 15, 39–68 (2007)

    Google Scholar 

  29. Rottondi, C., Mauri, G., Verticale, G.: A protocol for metering data pseudonymization in smart grids. Trans. Emerg. Telecommun. Technol. 26(5), 876–892 (2015). doi:10.1002/ett.2760

    Article  Google Scholar 

  30. Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4, 161–174 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  31. Zhang, C., Lu, R., Lin, X., Ho, P.H., Shen, X.: An efficient identity-based batch verification scheme for vehicular sensor networks. In: INFOCOM, pp. 246–250. IEEE (2008)

    Google Scholar 

Download references

Acknowledgments

Research described in this paper was financed by the National Sustainability Program under grant LO1401, the Czech Science Foundation under grant no. 14-25298P “Research into cryptographic primitives for secure authentication and digital identity protection” and by Technology Agency of the Czech Republic project TA04010476 “Secure Systems for Electronic Services User Verification”. For the research, infrastructure of the SIX Center was used.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Hajny .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Hajny, J., Dzurenda, P., Malina, L. (2016). Privacy-Enhanced Data Collection Scheme for Smart-Metering. In: Lin, D., Wang, X., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2015. Lecture Notes in Computer Science(), vol 9589. Springer, Cham. https://doi.org/10.1007/978-3-319-38898-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-38898-4_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-38897-7

  • Online ISBN: 978-3-319-38898-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics