CN109347852A - A kind of car networking method for evaluating trust of lightweight - Google Patents

A kind of car networking method for evaluating trust of lightweight Download PDF

Info

Publication number
CN109347852A
CN109347852A CN201811315880.6A CN201811315880A CN109347852A CN 109347852 A CN109347852 A CN 109347852A CN 201811315880 A CN201811315880 A CN 201811315880A CN 109347852 A CN109347852 A CN 109347852A
Authority
CN
China
Prior art keywords
trust
receiver
follows
car networking
proves
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
CN201811315880.6A
Other languages
Chinese (zh)
Other versions
CN109347852B (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.)
Jinan University
University of Jinan
Original Assignee
Jinan University
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 Jinan University filed Critical Jinan University
Priority to CN201811315880.6A priority Critical patent/CN109347852B/en
Publication of CN109347852A publication Critical patent/CN109347852A/en
Application granted granted Critical
Publication of CN109347852B publication Critical patent/CN109347852B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a kind of car networking method for evaluating trust of lightweight, specifically include step: S1, at the end of node previously interacts, and interaction both sides are that other side generates the trust comprising itself digital signature and proves and send to other side all in accordance with interactive experience；S2, interaction both sides, which receive new trust, proves that posteriority demonstrate,proves its signing messages, and updates and be locally stored to save to trust itself best at most η item and prove, wherein η ∈ Z+For system parameter；S3, it is potential interaction start when, potential interactive both sides by the trust being locally stored proof be sent to other side to prove that itself is believable；S4, potential interactive both sides are verified by digital signature information to be trusted the authenticity proved and exports the trust value of other side accordingly and decide whether to agree to interact, and is interacted when both sides agree to.The present invention does not depend on trust center and roadside unit, more meets extensive, the distributed nature of car networking.

Description

