CN105391548A - Node trust-based quantum trust assessment method - Google Patents

Node trust-based quantum trust assessment method Download PDF

Info

Publication number
CN105391548A
CN105391548A CN201510836918.4A CN201510836918A CN105391548A CN 105391548 A CN105391548 A CN 105391548A CN 201510836918 A CN201510836918 A CN 201510836918A CN 105391548 A CN105391548 A CN 105391548A
Authority
CN
China
Prior art keywords
trust
quantum
ttp
node
factor
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.)
Granted
Application number
CN201510836918.4A
Other languages
Chinese (zh)
Other versions
CN105391548B (en
Inventor
张仕斌
谢智海
昌燕
盛志伟
王海春
闫丽丽
黄源源
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu University of Information Technology
Original Assignee
Chengdu University of Information Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chengdu University of Information Technology filed Critical Chengdu University of Information Technology
Priority to CN201510836918.4A priority Critical patent/CN105391548B/en
Publication of CN105391548A publication Critical patent/CN105391548A/en
Application granted granted Critical
Publication of CN105391548B publication Critical patent/CN105391548B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852Quantum cryptography
    • H04L9/0855Quantum cryptography involving additional nodes, e.g. quantum relays, repeaters, intermediate nodes or remote nodes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B10/00Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/70Photonic quantum communication
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B10/00Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/80Optical aspects relating to the use of optical transmission for specific applications, not provided for in groups H04B10/03 - H04B10/70, e.g. optical power feeding or optical transmission through water
    • H04B10/85Protection from unauthorised access, e.g. eavesdrop protection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • H04L9/083Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) involving central third party, e.g. key distribution center [KDC] or trusted third party [TTP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Electromagnetism (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Optics & Photonics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a node trust-based quantum trust assessment method, including modeling of a quantum trust model and a method for quantum trust assessment. Compared with the prior art, the method uses a trust node-based credible quantum relay network as a research object, introduces trust management into a quantum communication network, uses assessment of a trust value of a node as a basis to build a safe and credible quantum communication network, and uses the trust value as a basis for judging whether users in the quantum communication network are credible; by means of unique characteristics of a quantum entanglement effect and quantum teleportation, the node trust-based quantum trust assessment method is researched and proposed, and the idea and the process of quantum trust assessment are explained in detail; and finally feasibility, reasonability and safety of the node trust-based quantum trust assessment method proposed by the invention are analyzed, thereby providing a valuable new idea and new method for building a safe and credible quantum communication network.

Description

Based on the quantum method for evaluating trust that node is trusted
Technical field
The present invention relates to a kind of quantum method for evaluating trust, particularly relate to the quantum method for evaluating trust of trusting based on node.
Background technology
Quantum communications refer to a kind of novel communication modes utilizing quantum coherent superposition, entangled quantum effect and quantum teleportation to carry out information transmission, and existing quantum communications security protocol and technology etc. are all impliedly relevant to trust, or presupposed certain and trusted prerequisite, or object is to create or obtain certain trusting relationship.Therefore, be similar to classic network, in quantum communication network, two kinds of trusting relationships that are mutually related mainly are discussed to the research of trusting: (1) objective trust (trust to object node) is evidential trust, thus can accurately describe, reasoning and checking; (2) subjective trust (trust of master nodes, master nodes refers to the individuality or colony that are made up of the mixture of people or people and object node), as the cognitive phenomenon of one, it is a kind of subjective conviction, be other subjective judgement of a specific order of special characteristic to master nodes or behavior, and this subjective judgement is independent of the monitoring to body feature and behavior.Subjective trust is important prerequisite and the basis of objective trust, and it is in essence based on conviction, has very large uncertainty (showing as randomness, diversity and ambiguity), cannot accurately describing and validating in addition.And the main difficulty that subjective trust carries out formal research is also how to carry out modeling to this uncertainty.
Summary of the invention
Object of the present invention is just the quantum method for evaluating trust proposing to solve the problem to trust based on node.
The present invention is achieved through the following technical solutions above-mentioned purpose:
The present invention includes the modeling of quantum trust model and the method for quantum trust evaluation,
The modeling of quantum trust model:
In quantum communications, a quantum state can be expressed as | ψ >=α | and 0>+ β | 1>, wherein α 2+ β 2=1; Also consider in quantum communication network simultaneously, trust and there is the uncertain factors such as randomness, diversity and ambiguity, therefore describe each node belongs in the degree of membership of certain factor by means of the degree of membership of intuitionistic Fuzzy Sets and non-affiliated topology degree;
Definition 1: set U as nonempty set, u ifor the element in U, an intuitionistic Fuzzy Sets on U is defined as:
A={<u iA(u i),υ A(u i)>|u i∈U}
Definition 2: assuming that i-th node u in quantum communication network i, evaluate a jth factor quantum state of its trust value represent; But due in actual applications, the significance level of each trust factor is different, increases a weight t to each trust factor at this j; Like this, the trust value evaluating i-th user can be expressed as:
| α i > u i = Σ j = 1 m t j ( cosθ j | 0 > + sinθ j | 1 > ) - - - ( 1 )
According to the cos in definition 1 and formula (1) 2θ ju ito the degree of membership of a jth trust factor, sin 2θ ju ito the non-affiliated degree of a jth factor, cos 2θ j+ sin 2θ j=1; t j(j=1,2 ..., m) be the weight coefficient of each trust factor, meet
Evaluating each node u in quantum communication network ieach factor of the trust value degree of membership of fuzzy intuition collection theory and non-affiliated degree describe, and complete the modeling of each node subjective trust, this model is referred to as quantum trust model;
The method of quantum trust evaluation:
Step 1: initial phase
Assuming that prior u iby the mode of registration, its information about trust is stored in TTP there, is expressed as with quantum state:
| α i > u i = Σ j = 1 m t j ( cosθ j | 0 > + sinθ j | 1 > ) = cosγ i | 0 > + sinγ i | 1 > - - - ( 2 )
In formula (2), the weight coefficient t of each trust factor jmeet θ ja corresponding jth trust factor; γ ithe description that corresponding i-th node is comprehensively trusted, cos 2γ iu ito the degree of membership of j trust factor, sin 2γ iu ito the non-affiliated degree of j trust factor, cos 2γ i+ sin 2γ i=1, wherein i=1,2 ..., n;
Assuming that TTP and each user u ibetween share the quantum bit that is in for a pair in Entangled State wherein particle T returns TTP to own, and particle A returns u iall, in order to illustrate conveniently, setting u 3think and u 1communication;
Step 2:u 3hope and u is sent to TTP by classical channel 1the request of communication;
Step 3:TTP receives and asks and be confirmed to be u 3after, and inform u 1, u 3want to communicate with him;
Step 4: the transmission realizing trust value by means of quantum teleportation;
TTP is by u 1be kept at the trust value information of its there in advance, be prepared into u by TTP 1the quantum state of trust value throughput subchannel sends to u 3, detailed process is as follows:
1. TTP is to quantum state carry out Bell base combined measurement with particle T, obtain measurement result;
Specific practice is: the quantum state that TTP is prepared into the quantum state be in Entangled State shared with them particle T and particle A carry out computing, obtains three particle systems residing quantum state is:
In formula (3) for tensor product, | φ +> tA, | φ -> tA, | ψ +> tAwith | ψ -> tAbe four Bell state, be respectively:
| φ + > T A = ( | 00 > + | 11 > ) / 2
| φ - > T A = ( | 00 > - | 11 > ) / 2
| ψ + > T A = ( | 01 > + | 10 > ) / 2
| ψ - > T A = ( | 01 > - | 10 > ) / 2
2. TTP sends to u measurement result 3;
3. u 3according to the classical information received, the particle A that only need have him does corresponding operation, recovers u 1the original quantum state of trust value
Setting node in advance and TTP arrange: classical information 00,01,10 and 11 represents the measurement result of TTP respectively | φ +> tA, | φ -> tA, | ψ +> tAwith | ψ -> tA.Work as u 3when receiving information 00,01,10 and 11 of TTP transmission, just do corresponding unitary operations, can u be obtained 1the quantum state of trust value
Step 5:u 3according to what recover calculate u 1trust value, and pass judgment on whether trust u according to the trust value that calculates 1.
Beneficial effect of the present invention is:
The present invention is the quantum method for evaluating trust of trusting based on node, compared with prior art, the present invention with the credible Quantum repeater network based on trusted node for research object, trust management is incorporated in quantum communication network, safe and reliable quantum communication network is built based on the trust value of evaluation node, and using trust value as the whether believable foundation of each user in judge quantum communication network; By means of the monopolizing characteristic such as entangled quantum effect and quantum teleportation, study and propose the quantum method for evaluating trust of trusting based on node, the thinking of quantum trust evaluation and process have been described in detail; The feasibility of the quantum method for evaluating trust of trusting based on node that ultimate analysis the present invention proposes, reasonability and fail safe, this provides a kind of valuable new approaches and new method for setting up safe and reliable quantum communication network.
Accompanying drawing explanation
Fig. 1 is the quantum communication network structure chart with trusted third party TTP;
Fig. 2 is the quantum trust evaluation flow chart with trusted third party TTP.
Embodiment
Below in conjunction with accompanying drawing, the invention will be further described:
Thinking based on the quantum method for evaluating trust that node is trusted:
Find by analyzing, based in the credible junction network of trusted node, the trust evaluation between each node can be evaluated by means of trusted third party TTP (trustedthirdparty).If there be n node (user) u in quantum communication network 1, u 2..., u nwith a trusted third party TTP, first each node will carry out registering (such as submitting the attributes such as history credit worthiness, identity information to) at TTP when joining quantum communication network; During registration, portray the uncertainty of each nodal community by means of the degree of membership of intuitionistic Fuzzy Sets and non-affiliated topology degree, complete the quantitative description (i.e. the mathematical modeling of subjective trust) of subjective trust; Between each node before securely communicating, obtain the information of certain node about trusting by means of Quantum Entangled States, quantum teleportation etc.; Then according to the trust value information obtaining node, calculate the trust value of certain node, more whether evaluate the other side according to the trust value calculated credible.
Concrete thought (as shown in Figure 1) based on the quantum trust evaluation that node is trusted: assuming that node u 3think and node u 1communication, but u 3and do not know u 1whether credible, in order to prevent u 1deception u 3, u 3related Evaluation u is obtained from TTP there 1the relevant information of trusting, u 3by means of the information that TTP provides, calculate u 1trust value, and pass judgment on u according to trust value 1whether credible.Note: consider the clear of network structure in Fig. 1, in figure, TTP has only marked u 1, u 3, u 3;
As shown in Figure 2, the present invention includes the modeling of quantum trust model and the method for quantum trust evaluation,
The modeling of quantum trust model:
In quantum communications, a quantum state can be expressed as | ψ >=α | and 0>+ β | 1>, wherein α 2+ β 2=1; Also consider in quantum communication network simultaneously, trust and there is the uncertain factors such as randomness, diversity and ambiguity, therefore describe each node belongs in the degree of membership of certain factor by means of the degree of membership of intuitionistic Fuzzy Sets and non-affiliated topology degree;
Definition 1: set U as nonempty set, u i(i=1,2 ..., be n) element in U, an intuitionistic Fuzzy Sets on U is defined as:
A={<u iA(u i),υ A(u i)>|u i∈U}
Wherein, μ a: U → [0,1], υ a: U → [0,1],
For 0≤μ a(u i)+υ a(u i)≤1.
μ a(u i) represent u ito the degree of membership of set A, υ a(u i) represent u ito the non-affiliated degree of set A.
Definition 2: as shown in Figure 1, assuming that i-th node u in quantum communication network i(i=1,2 ..., n), evaluate its trust value jth (j=1,2 ..., m) individual factor quantum state represent; But due in actual applications, the significance level of each trust factor is different, increases a weight t to each trust factor at this j(j=1,2 ..., m); Like this, the trust value evaluating i-th user can be expressed as:
| α i > u i = Σ j = 1 m t j ( cosθ j | 0 > + sinθ j | 1 > ) - - - ( 1 )
According to the cos in definition 1 and formula (1) 2θ ju ito the degree of membership of a jth trust factor, sin 2θ ju ito the non-affiliated degree of a jth factor, cos 2θ j+ sin 2θ j=1; t j(j=1,2 ..., m) be the weight coefficient of each trust factor, meet
Evaluating each node u in quantum communication network i(i=1,2, ..., n) each factor of trust value describes with the degree of membership of fuzzy intuition collection theory and non-affiliated degree, reflect the actual conditions (uncertainty of subjective trust) of subjective trust more objectively, complete the modeling of each node subjective trust, this model is referred to as quantum trust model by the present invention.
The method of quantum trust evaluation:
Step 1: initial phase
Assuming that prior u i(i=1,2 ..., n) by the mode of registration, its information about trust is stored in TTP there, is expressed as with quantum state (being prepared by TTP before sending):
| α i > u i = Σ j = 1 m t j ( cosθ j | 0 > + sinθ j | 1 > ) = cosγ i | 0 > + sinγ i | 1 > - - - ( 2 )
In (2) formula, the weight coefficient t of each trust factor jmeet θ ja corresponding jth trust factor; γ ithe description that corresponding i-th node is comprehensively trusted, cos 2γ iu ito the degree of membership of j trust factor, sin 2γ iu ito the non-affiliated degree of j trust factor, cos 2γ i+ sin 2γ i=1, wherein i=1,2 ..., n.
Assuming that TTP and each user u i(i=1,2 ..., share the quantum bit be in for a pair in Entangled State n) wherein particle T (the 1st quantum bit) returns TTP to own, and particle A (the 2nd quantum bit) returns u i(i=1,2 ..., n) all.In order to illustrate conveniently, we suppose u 3think and u 1communication (representing with adding thick lines in Fig. 1).
Step 2:u 3hope and u is sent to TTP by classical channel 1the request of communication.
Step 3:TTP receives and asks and be confirmed to be u 3after, and inform u 1, u 3want to communicate with him.
Step 4: the transmission realizing trust value by means of quantum teleportation.
TTP is by u 1be kept at the trust value information of its there in advance, be prepared into u by TTP 1the quantum state of trust value (namely wanting the quantum state of Teleportation), throughput subchannel sends to u 3, detailed process is as follows:
1. TTP is to quantum state carry out Bell base combined measurement with particle T, obtain measurement result (classical information).
Specific practice is: the quantum state that TTP is prepared into the quantum state be in Entangled State shared with them particle T and particle A carry out computing, obtains three particle systems residing quantum state is:
In formula (3) for tensor product, | φ +> tA, | φ -> tA, | ψ +> tAwith | ψ -> tAbe four Bell state, be respectively:
| φ + > T A = ( | 00 > + | 11 > ) / 2
| φ - > T A = ( | 00 > - | 11 > ) / 2
| ψ + > T A = ( | 01 > + | 10 > ) / 2
| ψ - > T A = ( | 01 > - | 10 > ) / 2
2. TTP sends to u measurement result (classical information) 3.
3. u 3according to the classical information received, the particle A that only need have him does corresponding operation (as shown in table 1), recovers u 1the original quantum state of trust value
Assuming that node is prior and TTP arranges: classical information 00,01,10 and 11 represents the measurement result of TTP respectively | φ +> tA, | φ -> tA, | ψ +> tAwith | ψ -> tA.Work as u 3when receiving classical information 00,01,10 and 11 of TTP transmission, just do corresponding unitary operations, can u be obtained 1the quantum state of trust value
Table 1 and classical information 00,01,10 and 11 corresponding unitary operations
Such as: as shown in Table 1, if TTP is prior and u 3appoint, receive 01 and just do Z = 1 0 0 - 1 Conversion, recovers u 1original quantum state its its be specifically transformed to:
Z ⊗ ( cosγ 1 | 0 > - sinγ 1 | 1 > ) = 1 0 0 - 0 ⊗ ( cosγ 1 0 - 0 sinγ 1 ) = 1 0 0 - 1 ⊗ cosγ 1 - sinγ 1 = cosγ 1 sinγ 1 = cosγ 1 | 0 > + sinγ 1 | 1 > = | α 1 > u 1
Step 5:u 3according to what recover calculate u 1trust value, and pass judgment on whether trust u according to the trust value that calculates 1.
Feasibility analysis:
Dividing to send by quantum teleportation and quantum entanglement and realize remote quantum communications, particularly transmit unknown quantum state, is remote quantum communications and the requisite link of distributed quantum network.At present, quantum teleportation and quantum entanglement distribution obtain realization at the optical fiber of moderate distance.The quantum method for evaluating trust that the present invention proposes has used the characteristic such as quantum teleportation, quantum entanglement, is feasible in the application of the quantum communication network in future.Specifically, following two aspects are shown:
(1) in quantum teleportation, when representing u 1trust information is converted into TTP will send u to 3original quantum state time, be prepare u by TTP 1the quantum state of trust value throughput subchannel sends to u 3; TTP uses this quantum state and each user u subsequently i(i=1,2 ..., n) shared, the quantum bit be in Entangled State carry out computing, will transform into a Bell state a part (or | 0> state and | one of 1> state).This illustrates works as when quantum state is transferred on particle A, just u is described 3receive the unknown quantum state that TTP throughput subchannel sends over so Teleportation and quantum non-clone principle not contradiction, also illustrate that the present invention realizes trust value transmission by means of quantum teleportation is feasible with calculating, be also be rational in following practical application simultaneously.
(2) in quantum entanglement, the both sides no matter sharing Entangled State are how far apart, as long as a side (TTP in the present invention) measures two particles in oneself hand, then and the opposing party (u in the present invention 3) particle in hand will collapse accordingly.In the present invention, u 3according to the measurement result that TTP sends at classical channel, to the unknown quantum state that TTP throughput subchannel sends over do corresponding operation (as shown in table 1), will obtain with TTP according to u 1the original quantum state prepared of trust information therefore, the present invention realizes trust value transmission by means of quantum entanglement is feasible with calculating, and is also be rational in following practical application.
Safety analysis:
Analyze the fail safe of the quantum trust evaluation that the present invention proposes, mainly from the Preventing spoofing (side that communicates (such as u of the present invention 1) cheat the opposing party (the such as u of the present invention communicated 1)) and prevent the aspects such as eavesdropping from analyzing.
(1) Preventing spoofing
In Preventing spoofing, due to u 3think and u 1communication, u 3hope and u is sent to TTP by classical channel 1the request of communication, TTP receives and asks and inform u 1after wanting to communicate with him, the u that oneself is prepared 1the quantum state of trust value throughput subchannel sends u to 3, measurement result (classical information) is sent to u by classical channel simultaneously 3, u 3recovered by the measurement result received and calculate u 1trust value.Because TTP is u 1and u 3the third party trusted, TTP tells u before communicating 1, u 3want to communicate with him; u 3be according to TTP by quantum teleportation pass over about u 1trust information, and calculate u 1trust value be true and reliable, therefore u 1and u 3there is not fraudulent problem in both sides.
(2) anti-eavesdrop
Before analysis, first suppose in communication process, have listener-in Eve (Eve can be the listener-in of internal system (as Fig. 1), also can be the listener-in of its exterior), he wants that obtaining TTP by eavesdropping sends to user u 3original quantum state
If 1. Eve is peripheral listener-in
In the present invention, TTP and u 3share the quantum bit be in for a pair in Entangled State tTP has particle T (the 1st quantum bit), u 3have particle A (the 2nd quantum bit), and any quantum bit information in assailant Eve is not in Entangled State quantum bit.If Eve has intercepted TTP and has issued user u by classical channel 3information (that is to say, Eve obtains the measurement result of TTP), but the quantum bit information in Quantum Entangled States is not had due to Eve, even if so he obtains classical information, he can not pass through certain operations (and Eve does not know which type of operation this carries out yet) and recover original quantum state obviously, Eve can not obtain any available information about unknown quantum state in this case, and the trust model that therefore the present invention proposes can prevent the eavesdropping of peripheral listener-in Eve.
If 2. Eve is internal system listener-in
In the present invention, although TTP, u 3the quantum bit be in for a pair in Entangled State is shared with Eve | φ +> tAif Eve has intercepted and has sent to u 3classical information, but Eve do not know this carry out which type of operation, he also can not recover original quantum state therefore, the trust model that the present invention proposes can prevent the eavesdropping of internal system listener-in Eve.
In addition, in the method for evaluating trust of the present invention's research, u 1the quantum state of trust value information according to u by TTP 1some attributes (such as the identity etc. of history credit worthiness, user) prepare, then throughput subchannel sends to u 3, there is certain authority.According to quantum uncertainty principle in quantum mechanics and quantum non-clone principle (quantum signal transmitted in quantum channel is all indeterminable to any recipient), if assailant's (wrapping other users in this quantum network system and graphical user) wishes to go to determine by measuring then cause just be not present in after measured.From this angle, in theory u 3obtain (provided by TTP, represent u 1the quantum state of trust value information ) can be perfectly safe.
More than show and describe general principle of the present invention and principal character and advantage of the present invention.The technical staff of the industry should understand; the present invention is not restricted to the described embodiments; what describe in above-described embodiment and specification just illustrates principle of the present invention; without departing from the spirit and scope of the present invention; the present invention also has various changes and modifications, and these changes and improvements all fall in the claimed scope of the invention.Application claims protection range is defined by appending claims and equivalent thereof.

Claims (1)

1., based on the quantum method for evaluating trust that node is trusted, it is characterized in that: comprise the modeling of quantum trust model and the method for quantum trust evaluation,
The modeling of quantum trust model:
In quantum communications, a quantum state can be expressed as | ψ >=α | and 0>+ β | 1>, wherein α 2+ β 2=1; Also consider in quantum communication network simultaneously, trust and there is the uncertain factors such as randomness, diversity and ambiguity, therefore describe each node belongs in the degree of membership of certain factor by means of the degree of membership of intuitionistic Fuzzy Sets and non-affiliated topology degree;
Definition 1: set U as nonempty set, u ifor the element in U, an intuitionistic Fuzzy Sets on U is defined as:
A={<u iA(u i),υ A(u i)>|u i∈U}
Definition 2: assuming that i-th node u in quantum communication network i, evaluate a jth factor quantum state of its trust value represent; But due in actual applications, the significance level of each trust factor is different, increases a weight t to each trust factor at this j; Like this, the trust value evaluating i-th user can be expressed as:
| &alpha; i > u i = &Sigma; j = 1 m t j ( cos&theta; j | 0 > + sin&theta; j | 1 > ) - - - ( 1 )
According to the cos in definition 1 and formula (1) 2θ ju ito the degree of membership of a jth trust factor, sin 2θ ju ito the non-affiliated degree of a jth factor, cos 2θ j+ sin 2θ j=1; t j(j=1,2 ..., m) be the weight coefficient of each trust factor, meet
Evaluating each node u in quantum communication network ieach factor of the trust value degree of membership of fuzzy intuition collection theory and non-affiliated degree describe, and complete the modeling of each node subjective trust, this model is referred to as quantum trust model;
The method of quantum trust evaluation:
Step 1: initial phase
Assuming that prior u iby the mode of registration, its information about trust is stored in TTP there, is expressed as with quantum state:
| &alpha; i > u i = &Sigma; j = 1 m t j ( cos&theta; j | 0 > + sin&theta; j | 1 > ) = cos&gamma; i | 0 > + sin&gamma; i | 1 > - - - ( 2 )
In formula (2), the weight coefficient t of each trust factor jmeet θ ja corresponding jth trust factor; γ ithe description that corresponding i-th node is comprehensively trusted, cos 2γ iu ito the degree of membership of j trust factor, sin 2γ iu ito the non-affiliated degree of j trust factor, cos 2γ i+ sin 2γ i=1, wherein i=1,2 ..., n;
Assuming that TTP and each user u ibetween share the quantum bit that is in for a pair in Entangled State wherein particle T returns TTP to own, and particle A returns u iall, in order to illustrate conveniently, setting u 3think and u 1communication;
Step 2:u 3hope and u is sent to TTP by classical channel 1the request of communication;
Step 3:TTP receives and asks and be confirmed to be u 3after, and inform u 1, u 3want to communicate with him;
Step 4: the transmission realizing trust value by means of quantum teleportation;
TTP is by u 1be kept at the trust value information of its there in advance, be prepared into u by TTP 1the quantum state of trust value throughput subchannel sends to u 3, detailed process is as follows:
1. TTP is to quantum state carry out Bell base combined measurement with particle T, obtain measurement result;
Specific practice is: the quantum state that TTP is prepared into the quantum state be in Entangled State shared with them particle T and particle A carry out computing, obtains three particle systems residing quantum state is:
In formula (3) for tensor product, | φ +> tA, | φ -> tA, | ψ +> tAwith | ψ -> tAbe four Bell state, be respectively:
| &phi; + > T A = ( | 00 > + | 11 > ) / 2
| &phi; - > T A = ( | 00 > - | 11 > ) / 2
| &psi; + > T A = ( | 01 > + | 10 > ) / 2
| &psi; - > T A = ( | 01 > - | 10 > ) / 2
2. TTP sends to u measurement result 3;
3. u 3according to the classical information received, the particle A that only need have him does corresponding operation, recovers u 1the original quantum state of trust value
Setting node in advance and TTP arrange: classical information 00,01,10 and 11 represents the measurement result of TTP respectively | φ +> tA, | φ -> tA, | ψ +> tAwith | ψ -> tA.Work as u 3when receiving information 00,01,10 and 11 of TTP transmission, just do corresponding unitary operations, can u be obtained 1the quantum state of trust value
Step 5:u 3according to what recover calculate u 1trust value, and pass judgment on whether trust u according to the trust value that calculates 1.
CN201510836918.4A 2015-11-26 2015-11-26 The quantum method for evaluating trust trusted based on node Active CN105391548B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510836918.4A CN105391548B (en) 2015-11-26 2015-11-26 The quantum method for evaluating trust trusted based on node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510836918.4A CN105391548B (en) 2015-11-26 2015-11-26 The quantum method for evaluating trust trusted based on node

Publications (2)

Publication Number Publication Date
CN105391548A true CN105391548A (en) 2016-03-09
CN105391548B CN105391548B (en) 2018-04-20

Family

ID=55423403

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510836918.4A Active CN105391548B (en) 2015-11-26 2015-11-26 The quantum method for evaluating trust trusted based on node

Country Status (1)

Country Link
CN (1) CN105391548B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789083A (en) * 2017-01-12 2017-05-31 成都信息工程大学 Ring-type quantum Trust Valuation Model based on trusted third party
CN109257166A (en) * 2018-08-31 2019-01-22 西安电子科技大学 A kind of Quantum error correction coding method for quantum repeater
CN109274420A (en) * 2018-11-16 2019-01-25 西安电子科技大学 A kind of entangled photon pairs transmission rate estimation method for star underground line link
CN110912695A (en) * 2019-12-05 2020-03-24 成都信息工程大学 Quantum arbitration signature method and system based on six-particle invisible transmission state
CN110943833A (en) * 2019-12-05 2020-03-31 成都信息工程大学 Flexible quantum trust model construction method and system based on node trust evaluation

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101835158A (en) * 2010-04-12 2010-09-15 北京航空航天大学 Sensor network trust evaluation method based on node behaviors and D-S evidence theory
CN102244587A (en) * 2011-07-15 2011-11-16 杭州信雅达数码科技有限公司 Method for trust evaluation of nodes in network
CN102324982A (en) * 2011-07-21 2012-01-18 中国科学院上海技术物理研究所 Single photon far field distribution detection device for spatial quantum communication
CN202150859U (en) * 2011-08-17 2012-02-22 上海朗研光电科技有限公司 Remote quantum secret communication system
US20140079387A1 (en) * 2012-09-14 2014-03-20 The Government Of The United States Of America, As Represented By The Secretary Of The Navy Adaptive quantum information processing
WO2014068959A1 (en) * 2012-11-01 2014-05-08 日本電気株式会社 Light-receiving device in optical communication system, photon-detector control method and device, and photon-detector dark-count-rate evaluation method
CN104601248A (en) * 2014-12-23 2015-05-06 上海电机学院 Multi-party combined remote quantum state preparation method based on single atom operations

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101835158A (en) * 2010-04-12 2010-09-15 北京航空航天大学 Sensor network trust evaluation method based on node behaviors and D-S evidence theory
CN102244587A (en) * 2011-07-15 2011-11-16 杭州信雅达数码科技有限公司 Method for trust evaluation of nodes in network
CN102324982A (en) * 2011-07-21 2012-01-18 中国科学院上海技术物理研究所 Single photon far field distribution detection device for spatial quantum communication
CN202150859U (en) * 2011-08-17 2012-02-22 上海朗研光电科技有限公司 Remote quantum secret communication system
US20140079387A1 (en) * 2012-09-14 2014-03-20 The Government Of The United States Of America, As Represented By The Secretary Of The Navy Adaptive quantum information processing
WO2014068959A1 (en) * 2012-11-01 2014-05-08 日本電気株式会社 Light-receiving device in optical communication system, photon-detector control method and device, and photon-detector dark-count-rate evaluation method
CN104601248A (en) * 2014-12-23 2015-05-06 上海电机学院 Multi-party combined remote quantum state preparation method based on single atom operations

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
BA BELL,D MARKHAM,DA HERRERAMARTÍ,A MARIN,WJ WADSWORTH: "Experimental demonstration of graph-state quantum secret sharing", 《NATURE COMMUNICATIONS》 *
F GAO,SJ QIN,FZ GUO,QY WEN: "Cryptanalysis of quantum", 《CHINESE PHYSICS LETTERS》 *
张仕斌,许春香: "基于云模型的信任评估方法研究", 《计算机学报》 *
昌燕,张仕斌,闫丽丽,盛志伟: "基于三粒子W态蜜罐的受控量子安全直接通信协议", 《电子科技大学学报》 *
杨静,王川,张茹: "Quantum Secure Direct Communication with Authentication Expansion Using Single", 《CHINESE SCIENCE BULLETIN》 *
陈建钧,张仕斌: "基于云模型和信任链的信任评价模型研究", 《计算机应用研究》 *
龙桂鲁,王川,李岩松,邓富国: "量子安全直接通信", 《中国科学:物理学 力学 天文学》 *
龚晶,何敏,邓元庆,刘斌: "基于网络的量子身份认证方案", 《量子光学学报》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789083A (en) * 2017-01-12 2017-05-31 成都信息工程大学 Ring-type quantum Trust Valuation Model based on trusted third party
CN106789083B (en) * 2017-01-12 2019-12-17 成都信息工程大学 Annular quantum trust evaluation model based on trusted third party
CN109257166A (en) * 2018-08-31 2019-01-22 西安电子科技大学 A kind of Quantum error correction coding method for quantum repeater
CN109274420A (en) * 2018-11-16 2019-01-25 西安电子科技大学 A kind of entangled photon pairs transmission rate estimation method for star underground line link
CN109274420B (en) * 2018-11-16 2020-05-05 西安电子科技大学 Method for estimating transmission rate of entangled photon pair for satellite-ground downlink
CN110912695A (en) * 2019-12-05 2020-03-24 成都信息工程大学 Quantum arbitration signature method and system based on six-particle invisible transmission state
CN110943833A (en) * 2019-12-05 2020-03-31 成都信息工程大学 Flexible quantum trust model construction method and system based on node trust evaluation
CN110943833B (en) * 2019-12-05 2021-03-05 成都信息工程大学 Quantum trust model construction method and computer readable storage medium

Also Published As

Publication number Publication date
CN105391548B (en) 2018-04-20

Similar Documents

Publication Publication Date Title
CN105391548A (en) Node trust-based quantum trust assessment method
Luo et al. Blockchain enabled trust-based location privacy protection scheme in VANET
CN108964926A (en) User trust negotiation establishing method based on two-layer block chain in heterogeneous alliance system
CN108092771A (en) A kind of anti-tamper controlled quantum safety direct communication method and system
CN106161015A (en) A kind of quantum key distribution method based on DPI
CN104160673B (en) Improve the method and system of routing safety
CN114363043B (en) Asynchronous federal learning method based on verifiable aggregation and differential privacy in peer-to-peer network
Zheng et al. A practical quantum designated verifier signature scheme for E-voting applications
CN117879818B (en) Quantum key distribution method and device based on mode pairing
Sun et al. Privacy-preserving estimation of $ k $-persistent traffic in vehicular cyber-physical systems
CN106788990B (en) Single-agent qubit commitment protocol
CN106358246A (en) Access token issuing method and associated equipment
Banerjee et al. Spreading nonlocality in a quantum network
CN101242410A (en) Grid subjective trust processing method based on simple object access protocol
CN105307185A (en) Crowd-sourcing cooperative spectrum sensing method based on data cleaning
CN102546602B (en) Network transaction method based on privacy protection trust evaluation
CN109921903A (en) A kind of system, method and apparatus that quantum key is detected at code rate authenticity
Inoue et al. Differential-phase-shift quantum digital signature without disclosing measurement information
Xu et al. Semi-quantum voting protocol
CN106789083B (en) Annular quantum trust evaluation model based on trusted third party
Hillebrand Superdense Coding with GHZ and Quantum Key Distribution with W in the ZX-calculus
CN103826218B (en) The pseudo random sequence generation method of wireless sensor network node and application process thereof
CN106878378A (en) Scatterplot processing method in network service management
Jiang et al. Quantum multi-party fair exchange protocol based on three-particle GHZ states
Sumra et al. An Integrated Multi-level Security Model for Malicious Attacks Resiliency in Vehicular Ad hoc Network (VANET)[J]

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