Skip to main content
SpringerLink
Log in

Secure Multi-receiver Communications: Models, Proofs, and Implementation

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11944))

Abstract

With the demand of providing message authentication and confidentiality as well as receiver anonymity in applications such as multicast communication, digital content distribution systems, and pay-per-view channels, many anonymous multi-receiver signcryption mechanisms have been put forward to offer these functions efficiently, which have the lower computational cost and communication overhead compared with the signature-then-encryption approaches. However, most certificateless-based schemes either focus on providing receiver anonymity or focus on improving signcryption efficiency. In addition, most certificateless-based schemes rely on bilinear pairing operations, which are more time consuming than modular exponentiation and scalar multiplication in finite fields. In this paper, we propose a practical anonymous multi-receiver certificateless signcryption (AMCLS) scheme that can satisfy message confidentiality, source authentication, and anonymity simultaneously and efficiently. In the proposed scheme, the sender’s signcryption cost increases linearly with the increase of the designated receivers, while the unsigncryption cost per receiver is constant. The adoption of elliptic curve scalar multiplication instead of bilinear pairing operation improves the efficiency of the proposed scheme. Both the sender and receivers’ identities are encrypted from being exposed to offer anonymity. Through security analysis, our proposal can be proved to achieve chosen-ciphertext attack (CCA) security in encryption indistinguishability and receiver anonymity in strong, commonly accepted attack models. Theoretical analyses and experimental results demonstrate that our scheme enjoys a better efficiency than other certificateless-based schemes.

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

Access this chapter

Log in via an institution
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 shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Chapter  Google Scholar 

  2. Malone-Lee, J.: Identity-based signcryption. Cryptology ePrint Archive, Report 2002/098 (2002)

    Google Scholar 

  3. Boyen, X.: Multipurpose identity-based signcryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 383–399. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45146-4_23

    Chapter  Google Scholar 

  4. Chen, L., Malone-Lee, J.: Improved identity-based signcryption. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 362–379. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-30580-4_25

    Chapter  Google Scholar 

  5. Yu, Y., Yang, B., Huang, X., Zhang, M.: Efficient identity-based signcryption scheme for multiple receivers. In: Xiao, B., Yang, L.T., Ma, J., Muller-Schloer, C., Hua, Y. (eds.) ATC 2007. LNCS, vol. 4610, pp. 13–21. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73547-2_4

    Chapter  Google Scholar 

  6. Sharmila Deva Selvi, S., Sree Vivek, S., Shukla, D., Pandu Rangan, C.: Efficient and provably secure certificateless multi-receiver signcryption. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol. 5324, pp. 52–67. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88733-1_4

    Chapter  Google Scholar 

  7. Sharmila Deva Selvi, S., Sree Vivek, S., Srinivasan, R., Pandu Rangan, C.: An efficient identity-based signcryption scheme for multiple receivers. In: Takagi, T., Mambo, M. (eds.) IWSEC 2009. LNCS, vol. 5824, pp. 71–88. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04846-3_6

    Chapter  MATH  Google Scholar 

  8. Elkamchouchi, H., Abouelseoud, Y.: An efficient provably secure multi-recipient identity-based signcryption scheme. In: 2009 International Conference on Networking and Media Convergence, pp. 70–75. IEEE, Cairo, Egypt (2009)

    Google Scholar 

  9. Lal, S., Kushwah, P.: Anonymous ID based signcryption scheme for multiple receivers. IACR Cryptology ePrint Archive 345 (2009)

    Google Scholar 

  10. Fan, C.I., Huang, L.Y., Ho, P.H.: Anonymous multireciever identity-based encryption. IEEE Trans. Comput. 59, 1239–1249 (2010)

    Article  MathSciNet  Google Scholar 

  11. Wang, H., Zhang, Y., Xiong, H., Qin, B.: Cryptanalysis and improvements of an anonymous multi-receiver identity-based encryption scheme. IET Inf. Secur. 6(1), 20–27 (2012)

    Article  Google Scholar 

  12. Chien, H.-Y.: Improved anonymous multi-receiver identity-based encryption. Comput. J. 55(4), 439–446 (2012)

    Article  Google Scholar 

  13. Zhang, J., Xu, Y.: Comment on anonymous multi-receiver identity-based encryption scheme. In: Proceedings of International Conference on Intelligent Networking and Collaborative Systems, Bucharest, Romania, pp. 473–476, September 2012

    Google Scholar 

  14. Li, H., Pang, L.: Cryptanalysis of Wang et al.’s improved anonymous multi-receiver identity-based encryption scheme. IET Inf. Secur. 8(1), 8–11 (2014)

    Article  Google Scholar 

  15. Pang, L., Gao, L., Li, H., Wang, Y.: Anonymous multi-receiver ID-based signcryption scheme. IET Inf. Secur. 9(3), 194–201 (2015)

    Article  Google Scholar 

  16. Tseng, Y.-M., Huang, Y.-H., Chang, H.-J.: Privacy-preserving multireceiver ID-based encryption with provable security. Int. J. Commun Syst 27(7), 1034–1050 (2014)

    Article  Google Scholar 

  17. Fan, C.I., Tseng, Y.F.: Anonymous multi-receiver identity-based authenticated encryption with CCA security. Symmetry 7(4), 1856–1881 (2015)

    Article  MathSciNet  Google Scholar 

  18. Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40061-5_29

    Chapter  Google Scholar 

  19. Barbosa, M., Farshim, P.: Certificateless signcryption. In: Abe, M., Gligor, V. (eds.) Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security (ASIACCS 2008), pp. 369–372. ACM, New York (2008)

    Google Scholar 

  20. Aranha, D., Castro, R., Lopez, J., et al.: Efficient certificateless signcryption. http://sbseg2008.inf.ufrgs.br/proceedings/data/pdf/st0301resumo.pdf

  21. Wu, C., Chen, Z.: A new efficient certificateless signcryption scheme. In: Proceedings of IEEE International Symposium on Information Science and Engineering, Shanghai, China, pp. 661–664 (2008)

    Google Scholar 

  22. Xie, W., Zhang, Z.: Efficient and provably secure certificateless signcryption from bilinear maps. Cryptology ePrint Archive, Report 2009/578 (2009)

    Google Scholar 

  23. Sharmila Deva Selvi, S., Sree Vivek, S., Pandu Rangan, C.: Security weaknesses in two certificateless signcryption schemes. Cryptology ePrint Archive, Report 2010/92 (2010)

    Google Scholar 

  24. Barreto, P., Deusajute, A.M., Cruz, E.D.S., et al.: Toward efficient certificateless signcryption from (and without) bilinear pairings. http://sbseg2008.inf.ufrgs.br/anais/data/pdf/st0303artigo.pdf

  25. Liu, Z., Hu, Y., Zhang, X., Ma, H.: Certificateless signcryption scheme in the standard model. Inf. Sci. 180(3), 452–464 (2010)

    Article  MathSciNet  Google Scholar 

  26. Miao, S., Zhang, F., Li, S., Mu, Y.: On security of a certificateless signcryption scheme. Inf. Sci. 232, 475–481 (2013)

    Article  MathSciNet  Google Scholar 

  27. Islam, S.K., Khan, M.K., Al-Khouri, A.M.: Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing. Secur. Commun. Netw. https://doi.org/10.1002/sec.1165.

  28. Hung, Y.H., Huang, S.S., Tseng, Y.M., Tsai, T.T.: Efficient anonymous multireceiver certificateless encryption. IEEE Syst. J. 99, 1–12 (2015)

    Google Scholar 

  29. Tseng, Y.F., Fan, C.I.: Provably CCA-Secure Anonymous Multi-Receiver Certificateless Authenticated Encryption

    Google Scholar 

  30. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62–73 (1993)

    Google Scholar 

  31. He, D., Wang, H., Wang, L., et al.: Efficient certificateless anonymous multi-receiver encryption scheme for mobile devices. Soft. Comput. 21, 6801–6810 (2016)

    Article  Google Scholar 

  32. Ronghai, G., Jiwen, Z., Lunzhi, D.: Efficient certificateless anonymous multi-receiver encryption scheme without bilinear parings. Math. Prob. Eng. 2018, 1–13 (2018)

    Article  MathSciNet  Google Scholar 

  33. OpenSSL Homepage. https://www.openssl.org/

  34. PBC Library. https://crypto.stanford.edu/pbc/download.html/

