SpringerLink
Log in

Provably Secure Homomorphic Signcryption

  • Conference paper
  • First Online:
Provable Security (ProvSec 2017)

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

Included in the following conference series:

Abstract

Signcryption has shown many useful applications, in particular for the environment where the computation and communication resources are constrained, for instance, for applications on lightweight devices. However, we notice that traditional signcryption schemes do not support homomorphic properties, which are very useful in many application scenarios. We also notice that the previous attempt of capturing the homomorphism in signcryption is not provably secure. In this paper, we propose a provably secure additive homomorphic signcryption. Our scheme offers the following two features: (1) Signing and encrypting are carried out in one go, unlike the traditional encryption and signature schemes which are computed separately. (2) We allow the collected signcrypted data items to be aggregated without requiring decryption. The second feature confirms the significance of the first feature in that the traditional signcryption cannot be applied due to lacking of the homomorphic property. Our scheme is the first provably secure signcryption that supports homomorphic property.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.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
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bilogrevic, I., Jadliwala, M., Joneja, V., Kalkan, K., Hubaux, J., Aad, I.: Privacy-preserving optimal meeting location determination on mobile devices. IEEE Trans. Inf. Forensics Secur. 9(7), 1141–1156 (2014)

    Article  Google Scholar 

  2. Boneh, D., Gentry, C., Gorbunov, S., Halevi, S., Nikolaenko, V., Segev, G., Vaikuntanathan, V., Vinayagamurthy, D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533–556. Springer, Heidelberg (2014). doi:10.1007/978-3-642-55220-5_30

    Chapter  Google Scholar 

  3. Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005). doi:10.1007/978-3-540-30576-7_18

    Chapter  Google Scholar 

  4. Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 1–13. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36362-7_1

    Chapter  Google Scholar 

  5. Chan, Y.-Y., Li, J.: BGN authentication and its extension to convey message commitments. In: Gavrilova, M., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3982, pp. 365–374. Springer, Heidelberg (2006). doi:10.1007/11751595_40

    Chapter  Google Scholar 

  6. Cheon, J.H., Stehlé, D.: Fully homomophic encryption over the integers revisited. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 513–536. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46800-5_20

    Google Scholar 

  7. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985). doi:10.1007/3-540-39568-7_2

    Chapter  Google Scholar 

  8. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May–2 June 2009, pp. 169–178. ACM (2009)

    Google Scholar 

  9. Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75–92. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40041-4_5

    Chapter  Google Scholar 

  10. Han, S., Zhao, S., Li, Q., Ju, C., Zhou, W.: PPM-HDA: privacy-preserving and multifunctional health data aggregation with fault tolerance. IEEE Trans. Inf. Forensics Secur. 11(9), 1940–1955 (2016)

    Article  Google Scholar 

  11. Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244–262. Springer, Heidelberg (2002). doi:10.1007/3-540-45760-7_17

    Chapter  Google Scholar 

  12. Liu, J., Huang, X., Liu, J.K.: Secure sharing of personal health records in cloud computing: Ciphertext-policy attribute-based signcryption. Future Gener. Comp. Syst. 52, 67–76 (2015)

    Article  Google Scholar 

  13. Nuida, K., Kurosawa, K.: (Batch) Fully homomorphic encryption over integers for non-binary message spaces. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 537–555. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46800-5_21

    Google Scholar 

  14. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). doi:10.1007/3-540-48910-X_16

    Google Scholar 

  15. Rao, Y.S.: A secure and efficient ciphertext-policy attribute-based signcryption for personal health records sharing in cloud computing. Future Gener. Comp. Syst. 67, 133–151 (2017)

    Article  Google Scholar 

  16. Wang, X.: One-round secure fair meeting location determination based on homomorphic encryption. Inf. Sci. 372, 758–772 (2016)

    Article  Google Scholar 

  17. Yi, X., Bouguettaya, A., Georgakopoulos, D., Song, A., Willemson, J.: Privacy protection for wireless medical sensor data. IEEE Trans. Dependable Sec. Comput. 13(3), 369–380 (2016)

    Article  Google Scholar 

  18. Zhang, P., Yu, J., Liu, H.: A homomorphic signcryption scheme and its application in electronic voting. J. Shenzhen Univ. Sci. Eng. 28, 489–494 (2011)

    Google Scholar 

  19. Zheng, Y.: Digital signcryption or how to achieve cost(signature & encryption) \(\ll \) cost(signature) + cost(encryption). In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997). doi:10.1007/BFb0052234

    Chapter  Google Scholar 

Download references

Acknowledgement

We would like to thank the reviewers for constructive comments and Willy Susilo for the valuable discussions. The forth author was supported by the National Natural Science Foundation of China under Grants 61502086, the foundation from Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems (No. YF16202) and the foundation from Guangxi Key Laboratory of Trusted Software (No. PF16116X).

Author information

Authors and Affiliations

  1. School of Computing and Information Technology, Institute of Cybersecurity and Cryptology, University of Wollongong, Wollongong, Australia

    Fatemeh Rezaeibagha, Yi Mu & Shiwei Zhang

  2. Department of Computer Science and Engineering, Center for Cyber Security, University of Electronic Science and Technology of China, Chengdu, 611731, Sichuan, China

    **aofen Wang

  3. Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems and Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, 541004, Gunagxi, China

    **aofen Wang

Authors
  1. Fatemeh Rezaeibagha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shiwei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. **aofen Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Fatemeh Rezaeibagha or **aofen Wang .

Editor information

Editors and Affiliations

  1. NTT Laboratories, Tokyo, Japan

    Tatsuaki Okamoto

  2. Shaanxi Normal University, **’an, China

    Yong Yu

  3. Hong Kong Polytechnic University, Hong Kong, China

    Man Ho Au

  4. University of Wollongong, Wollongong, New South Wales, Australia

    Yannan Li

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Rezaeibagha, F., Mu, Y., Zhang, S., Wang, X. (2017). Provably Secure Homomorphic Signcryption. In: Okamoto, T., Yu, Y., Au, M., Li, Y. (eds) Provable Security. ProvSec 2017. Lecture Notes in Computer Science(), vol 10592. Springer, Cham. https://doi.org/10.1007/978-3-319-68637-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68637-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68636-3

  • Online ISBN: 978-3-319-68637-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation