CN104219291B - A kind of P2P reputation data restoration methods based on dynamic secret sharing - Google Patents
A kind of P2P reputation data restoration methods based on dynamic secret sharing Download PDFInfo
- Publication number
- CN104219291B CN104219291B CN201410411698.6A CN201410411698A CN104219291B CN 104219291 B CN104219291 B CN 104219291B CN 201410411698 A CN201410411698 A CN 201410411698A CN 104219291 B CN104219291 B CN 104219291B
- Authority
- CN
- China
- Prior art keywords
- node
- reputation data
- neighbor
- weight
- reputation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Storage Device Security (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of P2P reputation data restoration methods based on dynamic secret sharing, belong to P2P technologies and technical field of information processing.Calculate node initial synthetic index first, the overall target of node is recalculated further according to credit value, the preferable set of node of overall target is selected to participate in the storage of reputation data share, reputation data share is distributed to the set of node selected, when P2P network nodes are freely added or neighbor node is exited, selection participates in recovering the set of node of reputation data, and construction reputation data recovers multinomial, calculates reputation data now.The present invention prevents prestige node failure by dynamically realizing distribution and recovery to reputation data and causes reputation data to lose problem, effectively coped with by dynamic change neighbor node number and weight P2P network jitters phenomenon and fixed weight node to reputation data tamper band come harmful effect, there is security, validity, practicality.
Description
Technical field
The present invention relates to a kind of P2P reputation data restoration methods based on dynamic secret sharing, it is related to P2P nodes
Initialization, the calculating of node reputation data, the calculating of node weights and the renewal of weight and storage cost, more particularly to P2P nets
Network reputation data is distributed and restoration methods, belongs to P2P technologies and technical field of information processing.
Background technology
P2P (Peer-To-Peer) network is referred to as peer-to-peer network, and it is that have identical status by some, can provide certain class
The network colony of the computational entity composition of service.In information science, prestige refers to the historical behavior or intention shape according to node
The pan-image and overall merit of paired node, it embodies the degree of belief of the confidence level of participant, i.e. node, is to section
A kind of measurement that point is trusted.Prestige influences trusting relationship, and trusting relationship determines the interaction between node, interaction results influence prestige
Value；When credit value is higher, show that the node is easier to be trusted, thus it is selected higher as the possibility of interaction node,
Therefore it can effectively promote to cooperate between node.Trust is subjective, transmission of having ready conditions, dynamic change, it is one
Expectation of the participant to another participant's future behaviour.Credit value is based on service quality carried out in the past between node
Statistics.With developing rapidly for P2P technologies, peer-to-peer network has become the efficient platform of a Distributed Application, and all kinds of P2P should
With occupying more than the 60% of current network total flow, so high availability is the important leverage for maintaining the operation of P2P system high efficiencies；
But in P2P networks, because node freely can be added and exit, thus network jitter phenomenon than more serious, node
The problem of failure also gradually exposes it：When the prestige node failure in P2P networks, the normal of credit system can be not only influenceed
Operation and the recovery of reputation data, can also influence the service quality of P2P systems, if the high prestige node failure of a small number of Connected degrees
Whole credit system can be then caused to collapse.
Persistent data storage is an important field of research of P2P storage systems, and it relates generally to data redundancy, number
In terms of distribution, data safety, storage excitation, error detection and data maintenance.The storage and recovery of P2P network credit data
Different from general data storage and recovery, storage and the restoration methods of general data are mainly based upon Disk Backup, copy and recovered
Or teledata is recovered, but it is that storage device expense is big and there is Single Point of Faliure the drawbacks of this method, and P2P networks are believed
Security requirement of the storage of data with recovering reliability and the reputation data storage to node is praised very high, so should avoid single
Storage of the node to reputation data, storage of the particularly bad node to reputation data is easier to cause distorting for reputation data,
And service quality and the effective operation of node interaction of influence P2P networks, to effective profit of P2P nodes memory spaces
With the cost of device of individual node can be reduced.Zhang D(<Emerging Intelligent Data and Web
Technologies>, 2013,21-26) analyze data transmission link and have that cost is high, transmit unstable and Single Point of Faliure etc.
Problem；Therefore general data backup and restoration methods are not suitable for the storage and recovery of P2P network credit data.
Research currently for the storage management of P2P nodes reputation informations is also fewer, and the research done
The storage work of the reputation information of node is mainly undertaken by third party, but when entering the integrity verification of row information, is needed
Want third party simultaneously online, and lack flexibility.Secret sharing techniques are the key technologies in cryptography, are depositing for important information
Storage and recovery provide a kind of effective method, and it mainly splits secret by rights, each part after fractionation
Volume is managed by different participant, single participant can not Restore Secret information, only several participants together cooperate ability
Restore Secret message, when the participant in any of which respective range is gone wrong, secret still can completely be recovered, therefore this
The storage for the reputation data that method has higher requirements to security is with recovering have preferable use value.But in P2P networks
In, existing document is stored with recovering the fewer of research to node reputation data, and this kind of research lacks credible to node
The node of the consideration of degree and interbehavior, such as confidence level difference or delinquency can be reached by changing the reputation information of node
To the purpose of interaction deception and service fraud, so as to influence the sound and stable operation of network.Xiangzhan Y(<International
Conference on Information and Automation>, 2008,1590-1594)；Pitkanen M(<
International Conference on Internet and Web Applications and Services>, 2006,
185)；Wang Y(<Availability, Reliability and Security, 2007>, 2007,499-505)；Based on
In the data reconstruction method of fixed threshold privacy sharing, because threshold value is fixed in privacy sharing, so only when all
Participant, which simultaneously participates in, can just recover data, and this will be unfavorable for the P2P networks of node dynamic change；Based on fixed weight
In privacy sharing method, the secret sharing scheme of fixed weight lacks the consideration to prestige nodes ' behavior and storage cost, because
Over time, different interaction nodes should have the storage performance of each node in different weights, and P2P networks
Also different, the memory space of particularly hand-held mobile node is even more valuable, and its smaller storage cost of memory space is higher.In order to
The storage and recovery of reputation data share is better achieved, there is important Research Significance to the consideration of node storage cost.
The content of the invention
The invention provides a kind of P2P reputation data restoration methods based on dynamic secret sharing, dynamic change is adapted to
P2P networks, the present invention is according to the weight of the different evaluation information updating node of node, it is to avoid the interaction that fixed weight is brought
The problems such as fraud and reputation information are distorted.Meanwhile, this method considers the storage cost that each participates in node, by the way that node is deposited
The node that storage cost is combined to select the high node of overall target as storage or recover reputation data with node weights, so
The memory space of P2P network nodes can be effectively utilized, the recovery of reputation data is simultaneously effective realized and prevents bad section
Point is distorted to reputation data.By effectively being recovered to failure node reputation data in P2P networks, it is ensured that node prestige
The security and validity of data recovery, so as to improve the service quality of P2P networks.
The technical scheme is that：A kind of P2P reputation data restoration methods based on dynamic secret sharing, methods described
Comprise the following steps that：
A, according to hop count centered on one of node, by the node division in P2P networks to different multicasts
Domain, and initialize the weight W of multicast domain nodei fAnd storage costAccording to weight Wi fWith storage costAt the beginning of calculate node
Beginning overall target Vi f；
Any one node is handed over as the distribution node of reputation data share according to domain interior joint in B, selection multicast domain
Mutually, calculate node credit value Ti f, then utilize Ti fRepartition node weights, and the overall target V of calculate node againi r；
C, according to the overall target V after renewali r, using ratio d is chosen, select overall target Vi rPreferable set of node M ginsengs
With the storage of reputation data share, the number of neighbor node is m=n*d in set of node M；
Wherein, n is neighbor node number, n ∈ Z+, M is the preferable set of node of overall target, and m ∈ Z+；
D, basis have selected to participate in the set of node of storage reputation data share, construction reputation data distribution multinomial, i.e. f
(xr)=R+a1xr+...+an(xr)t-1ModP, set of node M is distributed to by reputation data share, then reputation data distribution node
On the reputation data share distributed delete for preventing that reputation data share from repeatedly being distributed, and also to effectively utilize letter
Praise node storage space and recover reputation data；
Wherein, f (xr) it is prestige share, and f (0)=R is met, R is reputation data, and the selection of prime P refers to meet RSA
The security requirement of system, a1, a2..., anIt is the random number in the range of [1, P], xrIt is public value, t is extensive to participate in reputation data
The minimum definite value of multiple node number, 1<T≤m, t ∈ Z+；
E, when P2P network nodes freely add or neighbor node exit when, stochastic and dynamic change multicast domain neighbor node
Total k, selection participates in recovering the set of node N of reputation data；
F, basis have selected to participate in the number g of neighbor node in set of node N, the set of node N of recovery reputation data, have participated in extensive
The participation selected in the set of node N of multiple reputation data recovers number h, h ∈ g, the h ∈ Z of the node of reputation data+, t≤h≤g,
Construct reputation data and recover multinomial, i.e.,Reputation data now is calculated, will be recovered
The reputation data gone out is stored on reputation data distribution node；Letter can just be recovered by only meeting at least t node and simultaneously participating in
Praise data；
Wherein, xrFor public value, xi, xjTo participate in storage prestige share neighbor node mark, and j ∈ Z+。
In the step A, the calculate node initial synthetic index Vi fComprise the following steps that：
A1, by each node weights W in multicast domaini fIt is between can be initialized as in 0.5, i.e. multicast domain each node
Initial trust node between believing and being insincere；
Wherein, W is worked asi f=0 interval scale node is insincere, works as Wi f=0.5 interval scale node between it is credible with it is insincere between
Initial trust value, work as Wi f=1 interval scale node is credible；
A2, equally spaced by the storage cost of P2P network nodesFive classes are divided into, i.e., And the storage cost after dividing is randomly selected according to node storage capacityValue is assigned
To different nodes；
A3, according to initial weight Wi fWith storage costCalculate initial synthetic index Vi f, i.e.,
Wherein, i is that nodes are identified, and i ∈ Z+, f represents to initialize node, and d is according to the initial weight W of considerationi f
With storage costDifference come the selection ratio determined, Wi fThe storage cost of node during initialization is represented,Represent node
Storage cost.
In the step B, the overall target for calculating neighbor nodeComprise the following steps that：
In B1, selection multicast domain any one node as reputation data share distribution node, it is interactive according to node
The credit value T of egressi f, value is
Wherein,Represent that neighbor node carries out the summation of credit rating to reputation data distribution node,Represent neighbours' section
Point carries out the summation of credit rating number of times to reputation data distribution node；
B2, according to Ti fDivide weight Wi r；
As credit value -1≤Ti f<When 0, weight Wi rFor 0；
As credit value Ti fWhen=0, weight Wi rFor 0.5；
When credit value 0<Ti fWhen≤1, weight Wi rFor 1；
The weight W that B3, basis are repartitionedi rWith storage costRecalculate overall target Vi r, i.e.,
In the step E, the selection participates in recovering comprising the following steps that for the set of node N of reputation data：
E1, when increasing neighbor node, repeat step A, initialization newly increases the weight of neighbor node with storage cost simultaneously
Calculate its initial synthetic index；
E1.1 and then repeat step B, is interacted according to node, using the credit value of newly-increased neighbours, recalculates newly-increased neighbours
The weight and overall target of node；
E1.2, according to multicast domain node overall target, using choosing ratio d, the preferable set of node N ginsengs of selection overall target
With the storage of reputation data share, the number of neighbor node is g=k*d in set of node N；
Wherein, k is the node total number after increase neighbor node, k ∈ Z+, N is the preferable set of node of overall target, and g
∈Z+；
E2, when neighbor node is exited or node is insincere, then by neighbor node evaluation information from reputation data distribute save
Deleted on point.
The beneficial effects of the invention are as follows：
1st, neighbor node weight is dynamicallyd update, because neighbor node weight is dynamically become by alternate evaluation information
Change, for the alternate evaluation information of bad neighbor node, its weight can be reduced, therefore the neighbor node of fixed weight can produce friendship
The problems such as mutually fraud and reputation information are distorted.Compared with the known secret sharing scheme based on fixed weight, with security
The characteristics of.
2nd, using node storage cost and the overall target of node weights calculate node, so as to more reasonably select ginseng
With storing the set of node of reputation data share and the set of node of selection participation recovery reputation data, abundant P2P nets are effectively utilized
Network node storage space and the storage and recovery for dynamically realizing reputation data share.With the known node weights of being based only on
Secret sharing scheme is compared, the characteristics of with validity.
3rd, using Dynamic Secret Sharing Scheme, select to store reputation data share by dynamic change neighbor node number
Set of node and selection participate in recovering the set of node of reputation data, can effectively prevent node failure to cause reputation data to be lost and ask
Topic.With it is known backed up based on copy and privacy sharing method based on fixed weight compared with, the characteristics of with practicality.
In a word, the P2P reputation datas restoration methods based on dynamic secret sharing are P2P network credits data distribution with recovering
There is provided method safely, effectively, practical.Bad node can effectively be prevented to Reputation Number by dynamicalling update neighbor node weight
According to distort, be conducive to the sound and stable operation of P2P networks；Neighbor node is weighed by overall target, ginseng can be reasonably selected
With storing the set of node with recovering reputation data, be conducive to rationally utilizing network node memory space；Privacy sharing method is P2P
The storage of network credit data provides a kind of effective technical support with recovering, and can effectively prevent letter caused by node failure
Data loss problem is praised, is conducive to the recovery of reputation data.
Brief description of the drawings
Fig. 1 is method flow diagram in the present invention；
Fig. 2 is the stream in the present invention using the multicast domain progress P2P reputation data share distribution methods with 10 nodes
Cheng Tu；
Fig. 3 is the stream in the present invention using multicast domain nodes dynamic change to participation reputation data restoration methods at 15
Cheng Tu.
Embodiment
Embodiment 1：As Figure 1-3, a kind of P2P reputation data restoration methods based on dynamic secret sharing, the side
Method is comprised the following steps that：
A, according to hop count centered on one of node, by the node division in P2P networks to different multicasts
Domain, and initialize the weight W of multicast domain nodei fAnd storage costAccording to weight Wi fWith storage costAt the beginning of calculate node
Beginning overall target Vi f；
Any one node is handed over as the distribution node of reputation data share according to domain interior joint in B, selection multicast domain
Mutually, calculate node credit value Ti f, then utilize Ti fRepartition node weights, and the overall target V of calculate node againi r；
C, according to the overall target V after renewali r, using ratio d is chosen, select overall target Vi rPreferable set of node M ginsengs
With the storage of reputation data share, the number of neighbor node is m=n*d in set of node M；
Wherein, n is neighbor node number, n ∈ Z+, M is the preferable set of node of overall target, and m ∈ Z+；
D, basis have selected to participate in the set of node of storage reputation data share, construction reputation data distribution multinomial, i.e. f
(xr)=R+a1xr+...+an(xr)t-1ModP, set of node M is distributed to by reputation data share, then reputation data distribution node
On the reputation data share distributed delete for preventing that reputation data share from repeatedly being distributed；
Wherein, f (xr) it is prestige share, and f (0)=R is met, R is reputation data, and the selection of prime P refers to meet RSA
The security requirement of system, a1, a2..., anIt is the random number in the range of [1, P], xrIt is public value, t is extensive to participate in reputation data
The minimum definite value of multiple node number, 1<T≤m, t ∈ Z+；
E, when P2P network nodes freely add or neighbor node exit when, stochastic and dynamic change multicast domain neighbor node
Total k, selection participates in recovering the set of node N of reputation data；
F, basis have selected to participate in the number g of neighbor node in set of node N, the set of node N of recovery reputation data, have participated in extensive
The participation selected in the set of node N of multiple reputation data recovers number h, h ∈ g, the h ∈ Z of the node of reputation data+, t≤h≤g,
Construct reputation data and recover multinomial, i.e.,Reputation data now is calculated, will be recovered
The reputation data gone out is stored on reputation data distribution node；
Wherein, xrFor public value, xi, xjTo participate in storage prestige share neighbor node mark, and j ∈ Z+。
Embodiment 2：As Figure 1-3, a kind of P2P reputation data restoration methods based on dynamic secret sharing, the side
Method is comprised the following steps that：
A, according to hop count centered on one of node, by the node division in P2P networks to different multicasts
Domain, and initialize the weight W of multicast domain nodei fAnd storage costAccording to weight Wi fWith storage costCalculate node is initial
Overall target Vi f；
Any one node is handed over as the distribution node of reputation data share according to domain interior joint in B, selection multicast domain
Mutually, calculate node credit value Ti f, then utilize Ti fRepartition node weights, and the overall target V of calculate node againi r；
C, according to the overall target V after renewali r, using ratio d is chosen, select overall target Vi rPreferable set of node M ginsengs
With the storage of reputation data share, the number of neighbor node is m=n*d in set of node M；
Wherein, n is neighbor node number, n ∈ Z+, M is the preferable set of node of overall target, and m ∈ Z+；
D, basis have selected to participate in the set of node of storage reputation data share, construction reputation data distribution multinomial, i.e. f
(xr)=R+a1xr+...+an(xr)t-1ModP, set of node M is distributed to by reputation data share, then reputation data distribution node
On the reputation data share distributed delete for preventing that reputation data share from repeatedly being distributed；
Wherein, f (xr) it is prestige share, and f (0)=R is met, R is reputation data, and the selection of prime P refers to meet RSA
The security requirement of system, a1, a2..., anIt is the random number in the range of [1, P], xrIt is public value, t is extensive to participate in reputation data
The minimum definite value of multiple node number, 1<T≤m, t ∈ Z+；
E, when P2P network nodes freely add or neighbor node exit when, stochastic and dynamic change multicast domain neighbor node
Total k, selection participates in recovering the set of node N of reputation data；
F, basis have selected to participate in the number g of neighbor node in set of node N, the set of node N of recovery reputation data, have participated in extensive
The participation selected in the set of node N of multiple reputation data recovers number h, h ∈ g, the h ∈ Z of the node of reputation data+, t≤h≤g,
Construct reputation data and recover multinomial, i.e.,Reputation data now is calculated, will be recovered
The reputation data gone out is stored on reputation data distribution node；
Wherein, xrFor public value, xi, xjTo participate in storage prestige share neighbor node mark, and j ∈ Z+。
In the step A, the calculate node initial synthetic index Vi fComprise the following steps that：
A1, by each node weights W in multicast domaini fIt is between can be initialized as in 0.5, i.e. multicast domain each node
Initial trust node between believing and being insincere；
Wherein, W is worked asi f=0 interval scale node is insincere, works as Wi f=0.5 interval scale node between it is credible with it is insincere between
Initial trust value, work as Wi f=1 interval scale node is credible；
A2, equally spaced by the storage cost of P2P network nodesFive classes are divided into, i.e., And the storage cost after dividing is randomly selected according to node storage capacityValue is assigned
To different nodes；
A3, according to initial weight Wi fWith storage costCalculate initial synthetic index Vi f, i.e.,
Wherein, i is that nodes are identified, and i ∈ Z+, f represents to initialize node, and d is according to the initial weight W of considerationi f
With storage costDifference come the selection ratio determined, Wi fThe storage cost of node during initialization is represented,Represent node
Storage cost.
Embodiment 3：As Figure 1-3, a kind of P2P reputation data restoration methods based on dynamic secret sharing, the side
Method is comprised the following steps that：
A, according to hop count centered on one of node, by the node division in P2P networks to different multicasts
Domain, and initialize the weight W of multicast domain nodei fAnd storage costAccording to weight Wi fWith storage costAt the beginning of calculate node
Beginning overall target Vi f；
Any one node is handed over as the distribution node of reputation data share according to domain interior joint in B, selection multicast domain
Mutually, calculate node credit value Ti f, then utilize Ti fRepartition node weights, and the overall target V of calculate node againi r；
C, according to the overall target V after renewali r, using ratio d is chosen, select overall target Vi rPreferable set of node M ginsengs
With the storage of reputation data share, the number of neighbor node is m=n*d in set of node M；
Wherein, n is neighbor node number, n ∈ Z+, M is the preferable set of node of overall target, and m ∈ Z+；
D, basis have selected to participate in the set of node of storage reputation data share, construction reputation data distribution multinomial, i.e. f
(xr)=R+a1xr+...+an(xr)t-1ModP, set of node M is distributed to by reputation data share, then reputation data distribution node
On the reputation data share distributed delete for preventing that reputation data share from repeatedly being distributed；
Wherein, f (xr) it is prestige share, and f (0)=R is met, R is reputation data, and the selection of prime P refers to meet RSA
The security requirement of system, a1, a2..., anIt is the random number in the range of [1, P], xrIt is public value, t is extensive to participate in reputation data
The minimum definite value of multiple node number, 1<T≤m, t ∈ Z+；
E, when P2P network nodes freely add or neighbor node exit when, stochastic and dynamic change multicast domain neighbor node
Total k, selection participates in recovering the set of node N of reputation data；
F, basis have selected to participate in the number g of neighbor node in set of node N, the set of node N of recovery reputation data, have participated in extensive
The participation selected in the set of node N of multiple reputation data recovers number h, h ∈ g, the h ∈ Z of the node of reputation data+, t≤h≤g,
Construct reputation data and recover multinomial, i.e.,Reputation data now is calculated, will be recovered
The reputation data gone out is stored on reputation data distribution node；
Wherein, xrFor public value, xi, xjTo participate in storage prestige share neighbor node mark, and j ∈ Z+。
In the step A, the calculate node initial synthetic index Vi fComprise the following steps that：
A1, by each node weights W in multicast domaini fIt is between can be initialized as in 0.5, i.e. multicast domain each node
Initial trust node between believing and being insincere；
Wherein, W is worked asi f=0 interval scale node is insincere, works as Wi f=0.5 interval scale node between it is credible with it is insincere between
Initial trust value, work as Wi f=1 interval scale node is credible；
A2, equally spaced by the storage cost of P2P network nodesFive classes are divided into, i.e., And the storage cost after dividing is randomly selected according to node storage capacityValue is assigned
To different nodes；
A3, according to initial weight Wi fWith storage costCalculate initial synthetic index Vi f, i.e.,
Wherein, i is that nodes are identified, and i ∈ Z+, f represents to initialize node, and d is according to the initial weight W of considerationi f
With storage costDifference come the selection ratio determined, Wi fThe storage cost of node during initialization is represented,Represent node
Storage cost.
In the step B, the overall target V for calculating neighbor nodei rComprise the following steps that：
In B1, selection multicast domain any one node as reputation data share distribution node, it is interactive according to node
The credit value T of egressi r, i.e.,
Wherein,Represent that neighbor node carries out the summation of credit rating to reputation data distribution node,Represent neighbours' section
Point carries out the summation of credit rating number of times to reputation data distribution node；
B2, according to Ti fDivide weight Wi r；
As credit value -1≤Ti f<When 0, weight Wi rFor 0；
As credit value Ti fWhen=0, weight Wi rFor 0.5；
When credit value 0<Ti fWhen≤1, weight Wi rFor 1；
The weight W that B3, basis are repartitionedi rWith storage costRecalculate overall target Vi r, i.e.,
Embodiment 4：As Figure 1-3, a kind of P2P reputation data restoration methods based on dynamic secret sharing, the side
Method is comprised the following steps that：
A, according to hop count centered on one of node, by the node division in P2P networks to different multicasts
Domain, and initialize the weight W of multicast domain nodei fAnd storage costAccording to weight Wi fWith storage costAt the beginning of calculate node
Beginning overall target Vi f；
Any one node is handed over as the distribution node of reputation data share according to domain interior joint in B, selection multicast domain
Mutually, calculate node credit value Ti f, then utilize Ti fRepartition node weights, and the overall target V of calculate node againi r；
C, according to the overall target V after renewali r, using ratio d is chosen, select overall target Vi rPreferable set of node M ginsengs
With the storage of reputation data share, the number of neighbor node is m=n*d in set of node M；
Wherein, n is neighbor node number, n ∈ Z+, M is the preferable set of node of overall target, and m ∈ Z+；
D, basis have selected to participate in the set of node of storage reputation data share, construction reputation data distribution multinomial, i.e. f
(xr)=R+a1xr+...+an(xr)t-1ModP, set of node M is distributed to by reputation data share, then reputation data distribution node
On the reputation data share distributed delete for preventing that reputation data share from repeatedly being distributed；
Wherein, f (xr) it is prestige share, and f (0)=R is met, R is reputation data, and the selection of prime P refers to meet RSA
The security requirement of system, a1, a2..., anIt is the random number in the range of [1, P], xrIt is public value, t is extensive to participate in reputation data
The minimum definite value of multiple node number, 1<T≤m, t ∈ Z+；
E, when P2P network nodes freely add or neighbor node exit when, stochastic and dynamic change multicast domain neighbor node
Total k, selection participates in recovering the set of node N of reputation data；
F, basis have selected to participate in the number g of neighbor node in set of node N, the set of node N of recovery reputation data, have participated in extensive
The participation selected in the set of node N of multiple reputation data recovers number h, h ∈ g, the h ∈ Z of the node of reputation data+, t≤h≤g,
Construct reputation data and recover multinomial, i.e.,Reputation data now is calculated, will be recovered
The reputation data gone out is stored on reputation data distribution node；
Wherein, xrFor public value, xi, xjTo participate in storage prestige share neighbor node mark, and j ∈ Z+。
In the step A, the calculate node initial synthetic index Vi fComprise the following steps that：
A1, by each node weights W in multicast domaini fIt is between can be initialized as in 0.5, i.e. multicast domain each node
Initial trust node between believing and being insincere；
Wherein, W is worked asi f=0 interval scale node is insincere, works as Wi f=0.5 interval scale node between it is credible with it is insincere between
Initial trust value, work as Wi f=1 interval scale node is credible；
A2, equally spaced by the storage cost of P2P network nodesFive classes are divided into, i.e., And the storage cost after dividing is randomly selected according to node storage capacityValue is assigned
To different nodes；
A3, according to initial weight Wi fWith storage costCalculate initial synthetic index Vi f, i.e.,
Wherein, i is that nodes are identified, and i ∈ Z+, f represents to initialize node, and d is according to the initial weight W of considerationi f
With storage costDifference come the selection ratio determined, Wi fThe storage cost of node during initialization is represented,Represent node
Storage cost.
In the step B, the overall target V for calculating neighbor nodei rComprise the following steps that：
In B1, selection multicast domain any one node as reputation data share distribution node, it is interactive according to node
The credit value T of egressi f, i.e.,
Wherein,Represent that neighbor node carries out the summation of credit rating to reputation data distribution node,Represent neighbours' section
Point carries out the summation of credit rating number of times to reputation data distribution node；
B2, according to Ti fDivide weight Wi r；
As credit value -1≤Ti f<When 0, weight Wi rFor 0；
As credit value Ti fWhen=0, weight Wi rFor 0.5；
When credit value 0<Ti fWhen≤1, weight Wi rFor 1；
The weight W that B3, basis are repartitionedi rWith storage costRecalculate overall target Vi r, i.e.,
In the step E, the selection participates in recovering comprising the following steps that for the set of node N of reputation data：
E1, when increasing neighbor node, repeat step A, initialization newly increases the weight of neighbor node with storage cost simultaneously
Calculate its initial synthetic index；
E1.1 and then repeat step B, is interacted according to node, using the credit value of newly-increased neighbours, recalculates newly-increased neighbours
The weight and overall target of node；
E1.2, according to multicast domain node overall target, using choosing ratio d, the preferable set of node N ginsengs of selection overall target
With the storage of reputation data share, the number of neighbor node is g=k*d in set of node N；
Wherein, k is the node total number after increase neighbor node, k ∈ Z+, N is the preferable set of node of overall target, and g
∈Z+；
E2, when neighbor node is exited or node is insincere, then by neighbor node evaluation information from reputation data distribute save
Deleted on point.
Embodiment 5：As Figure 1-3, a kind of P2P reputation data restoration methods based on dynamic secret sharing, this implementation
Example is by taking 10 nodes of multicast domain as an example, and methods described is comprised the following steps that：
A, according to hop count centered on one of node, by the node division in P2P networks to different multicasts
Domain, and initialize the weight W of multicast domain nodei fAnd storage costAccording to weight Wi fWith storage costAt the beginning of calculate node
Beginning overall target Vi f；The calculate node initial synthetic index Vi fComprise the following steps that：
A1, by each node weights W in multicast domaini fIt is between can be initialized as in 0.5, i.e. multicast domain each node
Initial trust node between believing and being insincere；
Wherein, W is worked asi f=0 interval scale node is insincere, works as Wi f=0.5 interval scale node between it is credible with it is insincere between
Initial trust value, work as Wi f=1 interval scale node is credible；
A2, equally spaced by the storage cost of P2P network nodesFive classes are divided into, i.e., And the storage cost after dividing is randomly selected according to node storage capacityValue is assigned
To different nodes, as shown in table 1；
Table 1
A3, the node weights W with gained in table 1i fWith storage costCalculate the overall target V of start nodei f, i.e.,D is set to 0.5, can obtain Vi fAs shown in table 2：
Table 2
Wherein, i is that nodes are identified, and i ∈ Z+, f represents to initialize node, and d is according to the initial weight W of considerationi f
With storage costDifference come the selection ratio determined, Wi fThe storage cost of node during initialization is represented,Represent node
Storage cost；
B, using the weight division methods in step A, this example takes node at random10It is used as the distribution section of reputation data share
Point, its adjacent node is n=9 as its neighbor node, i.e. neighbor node number, and then node10 is believed by neighbor node
Reputation is evaluated and calculates the credit value T of neighbor nodei f, such as node1 6 times to node10 service evaluations, thenEvery time
Evaluation of estimate is { -1,1,1,0,1,1 }, thenSo T1 f=3/6=0.5, as shown in table 3；And according to
Credit value Ti fUpdate the weight W of neighbor nodei r, the mode of renewal is：As credit value -1≤Ti f<When 0, weight Wi rFor 0；Work as letter
Reputation value Ti fWhen=0, weight Wi rFor 0.5；When credit value 0<Ti fWhen≤1, weight Wi rFor 1；Recycle the weight W after updatingi rWith
Storage costRecalculate the overall target V of the neighbor node after updatingi r, as shown in table 4；
Table 3
Table 4
C, according to the overall target V after renewali r, using ratio d is chosen, select overall target Vi rPreferable set of node M ginsengs
With the storage of reputation data share, the number of neighbor node is m=n*d in set of node M, i.e. m=n*d=9*0.5=4.5, choosing
Take the node number for participating in storage reputation data share to round downwards as 4, that is, choose node1, node2, node3, node9As
Store the node of reputation data share；
Wherein, n is neighbor node number, n ∈ Z+, M is the preferable set of node of overall target, and m ∈ Z+；
D, basis have selected to participate in the set of node of storage reputation data share, construction reputation data distribution multinomial, i.e. f
(xr)=R+a1xr+...+an(xr)t-1ModP, then reputation data share is distributed to node1, node2, node3, node9, then
The reputation data share distributed on reputation data distribution node is deleted for preventing that reputation data share from repeatedly being distributed；Specifically
Step is as follows：
Neighbor node is to node in multicast domain10Credit rating information
Prime P of the present embodiment selection more than R calculates to participate in reputation data distribution, such as sets P=23, t values are 3, and are constructed
T-1 order polynomials, randomly choose a1=2, a2=7, ai∈ [1,23], and split reputation data according to multicast domain node total number
Into 10 parts；It is to verify that the validity of this method, i.e. reputation data share distribute multinomial：f(xr)=(7x2+2x+20)
Mod23, calculates reputation data share：
F (1)=(7+2+20) mod23=29mod23=6
F (2)=(28+4+20) mod23=52mod23=6
F (3)=(63+6+20) mod23=89mod23=20
F (4)=(112+8+20) mod123=140mod23=2
F (5)=(175+10+20) mod23=205mod23=21
F (6)=(252+12+20) mod23=284mod23=8
F (7)=(343+14+20) mod23=377mod23=9
F (8)=(448+16+20) mod23=484mod23=1
F (9)=(567+18+20) mod23=605mod23=7
F (10)=(700+20+20) mod23=740mod23=4
Prestige share is distributed to node1, node2, node3, node9, as shown in table 5.
Table 5
The reputation data share distributed on reputation data share distribution node is deleted again, that is, deletes f (1)=6, f (2)
=6, f (3)=20, f (4)=2；
Wherein, f (xr) it is prestige share, and f (0)=R is met, R is reputation data, and the selection of prime P refers to meet RSA
The security requirement of system, a1, a2..., anIt is the random number in the range of [1, P], xrIt is public value, t is extensive to participate in reputation data
The minimum definite value of multiple node number, 1<T≤m, t ∈ Z+；
E, when P2P network nodes are freely added or neighbor node is exited, multicast domain node number is from 10 dynamic changes
To 15, that is, after changing by taking k=15 as an example, such as newly-increased neighbor node collection is set as { node11, node12, node13, node14,
node15, then by calculating newly-increased neighbor node to reputation data distribution node node10Credit rating update newly-increased neighbour
Occupy the weight W of nodei rAnd recalculate its Vi r, as shown in table 7, specifically：
E1, when increasing neighbor node, repeat step A, initialization newly increases the weight W of neighbor nodei fWith storage costAnd calculate its initial synthetic index Vi f, as shown in table 6；
E1.1 and then repeat step B, is interacted according to node, using the credit value of newly-increased neighbours, recalculates newly-increased neighbours
Node is to reputation data distribution node node10Credit rating update the weight W of newly-increased neighbor nodei rAnd overall target Vi r,
As shown in table 7；
Table 6
Table 7
E1.2, according to multicast domain node overall target Vi r, using ratio d is chosen, select the preferable set of node N of overall target
The number for participating in neighbor node in the storage of reputation data share, set of node N is g=k*d=15*0.5=7.5, chooses and participates in
The node number for recovering reputation data is rounded downwards as 7；As node node10When needing to recover reputation data, that is, select node1,
node2, node3, node6, node7, node9, node11As recover reputation data set of node, as shown in table 8.
Table 8
Due to node11It is newly-increased neighbor node and is selected as the node that participation recovers reputation data, then by node10
Upper remaining reputation data share random selection portion is distributed to neighbor node node11, as shown in table 9.
Table 9
Wherein, k is the node total number after increase neighbor node, k ∈ Z+, N is the preferable set of node of overall target, and g
∈Z+；
E2, when neighbor node is exited or node is insincere, then by neighbor node evaluation information from reputation data distribute save
Deleted on point, to prevent the neighbor node from interacting fraud with reputation data share distribution node again using existing weight or obtain
Take reputation data share；
F, basis have selected to participate in the number g of neighbor node in set of node N, the set of node N of recovery reputation data, have participated in extensive
The participation selected in the set of node N of multiple reputation data recovers number h, h ∈ g, the h ∈ Z of the node of reputation data+, t≤h≤g,
Construct reputation data and recover multinomial, i.e.,Reputation data now is calculated, will be recovered
The reputation data gone out is stored on reputation data distribution node；Wherein, xrFor public value, xi, xjIt is adjacent to participate in storage prestige share
Occupy node identification, and j ∈ Z+；
Specifically, node node10Reputation data recovery scheme is：
In step D there is provided t is 3, now, h=3 is chosen, i.e., 3 neighbours' sections are randomly selected from 7 neighbor nodes
Point simultaneously participates in reputation data recovery, and the neighbor node for participating in reputation data recovery is as shown in table 10；
Table 10
Recover multinomial using the reputation data described in step F and carry out reputation data recovery, can obtain：
6 (x-2) (x-3)/((- 1) (- 2))=6 (x-2) (x-3)/2=6*2-1(x-2) (x-3) mod23=72 (x-2)
(x-3)mod23；
6 (x-1) (x-3)/((1) (- 1))=6 (x-1) (x-3)/- 1=6* (- 1)-1(x-1) (x-3) mod23=132 (x-
1)(x-3)mod23；
20 (x-1) (x-2)/(x-1) (the x-2)/2=20*2 of ((2) (1))=20-1(x-1) (x-2) mod23=240 (x-1)
(x-2)mod23；
So f (x)=[72 (x-2) (x-3)+132 (x-1) (x-3)+240 (x-1) (x-2)] mod23；
R=f (0)=(432+396+480) mod23=1308mod23=20；
As x=0, R=20 can be obtained, i.e., node can be recovered during 3 neighbor node participations by having simultaneously10Reputation data
R=20；
Embodiment 6, as Figure 1-3, a kind of P2P reputation data restoration methods based on dynamic secret sharing, this implementation
Same as Example 5, the node node used of example10Reputation data recovery scheme is：In step D there is provided t is 3, now,
H=4 is chosen, i.e., 4 neighbor nodes are randomly selected from 7 neighbor nodes and simultaneously participate in reputation data recovery, Reputation Number is participated in
It is as shown in table 11 according to the neighbor node of recovery；
Table 11
Recover multinomial using the reputation data described in step F and carry out reputation data recovery, can obtain：
6 (x-2) (x-3) (x-4)/((- 1) (- 2) (- 3))=6 (x-2) (x-3) (x-4)/(- 6)=6* (- 6)-1(x-2)
(x-3) (x-4) mod23=-24* (x-2) (x-3) (x-4) mod23；
6 (x-1) (x-3) (x-4)/((1) (- 1) (- 2))=6 (x-1) (x-3) (x-4)/2=6*2-1(x-1)(x-3)(x-
4) mod23=72 (x-1) (x-3) (x-4) mod23；
20 (x-1) (x-2) (x-4)/((2) (1) (- 1))=20 (x-1) (x-2) (x-4)/(- 2)=20* (- 2)-1(x-1)
(x-2) (x-4) mod23=-240 (x-1) (x-2) (x-4) mod23；
2 (x-1) (x-2) (x-3)/(3*2*1)=2 (x-1) (x-2) (x-3)/6=2*6-1(x-1)(x-2)(x-3)
Mod23=8 (x-1) (x-2) (x-3) mod23；
Then f (x)=[(x- of -24 (x-2) (x-3) (x-4)+72 (x-1) (x-3) (x-4) -240 (x-1) (x-2) (x-4)+8
1)(x-2)(x-3)]mod23；
R=f (0)=(576-864+1920-48) mod23=1584mod23=20；
As x=0, R=20 can be obtained, i.e., node can be recovered during 4 neighbor node participations by having simultaneously10Reputation Number
According to.
Embodiment 7, as Figure 1-3, a kind of P2P reputation data restoration methods based on dynamic secret sharing, this implementation
Same as Example 5, the node node used of example10Reputation data recovery scheme is：In step D there is provided t is 3, now,
H=5 is chosen, i.e., 5 neighbor nodes are randomly selected from 7 neighbor nodes and simultaneously participate in reputation data recovery, Reputation Number is participated in
It is as shown in table 12 according to the neighbor node of recovery；
Table 12
Recover multinomial using the reputation data described in step F and carry out reputation data recovery, can obtain：
6 (x-2) (x-3) (x-4) (x-6)/((- 1) (- 2) (- 3) (- 5))=6 (x-2) (x-3) (x-4) (x-6)/30=
6*30-1(x-2) (x-3) (x-4) (x-6) mod23=60 (x-2) (x-3) (x-4) (x-6) mod23；
6 (x-1) (x-3) (x-4) (x-6)/((1) (- 1) (- 2) (- 4))=6 (x-1) (x-3) (x-4) (x-6)/(- 8)=
6(-8)-1(x-1) (x-3) (x-4) (x-6) mod23=-18 (x-1) (x-3) (x-4) (x-6) mod23；
20 (x-1) (x-2) (x-4) (x-6)/(x-1) (x-2) (x-4) (the x-6)/6=of ((2) (1) (- 1) (- 3))=20
20*6-1(x-1) (x-2) (x-4) (x-6) mod23=80 (x-1) (x-2) (x-4) (x-6) mod23；
2 (x-1) (x-2) (x-3) (x-6)/(3*2*1* (- 2))=2 (x-1) (x-2) (x-3) (x-6)/(- 12)=2 (-
12)-1(x-1) (x-2) (x-3) (x-6) mod23=-4 (x-1) (x-2) (x-3) (x-6) mod23；
8 (x-1) (x-2) (x-3) (x-4)/(5*4*3*2)=8* (x-1) (x-2) (x-3) (x-4)/120=8* (120)-1
(x-1) (x-2) (x-3) (x-4) mod23=112 (x-1) (x-2) (x-3) (x-4) mod23；
F (x)=[60 (x-2) (x-3) (x-4) (x-6) -18 (x-1) (x-3) (x-4) (x-6)+80 (x-1) (x-2) (x-
4)(x-6)-4(x-1)(x-2)(x-3)(x-6)+112(x-1)(x-2)(x-3)(x-4)]mod23；
R=f (0)=(8640-1296+3840-144+2688) mod23=13728mod23=20；
As x=0, R=20 can be obtained, i.e., node can be recovered during 5 neighbor node participations by having simultaneously10Reputation Number
According to.
The node node that the present embodiment is used10If choosing h=2 in reputation data recovery scheme, believe when participating in recovery
When the neighbor node number for praising data is less than 3, i.e., 2 neighbor nodes are randomly selected from 7 neighbor nodes and simultaneously participate in letter
Data recovery is praised, the neighbor node for participating in reputation data recovery is as shown in table 13；
Table 13
Recover multinomial using the reputation data described in step F and carry out reputation data recovery, can obtain：
6 (x-3)/(- 1)=6* (- 1)-1(x-3) mod23=132 (x-3) mod23；
20 (x-2)/1=20*1-1(x-2) mod23=-440 (x-2) mod23；
So f (x)=[132 (x-3) -440 (x-2)] mod23；
R=f (0)=484mod23=1；
As x=0, R ≠ 20 can be obtained, i.e., there are 2 neighbor nodes to participate in then recovering node simultaneously10Reputation Number
According to.
Above in conjunction with accompanying drawing to the present invention embodiment be explained in detail, but the present invention be not limited to it is above-mentioned
Embodiment, can also be before present inventive concept not be departed from the knowledge that those of ordinary skill in the art possess
Put that various changes can be made.
Claims (2)
1. a kind of P2P reputation data restoration methods based on dynamic secret sharing, it is characterised in that：The specific steps of methods described
It is as follows：
A, according to hop count centered on one of node, by the node division in P2P networks to different multicast domains, and
Initialize the weight W of multicast domain nodei fAnd storage costAccording to weightWith storage costCalculate node initial synthetic
Index Vi f；
Any one node is interacted, meter as the distribution node of reputation data share according to domain interior joint in B, selection multicast domain
Operator node credit value Ti f, then utilize Ti fRepartition node weights, and the overall target V of calculate node againi r；
C, according to the overall target V after renewali r, using ratio d is chosen, select overall target Vi rPreferable set of node M participates in letter
The number for praising neighbor node in the storage of data share, set of node M is m=n*d；
Wherein, n is neighbor node number, n ∈ Z+, M is the preferable set of node of overall target, and m ∈ Z+；
D, basis have selected to participate in the set of node of storage reputation data share, construction reputation data distribution multinomial, i.e. f (xr)=R
+a1xr+...+an(xr)t-1ModP, set of node M is distributed to by reputation data share, then having divided on reputation data distribution node
The reputation data share of hair is deleted for preventing that reputation data share from repeatedly being distributed；
Wherein, f (xr) it is prestige share, and f (0)=R is met, R is reputation data, and the selection of prime P refers to meet RSA systems
Security requirement, a1, a2..., anIt is the random number in the range of [1, P], xrIt is public value, t recovers section to participate in reputation data
The minimum definite value of point number, 1 ＜ t≤m, t ∈ Z+；
E, when P2P network nodes are freely added or neighbor node is exited, stochastic and dynamic change multicast domain neighbor node sum
K, selection participates in recovering the set of node N of reputation data；
F, basis have selected to participate in the number g of neighbor node in set of node N, the set of node N of recovery reputation data, have participated in recovering to believe
The participation selected in the set of node N for praising data recovers number h, h ∈ g, the h ∈ Z of the node of reputation data+, t≤h≤g, construction
Reputation data recovers multinomial, i.e.,Reputation data now is calculated, by what is recovered
Reputation data is stored on reputation data distribution node；
Wherein, xrFor public value, xi, xjTo participate in storage prestige share neighbor node mark, and j ∈ Z+；
In the step A, the calculate node initial synthetic index Vi fComprise the following steps that：
A1, by each node weights W in multicast domaini fBe initialized as in 0.5, i.e. multicast domain each node be between it is credible with
Initial trust node between insincere；
Wherein, W is worked asi f=0 interval scale node is insincere, works as Wi f=0.5 interval scale node between it is credible with it is insincere between just
Beginning trust value, works as Wi f=1 interval scale node is credible；
A2, equally spaced by the storage cost of P2P network nodesFive classes are divided into, i.e., And the storage cost after dividing is randomly selected according to node storage capacityValue is assigned to different nodes；
A3, according to initial weight Wi fWith storage costCalculate initial synthetic index Vi f, i.e.,
Wherein, i is that nodes are identified, and i ∈ Z+, f represents to initialize node, and d is according to the initial weight W of considerationi fWith depositing
Store up costDifference come the selection ratio determined, Wi fThe storage cost of node during initialization is represented,Represent the storage of node
Cost；
In the step B, the overall target V for calculating neighbor nodei rComprise the following steps that：
Any one node draws section as the distribution node of reputation data share according to node interaction in B1, selection multicast domain
The credit value T of pointi f, i.e.,
Wherein,Represent that neighbor node carries out the summation of credit rating to reputation data distribution node,Represent neighbor node pair
Reputation data distribution node carries out the summation of credit rating number of times；
B2, according to Ti fDivide weight Wi r；
As credit value -1≤Ti fDuring ＜ 0, weight Wi rFor 0；
As credit value Ti fWhen=0, weight Wi rFor 0.5；
As the ＜ T of credit value 0i fWhen≤1, weight Wi rFor 1；
The weight W that B3, basis are repartitionedi rWith storage costRecalculate overall target Vi r, i.e.,
2. the P2P reputation data restoration methods according to claim 1 based on dynamic secret sharing, it is characterised in that：Institute
State in step E, the selection participates in recovering comprising the following steps that for the set of node N of reputation data：
E1, when increasing neighbor node, repeat step A, initialization newly increases the weight of neighbor node and storage cost and calculated
Its initial synthetic index；
E1.1 and then repeat step B, is interacted according to node, using the credit value of newly-increased neighbours, recalculates newly-increased neighbor node
Weight and overall target；
E1.2, according to multicast domain node overall target, using ratio d is chosen, the preferable set of node N of selection overall target participates in letter
The number for praising neighbor node in the storage of data share, set of node N is g=k*d；
Wherein, k is the node total number after increase neighbor node, k ∈ Z+, N is the preferable set of node of overall target, and g ∈ Z+；
E2, when neighbor node is exited or node is insincere, then by neighbor node evaluation information from reputation data distribution node
Delete.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410411698.6A CN104219291B (en) | 2014-08-20 | 2014-08-20 | A kind of P2P reputation data restoration methods based on dynamic secret sharing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410411698.6A CN104219291B (en) | 2014-08-20 | 2014-08-20 | A kind of P2P reputation data restoration methods based on dynamic secret sharing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104219291A CN104219291A (en) | 2014-12-17 |
| CN104219291B true CN104219291B (en) | 2017-08-25 |
Family
ID=52100416
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410411698.6A Active CN104219291B (en) | 2014-08-20 | 2014-08-20 | A kind of P2P reputation data restoration methods based on dynamic secret sharing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104219291B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105450394B (en) * | 2015-12-30 | 2018-12-28 | 中国农业大学 | A kind of share update method and device based on threshold secret sharing |
| CN110661867B (en) * | 2019-09-25 | 2021-07-23 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457530A (en) * | 2010-10-20 | 2012-05-16 | 电子科技大学 | Iterative P2P credit management scheme based on clustering |
| CN103533014A (en) * | 2013-04-23 | 2014-01-22 | Tcl集团股份有限公司 | Method and system for providing temporary extension space |
-
2014
- 2014-08-20 CN CN201410411698.6A patent/CN104219291B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457530A (en) * | 2010-10-20 | 2012-05-16 | 电子科技大学 | Iterative P2P credit management scheme based on clustering |
| CN103533014A (en) * | 2013-04-23 | 2014-01-22 | Tcl集团股份有限公司 | Method and system for providing temporary extension space |
Non-Patent Citations (3)
| Title |
|---|
| Mengsheng Wang. et al.Secret Sharing among Weighted Participants.《Journal of Beijing Electronic Science and Technology Institute》.2005,第13卷(第2期),第1-8页. * |
| 孙华，等.P2P下基于RSA密码机制和门限秘密共享的信誉管理方案.《微电子学与计算机》.2013,第30卷(第9期),第98-101页. * |
| 张连宽，等.P2P环境下安全的信息传递方法研究.《网络安全技术与应用》.2006,(第8期),第24-26页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104219291A (en) | 2014-12-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Aoki et al. | Simblock: A blockchain network simulator | |
| CN109150972B (en) | Working method of consensus mechanism of double-layer partitioned efficient block chain | |
| US20230239157A1 (en) | Network for improved verification speed with tamper resistant data | |
| Chen et al. | Sschain: A full sharding protocol for public blockchain without data migration overhead | |
| CN110868441B (en) | Block chain public link maintenance method and device, node and block chain public link | |
| Liu et al. | Evolutionary game for mining pool selection in blockchain networks | |
| Roos et al. | Settling payments fast and private: Efficient decentralized routing for path-based transactions | |
| Sun et al. | Slic: A selfish link-based incentive mechanism for unstructured peer-to-peer networks | |
| Bahri et al. | When trust saves energy: a reference framework for proof of trust (PoT) blockchains | |
| Shehada et al. | A new adaptive trust and reputation model for mobile agent systems | |
| CN109728910A (en) | A kind of efficient thresholding distribution elliptic curve key generates and endorsement method and system | |
| CN109842606A (en) | Block chain common recognition algorithm and system based on consistency hash algorithm | |
| Hamdaoui et al. | IoTShare: A blockchain-enabled IoT resource sharing on-demand protocol for smart city situation-awareness applications | |
| Biryukov et al. | Guru: Universal reputation module for distributed consensus protocols | |
| CN112651830A (en) | Block chain consensus method applied to power resource sharing network | |
| CN108989410A (en) | A method of improving block chain throughput efficiency | |
| Choi et al. | Sok: Distributed randomness beacons | |
| CN111683121B (en) | Cloud data tracing source block chain consensus mechanism improvement method based on DPoS | |
| CN104219291B (en) | A kind of P2P reputation data restoration methods based on dynamic secret sharing | |
| Li et al. | EdgeWatch: Collaborative investigation of data integrity at the edge based on blockchain | |
| Wang | Repshard: reputation-based sharding scheme achieves linearly scaling efficiency and security simultaneously | |
| Blum et al. | Superlight–A permissionless, light-client only blockchain with self-contained proofs and BLS signatures | |
| Mišić et al. | Towards decentralization in dpos systems: election, voting and leader selection using virtual stake | |
| Yang et al. | User-centric blockchain for industry 5.0 applications | |
| Qiu et al. | Dual vote confirmation based consensus design for blockchain integrated IoT |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220120 Address after: 650000 No. 2601, 26 / F, building 18, Derun Chuncheng garden, east of Xiaokang Avenue, Wuhua District, Kunming, Yunnan Province Patentee after: Yunnan Youmai Technology Co.,Ltd. Address before: 650093 No. 253, Xuefu Road, Wuhua District, Yunnan, Kunming Patentee before: Kunming University of Science and Technology |