DOI: 10.29007/cfc9
|View full text |Cite
|
Sign up to set email alerts
|

On Designing Secured Communication Protocols along with Anonymity for CRT based Structured P2P Network Architecture

Abstract: In this work, we have considered designing secured communication protocols for Chinese remainder theorem based structured p2p architecture. Such an architecture has been the choice because of the complexity in Inter or Intra group communications are just O(1) [16]. In this work, we have considered efficient way to make the already existing communication protocols [16] secured. We have extended these protocols further to include anonymity. We have considered security separately for multicasting inside a group a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…In the movie "Eternal Sunshine of the Spotless Mind," the erasure of memory is portrayed through bizarre visual sequences. These figurative visual effects not only assist in moving the storyline along but also contribute to the overall thematic richness of the story (Maddali et al, 2021a).…”
mentioning
confidence: 99%
“…In the movie "Eternal Sunshine of the Spotless Mind," the erasure of memory is portrayed through bizarre visual sequences. These figurative visual effects not only assist in moving the storyline along but also contribute to the overall thematic richness of the story (Maddali et al, 2021a).…”
mentioning
confidence: 99%
“…It means that, in the overlay network, Ci h /p will appear logically in both the clusters Ci and Ck, and will have direct logical connections to all member peers of clusters Ci and Ck. Therefore, it should be clear that our already reported intra and inter-cluster data-lookup protocols [22], [19] do not need any modification in this scenario. Same is true for broadcasting involving the cluster-heads in the tree.…”
Section: Peer With Multiple Existing Resource Typesmentioning
confidence: 95%
“…Observation 3: Number of required symmetric keys (N'') for secured communication inside a cluster is the number of peers present in the cluster not counting the cluster-head. This number N'' is much larger than N' because number of peers in a cluster is supposed to be very large compared to the number of distinct resource types [22].…”
Section: Public and Symmetric Key-based Secured Communicationmentioning
confidence: 99%
“…Public key cryptography algorithms, on the other hand, are also known as asymmetric key algorithms. This version employs a pair of keys, one for encryption and the other for decryption [13].…”
Section: Introductionmentioning
confidence: 99%