Journal article
Provably Secure (Broadcast) Homomorphic Signcryption
International Journal of Foundations of Computer Science, Vol.30(4), pp.511-529
2019
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.
Details
- Title
- Provably Secure (Broadcast) Homomorphic Signcryption
- Authors/Creators
- F. Rezaeibagha (Author/Creator)Y. Mu (Author/Creator)S. Zhang (Author/Creator)X. Wang (Author/Creator)
- Publication Details
- International Journal of Foundations of Computer Science, Vol.30(4), pp.511-529
- Publisher
- World Scientific Publishing Co.
- Identifiers
- 991005544364507891
- Copyright
- © 2019 World Scientific Publishing Co Pte Ltd
- Murdoch Affiliation
- Information Technology, Mathematics and Statistics
- Language
- English
- Resource Type
- Journal article
Metrics
92 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Citation topics
- 4 Electrical Engineering, Electronics & Computer Science
- 4.187 Security Systems
- 4.187.160 Cryptographic Protocols
- Web Of Science research areas
- Computer Science, Theory & Methods
- ESI research areas
- Computer Science