A kind of car networking method for evaluating trust of lightweight
Technical field
The present invention relates to car networking security technology areas, and in particular to a kind of car networking method for evaluating trust of lightweight.
Background technique
Currently, traffic accident, congestion in road and environmental pollution have become the critical issue that global urban is faced, and vehicle joins Net as Internet of Things in the main application of automobile industry and the core component of intelligent transportation system, in urban highway traffic side Face plays vital effect.Car networking is considered as most one of the branch of market potential in Internet of Things, is arranged For national " 12th Five-Year Plan ", the great research project of " 13 " planning outline.
However, due to characteristics such as extensive, open, distributed, sparse and high dynamics, car networking for malicious act and Attack be it is fragile, safety and reliability, which has been increasingly becoming, restricts the bottleneck that further develops of car networking, and is related to vehicle connection Can net be applied in true road environment.Existing scheme mostly uses digital signature and cryptological technique, can not assess section The reliability of point (i.e. vehicle) and the quality of message.
Trust management plays the part of vital role in car networking, it enables each node to assess other sections in advance The trust value of point and message, to avoid serious consequence caused by malicious node and not firm message.Currently, the trust pipe in car networking Reason is still within the primary stage, and only small amounts of trust evaluation scheme is suggested.Based on architecture, existing scheme can be rough Ground is divided into two classes, the i.e. scheme based on infrastructure and self-organizing scheme.
Li et al. people [X.Li, J.Liu, X.Li, and W.Sun, " RGTE:A reputation-based global trust establishment in VANETs,"In Proceedings of the 5th International Conference on Intelligent Networking and Collaborative Systems,2013,pp.210- 214.] propose that a global trusting based on popularity establishes scheme RGTE for car networking, wherein popularity administrative center is responsible for collection The trust information of all legitimate nodes simultaneously calculates its popularity score.The model hypothesis popularity administrative center is completely credible and exists in real time Line, needs higher maintenance cost, and there are the inherent shortcomings such as single point failure, time delay be big.Wei et al. [Z.Wei, F.R.Yu, and A.Boukerche,"Trust based security enhancements for vehicular ad hoc networks,"In Proceedings of the 4th International Symposium on Development and Analysis of Intelligent Vehicular Networks and Applications,2014,pp.103- 109.] comprehensively consider the direct trust based on history interaction and the indirect trust based on trust recommendation, and one is proposed for car networking Kind distributed trust appraisal procedure, is exported wherein directly trusting by Bayesian formula, and is trusted indirectly and led by D-S evidence theory Out.The model needs to apply letter trust recommendation information of person's collection about receiver, it will usually biggish time, bandwidth be caused to disappear Consumption.
Summary of the invention
The purpose of the present invention is to overcome the shortcomings of the existing technology and deficiency, and the car networking trust for providing a kind of lightweight is commented Estimate method, the method does not depend on trust center and roadside unit, more meets extensive, the distributed nature of car networking.
The purpose of the present invention is realized by the following technical solution: a kind of car networking method for evaluating trust of lightweight, tool Body includes the following steps:
S1, node previously interact at the end of, interaction both sides all in accordance with interactive experience be other side generate one include itself The trust of digital signature is proved and is sent to other side；
S2, interaction both sides, which receive new trust, proves that posteriority demonstrate,proves its signing messages, and updates and be locally stored to save to certainly The best at most η item of body, which is trusted, to be proved, wherein η ∈ Z+For system parameter；
S3, it is potential interaction start when, potential interactive both sides by the trust being locally stored proof be sent to other side to demonstrate,prove It is bright that itself is believable；
S4, potential interactive both sides verify the letter trusted the authenticity proved and export other side accordingly by digital signature information Appoint value and decide whether to agree to interact, is interacted when both sides agree to.
Preferably, in the step S1, trusting proves specific format are as follows:
TC (B, A)=(ID (B), ID (A), RT (B, A), WG (B), TS (B, A), DS (B, A))
Wherein B and A indicates node, and B is certifier, and A is receiver；ID (B) and ID (A) respectively indicate certifier B and by The unique identifier of letter person A；RT (B, A) indicates assessed value vector, specific format are as follows:
RT (B, A)=(RT (B, A, 1), RT (B, A, 2) ..., RT (B, A, n))
Wherein n indicates to trust the number of aspect, and RT (B, A, i) (i ∈ [1, n]) indicates certifier B to the i-th of receiver A Assessed value in terms of a trust；WG (B) indicates weighted value vector, specific format are as follows:
WG (B)=(WG (B, 1), WG (B, 2) ..., WG (B, n))
Wherein WG (B, i) (i ∈ [1, n]) indicates that certifier B trusts i-th the interest preference level of aspect；TS(B,A) Indicate timestamp when TC (B, A) is generated；DS (B, A) indicates digital signature information.
Further, the RT (B, A, i) is expressed as linguistic variable, including " very good ", " good ", " general ", " poor " " excessively poor "；The WG (B, i) is expressed as linguistic variable, including " very high ", "high", " in ", " low " and " very low ".
Preferably, in the step S2, it is that the trust itself generated proves TC (B, A) that receiver A, which receives certifier B, Afterwards, it first verifies that its signature information D S (B, A), then judges that the size of the locally stored quantity NM (A) and η for trusting and proving is closed System: if NM (A) < η, receiver A directly store TC (B, A)；If NM (A)=η, receiver A calculate every trust proof pair The weighting assessed value answered, and select accordingly and itself best η item trust proof is stored, while deleting other credentials Bright, the trust that receiver A considers proves to include that TC (B, A) and locally stored η item trust proof.
Preferably, in the step S2, the specific steps of weighting assessed value are calculated by TC (B, A) are as follows:
S2.1, the RT (B, A, i) in TC (B, A) is converted to fuzzy evaluation RF (B, A, i) and clear assessment RC (B, A, I), the wherein specific format of RF (B, A, i) are as follows:
RF (B, A, i)=(RF (B, A, i, 1), RF (B, A, i, 2), RF (B, A, i, 3), RF (B, A, i, 4))
Wherein 0≤RF (B, A, i, 1)≤RF (B, A, i, 2)≤RF (B, A, i, 3)≤RF (B, A, i, 4)≤100；RC(B, A, i) be RF (B, A, i) symbolic distance, can specifically be exported by following formula:
S2.2, WG (B, i) in TC (B, A) is converted into fuzzy weighted values WF (B, i) and clear weight WC (B, i), wherein WF The specific format of (B, i) are as follows:
WF (B, i)=(WF (B, i, 1), WF (B, i, 2), WF (B, i, 3), WF (B, i, 4))
Wherein 0≤WF (B, i, 1)≤WF (B, i, 2)≤WF (B, i, 3)≤WF (B, i, 4)≤10；WC (B, i) can be by following Formula export:
The corresponding fuzzy evaluation value SF (B, A) of S2.3, TC (B, A) can calculate are as follows:
The corresponding clear assessed value SC (B, A) of TC (B, A) can calculate are as follows:
S2.4, receiver A only consider time decaying weight WT (B, A) when the most advantageous trust of selection proves, calculate public Formula are as follows:
Wherein, TN indicates current time stamp；TS (B, A) is contained timestamp in TC (B, A)；ω indicates that time window is big It is small；θ is time decay factor, the speed of control WT (B, A) poor decaying at any time；
The corresponding weighting assessed value SW (B, A) of S2.5, TC (B, A) can calculate are as follows:
SW (B, A)=SC (B, A) * WT (B, A).
Preferably, in the step S3, trust the specific format for proving set are as follows:
TCs (A)={ TC (B1,A),TC(B2,A),...,TC(BNM(A),A)}
Wherein NM (A)≤η.
Preferably, the step S4 specific steps are as follows:
S4.1, it is potential interaction start when, the node C as Shi Xinzhe receives the credentials of the node A as receiver After bright set TCs (A), extracting trust therein first is proved, i.e. TC (B1,A)、TC(B2,A)、…、TC(BNM(A), A), if NM (A) < η, then the person C that applies letter to the trust value TV (C, A) of receiver A be set as constant, τ ∈ [0,1)；Otherwise, it applies letter person C passes through Trust the digital signature information in proving for every and verify its authenticity, then exporting every trust proves corresponding weighting assessed value And calculate TV (C, A)；Similarly, the person A that applies letter can be obtained to the trust value TV (A, C) of receiver C；
S4.2, when TV (C, A) >=TH (C) and TV (A, C) >=TH (A), node A is interacted with node C, Middle TH (C), TH (A) ∈ [0,1] are respectively the trust thresholding of node C, node A.
Preferably, in the step S4, applying letter, person C removes consideration time decaying weight WT (B, A) outside, it is also contemplated that interest is inclined Good similarity weight WS (C, B), the weight by the person C that applies letter and certifier B interest preference vector weighted euclidean distance DS (C, B it) exports, specific formula for calculation are as follows:
WS (C, B)=1-DS (C, B).
Further, in the step S4, the corresponding weighting assessed value ST (C, B, A) of TC (B, A) can be calculated are as follows:
ST (C, B, A)=SC (B, A) * WT (B, A) * WS (C, B)
Similarly, it applies letter person C can export TC (B1,A)、TC(B2,A)、…、TC(Bη, A) and corresponding weighting assessed value, and count Calculate the trust value TV (C, A) to receiver A, specific formula for calculation are as follows:
Compared with the prior art, the invention has the following advantages and beneficial effects:
1, the present invention uses complete Ad hoc mode, and the Three roles such as Shi Xinzhe, receiver, certifier are in different assessment ranks Duan Jinhang conversion, independent of trust center and roadside unit, thus more adapts to extensive, distributed car networking environment.
2, the present invention voluntarily stores and provides trust information by receiver, collects without Shi Xinzhe, it is thus possible to substantially Time, bandwidth consumption are reduced, realizes quick, lightweight trust evaluation.
Detailed description of the invention
Fig. 1 is the key step schematic diagram of the car networking method for evaluating trust embodiment of lightweight of the present invention.
Fig. 2 is the simplified example of the car networking method for evaluating trust embodiment of lightweight of the present invention.
Specific embodiment
Technical solution for a better understanding of the present invention, the implementation that the present invention is described in detail provides with reference to the accompanying drawing Example, embodiments of the present invention are not limited thereto.
Embodiment
As shown in Figs. 1-2, the present embodiment is free of trust center and roadside unit, and only by a large amount of ordinary nodes (i.e. vehicle) Composition, is communicated by wireless self-networking mode therebetween.The role of each node be Shi Xinzhe, receiver or certifier it One, and can be converted in different evaluation stages.
Step S1, at the end of node A, B is previously interacted, the B as certifier is the A as receiver according to interactive experience Generating a trust proves TC (B, A), specific format are as follows:
TC (B, A)=(ID (B), ID (A), RT (B, A), WG (B), TS (B, A), DS (B, A)) (1)
Wherein ID (B) and ID (A) respectively indicates the unique identifier of certifier B and receiver A；RT (B, A) indicates assessment It is worth vector, specific format are as follows:
RT (B, A)=(RT (B, A, 1), RT (B, A, 2) ..., RT (B, A, n)) (2)
Wherein n indicates to trust the number of aspect, and RT (B, A, i) (i ∈ [1, n]) indicates certifier B to the i-th of receiver A Assessed value in terms of a trust, value are represented as linguistic variable, as " very good ", " good ", " ", " poor ", " excessively poor " Deng；WG (B) indicates weighted value vector, specific format are as follows:
WG (B)=(WG (B, 1), WG (B, 2) ..., WG (B, n) (3)
Wherein WG (B, i) (i ∈ [1, n]) indicates that certifier B trusts i-th the interest preference level of aspect, value Be represented as linguistic variable, such as " very high ", "high", " in ", " low ", " very low "；TS (B, A) indicates that TC (B, A) is generated When timestamp；DS (B, A) indicates digital signature information.
Similarly, as the B of receiver be as certifier A generate TC (B, A) after send it to certifier A.It is similar Ground, it was demonstrated that person A is also that receiver B generates trust proof TC (A, B) and sends it to receiver B.
Step S2, it is that the trust itself generated proves to first verify that its signature after TC (B, A) that receiver A, which receives certifier B, Information DS (B, A) then judges the size relation of locally stored quantity NM (A) and η for trusting and proving, wherein η ∈ Z+To be System parameter: if NM (A) < η, receiver A directly store TC (B, A)；If NM (A)=η, receiver A calculate every credentials Bright corresponding weighting assessed value, and select accordingly and itself best η item trust proof is stored, while deleting other letters Appointing proves, the trust that receiver A is calculated is proved to trust including TC (B, A) and locally stored η item and be proved.
For calculating the corresponding weighting assessed value of TC (B, A): RT (B, A, i) can be by existing fuzzy letter in TC (B, A) Single additivity weight system [S.Y.Chou, Y.H.Chang, and C.Y.Shen, " A fuzzy simple additive weighting system under group decision-making for facility location selection with objective/subjective attributes,"European Journal of Operational Research, 2008, vol.189, no.1, pp.132-145.] be converted to fuzzy evaluation RF (B, A, i) and clear assessment RC (B, A, i), the wherein specific calculating step of RF (B, A, i) are as follows:
RF (B, A, i)=(RF (B, A, i, 1), RF (B, A, i, 2), RF (B, A, i, 3), RF (B, A, i, 4)) (4)
Wherein, 0≤RF (B, A, i, 1)≤RF (B, A, i, 2)≤RF (B, A, i, 3)≤RF (B, A, i, 4)≤100；RC(B, A, i) be RF (B, A, i) symbolic distance, can specifically be exported by following formula:
Similarly, WG (B, i) can be exchanged into fuzzy weighted values WF (B, i) and clear weight WC (B, i), wherein WF (B, i) Specific format are as follows:
WF (B, i)=(WF (B, i, 1), WF (B, i, 2), WF (B, i, 3), WF (B, i, 4)) (6)
Wherein 0≤WF (B, i, 1)≤WF (B, i, 2)≤WF (B, i, 3)≤WF (B, i, 4)≤10；WC (B, i) can be by following Formula export:
Wherein, j, k are the temporary variable of summation.
Then, the corresponding fuzzy evaluation value SF (B, A) of TC (B, A) can calculate are as follows:
The corresponding clear assessed value SC (B, A) of TC (B, A) can calculate are as follows:
Receiver A only considers time decaying weight WT (B, A) when the most advantageous trust of selection proves, its calculation formula is:
Wherein TN indicates current time stamp；TS (B, A) is contained timestamp in TC (B, A)；ω indicates time window size； θ is time decay factor, the speed of control WT (B, A) poor decaying at any time.
Therefore, the corresponding weighting assessed value SW (B, A) of TC (B, A) can calculate are as follows:
SW (B, A)=SC (B, A) * WT (B, A) (11)
By formula (4)-(10) can be derived from RC (B, A, i) range be [0,100], and WC (B, i), WT (B, A), SC (B, A), the range of SW (B, A) is [0,1].
Similarly, receiver A, which calculates separately locally stored η item trust, proves corresponding weighting assessed value SW (B1,A)、 SW(B2,A)、…、SW(Bη, A), then from SW (B, A), SW (B1,A)、…、SW(Bη, A) in select η the larger value and store pair The trust answered proves, while deleting other and trusting proof.
Step S3, when potential interaction starts, receiver A desire is interacted with the node C as Shi Xinzhe, receiver A Taking out the trust being locally stored first proves, set is denoted as TCs (A), it may be assumed that
TCs (A)={ TC (B1,A),TC(B2,A),...,TC(BNM(A),A)}(12)
Wherein NM (A)≤η.Then, TCs (A) is sent to the person C that applies letter to prove that itself is believable by receiver A.
Similarly, TCs (C) is sent to the node A as Shi Xinzhe to prove that oneself is credible as the node C of receiver Rely.
Step S4, the trust that the person C that applies letter receives receiver A proves to pass through digital signature information first after set TCs (A) The authenticity proved is trusted in verifying, and extracting trust therein proves, i.e. TC (B1,A)、TC(B2,A)、…、TC(BNM(A), A), If NM (A) < η, the person C that applies letter to the trust value TV (C, A) of receiver A be set as lesser constant, τ ∈ [0,1)；Otherwise, it applies Letter person C trusts the digital signature information in proving by every and verifies its authenticity, and it is corresponding then to export every trust proof Weighting assessed value simultaneously calculates TV (C, A).
By taking the corresponding weighting assessed value ST (C, B, A) of the person C that applies letter export TC (B, A) as an example: the person C that applies letter is except the consideration time declines Subtract weight WT (B, A) (i.e. formula (10)) outside, it is also contemplated that interest preference similarity weight WS (C, B), the weight by the person C that applies letter with The weighted euclidean distance DS (C, B) of the interest preference vector of certifier B is exported, specific formula for calculation are as follows:
WS (C, B)=1-DS (C, B) (14)
Therefore, the corresponding weighting assessed value ST (C, B, A) of TC (B, A) can calculate are as follows:
ST (C, B, A)=SC (B, A) * WT (B, A) * WS (C, B) (15)
According to formula (13)-(15) the method, applying letter, person C can export TC (B1,A)、TC(B2,A)、…、TC(Bη,A) Corresponding weighting assessed value, and calculate the trust value TV (C, A) to receiver A, specific formula are as follows:
By formula (13)-(16) can be derived from WS (C, B), ST (C, B, A), TV (C, A) range be [0,1].
If TV (C, A) >=TH (C) (the wherein trust thresholding that TH (C) ∈ [0,1] is node C), then the person C that applies letter agree to by Letter person A interaction, vice versa.
Similarly, also set can be proved according to the trust that the node C as receiver is provided as the node A of Shi Xinzhe TCs (C) exports the trust value TV (A, C) to receiver C, and is according to the size relation decision for trusting thresholding TH (A) with itself No agreement is interacted with receiver C.
When TV (C, A) >=TH (C) and TV (A, C) >=TH (A), node A is interacted with node C.
The above embodiment is a preferred embodiment of the present invention, but embodiments of the present invention are not by above-described embodiment Limitation, other any changes, modifications, substitutions, combinations, simplifications made without departing from the spirit and principles of the present invention, It should be equivalent substitute mode, be included within the scope of the present invention.

Claims (9)

1. a kind of car networking method for evaluating trust of lightweight, which is characterized in that specifically comprise the following steps:
S1, node previously interact at the end of, interaction both sides all in accordance with interactive experience be other side generate one comprising itself number The trust of signature is proved and is sent to other side；
S2, interaction both sides, which receive new trust, proves that posteriority demonstrate,proves its signing messages, and updates and be locally stored to save to itself most Advantageous at most η item, which is trusted, to be proved, wherein η ∈ Z+For system parameter；
S3, it is potential interaction start when, potential interactive both sides by the trust being locally stored proof be sent to other side with prove from Body is believable；
S4, potential interactive both sides verify the trust value trusted the authenticity proved and export other side accordingly by digital signature information With decide whether agree to interact, interacted when both sides agree to.
2. the car networking method for evaluating trust of lightweight according to claim 1, which is characterized in that the step S1 In, trusting proves specific format are as follows:
TC (B, A)=(ID (B), ID (A), RT (B, A), WG (B), TS (B, A), DS (B, A))
Wherein B and A indicates node, and B is certifier, and A is receiver；ID (B) and ID (A) respectively indicate certifier B and receiver A Unique identifier；RT (B, A) indicates assessed value vector, specific format are as follows:
RT (B, A)=(RT (B, A, 1), RT (B, A, 2) ..., RT (B, A, n))
Wherein n indicates to trust the number of aspect, and RT (B, A, i) (i ∈ [1, n]) indicates certifier B to i-th of letter of receiver A Appoint the assessed value of aspect；WG (B) indicates weighted value vector, specific format are as follows:
WG (B)=(WG (B, 1), WG (B, 2) ..., WG (B, n))
Wherein WG (B, i) (i ∈ [1, n]) indicates that certifier B trusts i-th the interest preference level of aspect；TS (B, A) is indicated Timestamp when TC (B, A) is generated；DS (B, A) indicates digital signature information.
3. the car networking method for evaluating trust of lightweight according to claim 2, which is characterized in that the RT (B, A, i) It is expressed as linguistic variable, including " very good ", " good ", " general ", " poor " and " excessively poor "；The WG (B, i) is expressed as language Variable, including " very high ", "high", " in ", " low " and " very low ".
4. the car networking method for evaluating trust of lightweight according to claim 1, which is characterized in that the step S2 In, it is that the trust itself generated proves to first verify that its signature information D S (B, A) after TC (B, A) that receiver A, which receives certifier B, Then judge the size relation of locally stored quantity NM (A) and η for trusting and proving: if NM (A) < η, receiver A are directly deposited It stores up TC (B, A)；If NM (A)=η, receiver A, which calculate every trust, proves corresponding weighting assessed value, and is selected accordingly to certainly The best η item of body, which is trusted, to be proved to be stored, while being deleted other and being trusted proof, and the trust proof that receiver A considers includes TC (B, A) and locally stored η item, which are trusted, to be proved.
5. the car networking method for evaluating trust of lightweight according to claim 1, which is characterized in that in the step S2, The specific steps of weighting assessed value are calculated by TC (B, A) are as follows:
S2.1, the RT (B, A, i) in TC (B, A) is converted to fuzzy evaluation RF (B, A, i) and clear assessment RC (B, A, i), The specific format of middle RF (B, A, i) are as follows:
RF (B, A, i)=(RF (B, A, i, 1), RF (B, A, i, 2), RF (B, A, i, 3), RF (B, A, i, 4))
Wherein 0≤RF (B, A, i, 1)≤RF (B, A, i, 2)≤RF (B, A, i, 3)≤RF (B, A, i, 4)≤100；RC (B, A, i) For the symbolic distance of RF (B, A, i), can specifically be exported by following formula:
S2.2, WG (B, i) in TC (B, A) is converted into fuzzy weighted values WF (B, i) and clear weight WC (B, i), wherein WF (B, i) Specific format are as follows:
WF (B, i)=(WF (B, i, 1), WF (B, i, 2), WF (B, i, 3), WF (B, i, 4))
Wherein 0≤WF (B, i, 1)≤WF (B, i, 2)≤WF (B, i, 3)≤WF (B, i, 4)≤10；WC (B, i) can be by following formula Export:
The corresponding fuzzy evaluation value SF (B, A) of S2.3, TC (B, A) can calculate are as follows:
The corresponding clear assessed value SC (B, A) of TC (B, A) can calculate are as follows:
S2.4, receiver A only consider time decaying weight WT (B, A) when the most advantageous trust of selection proves, its calculation formula is:
Wherein, TN indicates current time stamp；TS (B, A) is contained timestamp in TC (B, A)；ω indicates time window size；θ is Time decay factor, the speed of control WT (B, A) poor decaying at any time；
The corresponding weighting assessed value SW (B, A) of S2.5, TC (B, A) can calculate are as follows:
SW (B, A)=SC (B, A) * WT (B, A).
6. the car networking method for evaluating trust of lightweight according to claim 1, which is characterized in that the step S3 In, trust the specific format for proving set are as follows:
TCs (A)={ TC (B1, A), TC (B2, A) ..., TC (BNM(A), A) }
Wherein NM (A)≤η.
7. the car networking method for evaluating trust of lightweight according to claim 1, which is characterized in that the step S4 tool Body are as follows:
S4.1, it is potential interaction start when, the node C as Shi Xinzhe receive the node A as receiver trust prove collection After closing TCs (A), extracting trust therein first is proved, i.e. TC (B1, A), TC (B2, A) ..., TC (BNM(A), A), if NM (A) < η, then the person C that applies letter to the trust value TV (C, A) of receiver A be set as constant, τ ∈ [0,1)；Otherwise, the person C that applies letter passes through every Item trusts the digital signature information in proving and verifies its authenticity, and then exporting every trust proves corresponding weighting assessed value simultaneously It calculates TV (C, A)；Similarly, the person A that applies letter can be obtained to the trust value TV (A, C) of receiver C；
S4.2, when TV (C, A) >=TH (C) and TV (A, C) >=TH (A), node A is interacted with node C, wherein TH (C), TH (A) ∈ [0,1] is respectively the trust thresholding of node C, node A.
8. the car networking method for evaluating trust of lightweight according to claim 1, which is characterized in that the step S4 In, applying letter, person C removes consideration time decaying weight WT (B, A) outside, it is also contemplated that interest preference similarity weight WS (C, B), the weight It is exported by the weighted euclidean distance DS (C, B) of the interest preference vector of the person C that applies letter and certifier B, specific formula for calculation are as follows:
WS (C, B)=1-DS (C, B).
9. the car networking method for evaluating trust of lightweight according to claim 8, which is characterized in that the step S4 In, the corresponding weighting assessed value ST (C, B, A) of TC (B, A) can calculate are as follows:
ST (C, B, A)=SC (B, A) * WT (B, A) * WS (C, B)
Similarly, it applies letter person C can export TC (B1, A), TC (B2, A) ..., TC (Bη, A) and corresponding weighting assessed value, and calculate To the trust value TV (C, A) of receiver A, specific formula for calculation are as follows:
CN201811315880.6A 2018-11-07 2018-11-07 Lightweight Internet of vehicles trust evaluation method Active CN109347852B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811315880.6A CN109347852B (en) 2018-11-07 2018-11-07 Lightweight Internet of vehicles trust evaluation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811315880.6A CN109347852B (en) 2018-11-07 2018-11-07 Lightweight Internet of vehicles trust evaluation method

Publications (2)

Publication Number Publication Date
CN109347852A true CN109347852A (en) 2019-02-15
CN109347852B CN109347852B (en) 2020-12-11

Family

ID=65313869

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811315880.6A Active CN109347852B (en) 2018-11-07 2018-11-07 Lightweight Internet of vehicles trust evaluation method

Country Status (1)

Country Link
CN (1) CN109347852B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110445788A (en) * 2019-08-09 2019-11-12 西安电子科技大学 The trust evaluation system and method for content oriented under a kind of vehicular ad hoc network environment
CN113115317A (en) * 2021-03-05 2021-07-13 暨南大学 Privacy protection method for vehicle trust score in Internet of vehicles
CN113380024A (en) * 2021-05-27 2021-09-10 重庆邮电大学 Reputation updating method and trust calculation method based on Internet of vehicles
CN116996521A (en) * 2023-09-28 2023-11-03 江西农业大学 Relay committee cross-chain interaction system and method based on trust evaluation model

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101404592A (en) * 2008-11-14 2009-04-08 西安交通大学 Total trust degree decision method based on history evidence window
CN102222305A (en) * 2011-06-13 2011-10-19 北京理工大学 Creditworthiness evaluation method under distributed environment
CN104392373A (en) * 2014-12-02 2015-03-04 西安邮电大学 Interactive decision-making method based on key historical behaviors in cloud computing environment
US20160248746A1 (en) * 2015-02-25 2016-08-25 Verisign, Inc. Automating internet of things security provisioning
CN106330910A (en) * 2016-08-25 2017-01-11 重庆邮电大学 Strong privacy protection dual authentication method based on node identities and reputations in Internet of vehicles
CN106412912A (en) * 2016-06-22 2017-02-15 长安大学 Node trust assessment method facing car networking
CN107665405A (en) * 2017-09-26 2018-02-06 北京邮电大学 A kind of vehicle credit management method and device

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101404592A (en) * 2008-11-14 2009-04-08 西安交通大学 Total trust degree decision method based on history evidence window
CN102222305A (en) * 2011-06-13 2011-10-19 北京理工大学 Creditworthiness evaluation method under distributed environment
CN104392373A (en) * 2014-12-02 2015-03-04 西安邮电大学 Interactive decision-making method based on key historical behaviors in cloud computing environment
US20160248746A1 (en) * 2015-02-25 2016-08-25 Verisign, Inc. Automating internet of things security provisioning
CN106412912A (en) * 2016-06-22 2017-02-15 长安大学 Node trust assessment method facing car networking
CN106330910A (en) * 2016-08-25 2017-01-11 重庆邮电大学 Strong privacy protection dual authentication method based on node identities and reputations in Internet of vehicles
CN107665405A (en) * 2017-09-26 2018-02-06 北京邮电大学 A kind of vehicle credit management method and device

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ARPITA BHARGAVA: ""Computational trust model for Internet of Vehicles"", 《2017 CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY (CICT)》 *
张文博、包振山、李健: ""基于可信计算的车联网云安全模型"", 《武汉大学学报(理学版)》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110445788A (en) * 2019-08-09 2019-11-12 西安电子科技大学 The trust evaluation system and method for content oriented under a kind of vehicular ad hoc network environment
CN113115317A (en) * 2021-03-05 2021-07-13 暨南大学 Privacy protection method for vehicle trust score in Internet of vehicles
CN113380024A (en) * 2021-05-27 2021-09-10 重庆邮电大学 Reputation updating method and trust calculation method based on Internet of vehicles
CN116996521A (en) * 2023-09-28 2023-11-03 江西农业大学 Relay committee cross-chain interaction system and method based on trust evaluation model
CN116996521B (en) * 2023-09-28 2023-12-15 江西农业大学 Relay committee cross-chain interaction system and method based on trust evaluation model

Also Published As

Publication number Publication date
CN109347852B (en) 2020-12-11

Similar Documents

Publication Publication Date Title
CN109347852A (en) A kind of car networking method for evaluating trust of lightweight
Ning et al. Vehicular social networks: Enabling smart mobility
Yao et al. Using trust model to ensure reliable data acquisition in VANETs
CN106940829B (en) Personalized path recommendation method in Internet of vehicles environment
Schmitt et al. Vehicle route guidance systems: Classification and comparison
Deng et al. Electronic payment schemes based on blockchain in VANETs
CN109195162A (en) It polymerize the message reliability appraisal procedure of two kinds of trust evaluations in a kind of car networking
CN113313264B (en) Efficient federal learning method in Internet of vehicles scene
CN109359169B (en) Shared bicycle reverse behavior real-time identification method based on probability map model
Li et al. A dynamic and scalable user-centric route planning algorithm based on polychromatic sets theory
Wu et al. Information design for regulating traffic flows under uncertain network state
CN107134137A (en) A kind of Dynamic User-Optimal Route Choice method for considering real time information
CN107040516B (en) Efficient pseudonym management and data integrity protection protocol
CN106971535A (en) A kind of urban traffic blocking index calculating platform based on Floating Car GPS real time datas
CN113497801B (en) Sybil attack detection method based on timestamp chain
Knorn et al. A result on implicit consensus with application to emissions control
CN105427394B (en) Congestion-pricing optimum toll rate based on trial-and-error method and motor vehicle flow determines method
Huang et al. Trust management model of vanets based on machine learning and active detection technology
CN107205046B (en) Towards the following operating condition Information Acquisition System of intelligent network connection vehicle
Didouh et al. TileChain: A Blockchain-Based Framework for Security Service Management For Vehicular Communications
Lebre et al. Partial and local knowledge for global efficiency of urban vehicular traffic
CN107222572A (en) In-vehicle networking Social ecological balance information interaction security design methods under a kind of intelligent network connection environment
Kan et al. Edge assisted misbehavior detection for platoons
CN110147910A (en) A kind of bus car crowding real-time predicting method based on BP neural network
Lv et al. Introduction to the Special Issue on Sustainable Solutions for the Intelligent Transportation Systems

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant