Certificateless network coding scheme from certificateless public auditing protocol

In recent years, network coding has received extensive attention and has been applied to various computer network systems, since it has been mathematically proven to enhance the network robustness and maximize the network throughput. However, it is well-known that network coding is extremely vulnera...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of supercomputing Ročník 79; číslo 3; s. 2570 - 2602
Hlavní autoři: Bian, Genqing, Song, Mingxuan, Shao, Bilin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2023
Springer Nature B.V
Témata:
Cloud computing
Coding
Compilers
Computer Science
Cryptography
Data integrity
Digital signatures
Internet of Things
Interpreters
Pollution
Privacy
Processor Architectures
Programming Languages
Protocol
Public Key Infrastructure
Certificateless public auditing
Linearly homomorphic signature
Certificateless network coding
ISSN:0920-8542, 1573-0484
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In recent years, network coding has received extensive attention and has been applied to various computer network systems, since it has been mathematically proven to enhance the network robustness and maximize the network throughput. However, it is well-known that network coding is extremely vulnerable to pollution attacks. Certificateless network coding scheme (CLNS) is a recently proposed mechanism to defend against pollution attacks for network coding, which avoids tedious management of certificates and key-escrow attack. Until now, only a few constructions were presented, and more ones should be given so as to enrich this field. In this paper, for the first time, we study the general construction of CLNS from certificateless public auditing protocol (CL-PAP), although the two areas seem to be quite different in their nature and are studied independently. Since there are many candidates of CL-PAPs, we can naturally obtain abundant constructions of CLNSs according to our systematic way. In addition, in order to show the power of the general construction, we also present a concrete implementation given a specific CL-PAP. The performance analysis and experimental results show that the implemented CLNS is competitive in the existing network coding schemes.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-022-04719-6