2015 IEEE 35th International Conference on Distributed Computing Systems Workshops 2015
DOI: 10.1109/icdcsw.2015.14
|View full text |Cite
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 15 publications
0
7
0
Order By: Relevance
“…Murakami et al propose using disjoint paths to thwart eavesdropping (Murakami et al 2015). The selection of disjoint paths is made more complicated in D2D networks, because it is not just the disjointness of nodes that is important, but also the disjointness of their broadcast ranges.…”
Section: Multipath Routing and Securitymentioning
confidence: 99%
“…Murakami et al propose using disjoint paths to thwart eavesdropping (Murakami et al 2015). The selection of disjoint paths is made more complicated in D2D networks, because it is not just the disjointness of nodes that is important, but also the disjointness of their broadcast ranges.…”
Section: Multipath Routing and Securitymentioning
confidence: 99%
“…As stated earlier, this method is referred to as the "Existing method." Additionally, our proposed method shares basic concepts with the method in paper [7]. In this paper, this method is referred to as the "notification rebroadcasting method."…”
Section: Overviewmentioning
confidence: 99%
“…In the (k, n) threshold scheme, k and n are the threshold number and the number of shares, respectively. k and n are positive integers and n must be greater than or equal to k. When we encrypt the original information, say S, n versions of encrypted data packets will be created from S. For the encryption, we calculate shares using the following equation (1): [7].…”
Section: Outline Of the Secure Dispersed Data Transfer Methodsmentioning
confidence: 99%
See 2 more Smart Citations