2019
DOI: 10.1109/mnet.2018.1800177
|View full text |Cite
|
Sign up to set email alerts
|

Secure Emergent Data Protection Scheme for a Space-Terrestrial Integrated Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 20 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…Since the group scale and dynamics highly influence the network overhead, the proposed scheme exploits a logical key hierarchy (LKH) to reduce the life-cycle key management costs. For the marine-based STIN scenario, Shen et al in [24] design a secure emergency data protection scheme. Specifically, the proposed scheme exploits a block-design-based key agreement to achieve efficient communication among the satellites.…”
Section: B Communication Overheadsmentioning
confidence: 99%
“…Since the group scale and dynamics highly influence the network overhead, the proposed scheme exploits a logical key hierarchy (LKH) to reduce the life-cycle key management costs. For the marine-based STIN scenario, Shen et al in [24] design a secure emergency data protection scheme. Specifically, the proposed scheme exploits a block-design-based key agreement to achieve efficient communication among the satellites.…”
Section: B Communication Overheadsmentioning
confidence: 99%
“…In general, encryption algorithms can be divided into asymmetric encryption and symmetric encryption algorithms. Shen et al [109] used the asymmetric encryption algorithm to realize a secure transmission of messages. This algorithm encrypts the address and payload using different keys, and satellite nodes can only obtain address information.…”
Section: Confidential Information Exchangementioning
confidence: 99%
“…In the ECC cryptography system [6], the elliptic curve equation is defined as E p (a, b): y 2 = x 3 + ax + b (mod p) over F p , where b ∈ F p , p > 3 and 4a 3 + 27b 2 (mod p) is not equal to 0. In general, the security of ECC depends on the following difficult problems [22][23][24][25][26].…”
Section: Elliptic Curve Cryptographymentioning
confidence: 99%