P2P reputation data restoring method based on dynamic secret sharing
A technology of secret sharing and recovery method, applied in the field of P2P reputation data recovery, P2P network reputation data distribution and recovery, can solve the problems of unfavorable node dynamic change P2P network, high storage cost, network jitter, etc., to avoid interactive fraud and reputation The effect of information tampering, improving service quality, ensuring security and effectiveness
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0044] Embodiment 1: as Figure 1-3 As shown, a P2P reputation data recovery method based on dynamic secret sharing, the specific steps of the method are as follows:
[0045] A. According to the number of routing hops, take one of the nodes as the center, divide the nodes in the P2P network into different multicast domains, and initialize the weight W of the multicast domain nodes i f and storage cost According to the weight W i f and storage cost Calculate the initial comprehensive index V of the node i f ;
[0046] B. Select any node in the multicast domain as the distribution node of the reputation data share, and calculate the node reputation value T according to the interaction of nodes in the domain i f , and then use T i f Re-divide the node weight and recalculate the comprehensive index V of the node i r ;
[0047] C. According to the updated comprehensive index V i r , using the selection ratio d, select the comprehensive index V i r A better node ...
Embodiment 2
[0054] Embodiment 2: as Figure 1-3 As shown, a P2P reputation data recovery method based on dynamic secret sharing, the specific steps of the method are as follows:
[0055] A. According to the number of routing hops, take one of the nodes as the center, divide the nodes in the P2P network into different multicast domains, and initialize the weight W of the multicast domain nodes i f and storage cost According to the weight W i f and storage cost Calculate the initial comprehensive index V of the node i f ;
[0056] B. Select any node in the multicast domain as the distribution node of the reputation data share, and calculate the node reputation value T according to the interaction of nodes in the domain i f , and then use T i f Re-divide the node weight and recalculate the comprehensive index V of the node i r ;
[0057] C. According to the updated comprehensive index V i r , using the selection ratio d, select the comprehensive index V i rA better node s...
Embodiment 3
[0070] Embodiment 3: as Figure 1-3 As shown, a P2P reputation data recovery method based on dynamic secret sharing, the specific steps of the method are as follows:
[0071] A. According to the number of routing hops, take one of the nodes as the center, divide the nodes in the P2P network into different multicast domains, and initialize the weight W of the multicast domain nodes i f and storage cost According to the weight W i f and storage cost Calculate the initial comprehensive index V of the node i f ;
[0072] B. Select any node in the multicast domain as the distribution node of the reputation data share, and calculate the node reputation value T according to the interaction of nodes in the domain i f , and then use T i f Re-divide the node weight and recalculate the comprehensive index V of the node i r ;
[0073] C. According to the updated comprehensive index V i r , using the selection ratio d, select the comprehensive index V i r A better node ...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com