2017
DOI: 10.1007/978-3-319-59463-7_52
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Identity-Based Homomorphic Signature Scheme for Network Coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…To alleviate the burden of certificate management, some schemes are proposed based on an identity-based public cryptosystem. [18][19][20]35,36] are concerned with identity-based linearly homomorphic signature schemes for network coding against pollution attacks. Jiang et al proposed a dynamic-identity-based signature scheme for secure network coding which it can rapidly detect/drop the corrupted data packets [35].…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…To alleviate the burden of certificate management, some schemes are proposed based on an identity-based public cryptosystem. [18][19][20]35,36] are concerned with identity-based linearly homomorphic signature schemes for network coding against pollution attacks. Jiang et al proposed a dynamic-identity-based signature scheme for secure network coding which it can rapidly detect/drop the corrupted data packets [35].…”
Section: Related Workmentioning
confidence: 99%
“…Sadrhaghighi [19] proposed a structural thought without a specific scheme, and Zhang et al. [20] presented an identity‐based linearly homomorphic signature schemes in which the construction method is similar to the study by Boneh et al. [14].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, to the best of our knowledge, constructions of identity-based homomorphic signatures (IBHS) have been few and far between. In particular, a major drawback of the known IBHS scheme is that they either handle only linear functions [11] [12], [13], [14] or they satisfy only the notion of selective security [15], where an adversary announces the identity it will attack at the beginning of the security experiment, or they have the size of large public key parameter that is linearly related to the size of the dataset [15]. In this paper, our goal is to overcome these limitations and construct an identity-based full homomorphic signature (IBFHS) for all circuits, which is strongly unforgeable against adaptively chosen identity and dataset attack, based on the small integer solution (SIS) problem on arbitrary lattices.…”
Section: Introductionmentioning
confidence: 99%