Provably secure (broadcast) homomorphic signcryption

Authors

Fatemeh Rezaeibagha, University of WollongongFollow
Yi Mu, Fujian Normal University, University of WollongongFollow
Shiwei Zhang, University of WollongongFollow
Xiaofen Wang, University of Electronic Science and Technology of ChinaFollow

RIS ID

137088

Publication Details

Rezaeibagha, F., Mu, Y., Zhang, S. & Wang, X. (2019). Provably secure (broadcast) homomorphic signcryption. International Journal of Foundations of Computer Science, 30 (4), 511-529.

Abstract

Signcryption has drawn a lot of attention due to its useful applications in many areas, in particular for applications where the computation and communication resources are constrained, for example, for lightweight devices. The traditional signcryption scheme does not support the homomorphic property. Recent work by Rezaeibagha et al. (Provsec 2017) offered a provably secure homomorphic signcryption scheme, in which for the first time, provided a scheme provably secure under some restriction. In this paper, we show that the homomorphic signcryption can be extended to provably secure broadcast signcryption scheme. We allow the broadcasted signcrypted data items to be aggregated without requiring decryption that is a desirable feature in distributed environments.