Download references

Acknowledgment

This work was supported by National Natural Science Foundation of China (Grant No. 61602475), National Cryptographic Foundation of China (Grant No. MMJJ20170212), the National S & T Major Project of China (No. 2018ZX09201011), National Natural Science Foundation of China (No. 61802395).

Author information

Authors and Affiliations

  1. State Key Laboratory of Information Security, Institute of Information Engineering, CAS, Beijing, China

    Maomao Fu, Xiaozhuo Gu, Wenhao Dai & Jingqiang Lin

  2. School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China

    Maomao Fu & Wenhao Dai

  3. Insurance Supervision and Administration Commission of Bank of China, Beijing, China

    Han Wang

Authors
  1. Maomao Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaozhuo Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenhao Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jingqiang Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Han Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaozhuo Gu .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Software Engineering, Swinburne University of Technology, Hawthorn, Melbourne, VIC, Australia

    Sheng Wen

  2. School of Computer Science, The University of Sydney, Camperdown, NSW, Australia

    Albert Zomaya

  3. Department of Computer Science, St. Francis Xavier University, Antigonish, NS, Canada

    Laurence T. Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fu, M., Gu, X., Dai, W., Lin, J., Wang, H. (2020). Secure Multi-receiver Communications: Models, Proofs, and Implementation. In: Wen, S., Zomaya, A., Yang, L. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2019. Lecture Notes in Computer Science(), vol 11944. Springer, Cham. https://doi.org/10.1007/978-3-030-38991-8_45

Download citation

Publish with us

Policies and ethics

Search

Navigation