Supercharge Your Innovation With Domain-Expert AI Agents!

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

Active Publication Date: 2014-12-17
云南友脉科技有限公司
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

With the rapid development of P2P technology, the peer-to-peer network has become an efficient platform for distributed applications, and various P2P applications account for more than 60% of the current total network traffic, so high availability is an important guarantee for maintaining the efficient operation of the P2P system; but In the P2P network, since the nodes can join and exit freely, the jitter phenomenon of the network is relatively serious, and the failure of the node gradually exposes its problems: when the reputation node in the P2P network fails, it will not only affect the normal operation of the reputation system The restoration of reputation data will also affect the service quality of the P2P system. If a small number of highly connected reputation nodes fail, the entire reputation system will collapse
However, in the P2P network, there are relatively few studies on the storage and recovery of node reputation data in the existing literature, and this kind of research lacks the consideration of node credibility and interactive behavior. For example, nodes with poor credibility or bad behavior can pass Modify the reputation information of nodes to achieve the purpose of interactive deception and service fraud, thus affecting the stable operation of the network
Xiangzhan Y(, 2008, 1590-1594); Pitkanen M(, 2006, 185); Wang Y(, 2007, 499-505); in the data recovery method based on fixed-threshold secret sharing, since the threshold value in secret sharing is fixed, the data can only be recovered when all participants participate at the same time, which will be unfavorable to nodes Dynamically changing P2P network; in the secret sharing method based on fixed weight, the secret sharing scheme of fixed weight lacks the consideration of reputation node behavior and storage cost, because as time goes by, different interactive nodes should have different weights, Moreover, the storage performance of each node in the P2P network is also different, especially the storage space of the handheld mobile node is more precious, the smaller the storage space, the higher the storage cost

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • P2P reputation data restoring method based on dynamic secret sharing
  • P2P reputation data restoring method based on dynamic secret sharing
  • P2P reputation data restoring method based on dynamic secret sharing

Examples

Experimental program
Comparison scheme
Effect test

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 ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a P2P reputation data restoring method based on the dynamic secret sharing and belongs to the technical field of P2P technology and information processing. The method includes firstly calculating initial node comprehensive indexes, and recalculating the initial node comprehensive indexes according to a reputation value; selecting node sets with better comprehensive indexes to participate reputation data share storage, and distributing the reputation data shares to the selected node sets; when P2P network nodes enter freely or neighbor nodes exist, selecting the node sets participating reputation data restoring, establishing a reputation data restoring polynomial, and calculating the current reputation data. By the aid of the method, the reputation data loss problem caused by reputation node failures can be prevented dynamically through distribution and restore of the reputation data, P2P network jitter and bad influence of reputation data tampering by fixed weight nodes can be overcome effectively by changing the neighbor node number and weight dynamically, and the method has the advantages of safety, effectiveness and practicality.

Description

technical field [0001] The present invention relates to a P2P reputation data recovery method based on dynamic secret sharing, which involves the initialization of node weight and storage cost in the P2P network, the calculation of node reputation data, the calculation and update of node weight, and especially relates to the distribution and recovery of P2P network reputation data The method belongs to the field of P2P technology and information processing technology. Background technique [0002] P2P (Peer-To-Peer) network is called a peer-to-peer network, which is a network group composed of computing entities with the same status and capable of providing certain types of services. In information science, reputation refers to the overall image and comprehensive evaluation of nodes based on their historical behavior or intentions. It reflects the trustworthiness of participants, that is, the trust degree of nodes, and is a measure of node trust. The reputation affects the ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/08H04L29/06
Inventor 付晓东葛佳刘骊
Owner 云南友脉科技有限公司
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More