Typically, the duration of an AKA protocol consists of approximately a computational time and a transfer time. We can only consider airtime here, since we already know the corresponding calculation time of each protocol. In terms of transmission time, we believe that transmission time is mainly related to message size and hardware power. We assume that these hardware devices have similar performance. So if the message size is longer, it will take longer to transfer it. Fortunately, we analyzed the size of the messages in these protocols in the analysis of computational costs. To avoid the use of additional off-band authentication factors, Davies and Price proposed the use of Ron Rivest and Adi Shamir`s Interlock protocol, which has come under subsequent attack and refinement. In this module, the performance of our protocol is analyzed according to calculation costs and deadlines. We also show that our protocol will be compared to other related protocols in terms of effectiveness [13, 14]. Table 1 shows that our protocol has a smaller message size than the Dang protocol and the same size as the Bala Protocol. As a result, our protocol may become stronger compared to other ID-based protocols or be at the same level of security with less duration. In VANETs, communication channels between vehicles and nearby road infrastructure are generally implemented through special DSRC protocols .
Using these channels, a vehicle can send messages, such as information or traffic conditions, to nearby vehicles and road infrastructure for a uniform period. This information can be used by drivers to plan, revise and optimize their routes. Depending on the level of connectivity of a city, the traffic management centre (a trusted authority) can redirect traffic, make certain adjustments to improve traffic flow and thus reduce traffic structure. Ford and Kaliski described the first key call methods verified in 2000. Accuracy. The accuracy of our minutes is presented as follows: if you have a way to ensure the integrity of a key released via a public channel, you can exchange Diffie Hellman keys to deduct a short-term released key and then authenticate that the keys match. One option is to use a key reading, as in PGPfone. However, voice authentication assumes that it is not possible for a middle man to summon the voice of one participant in real time to another, which may be an undesirable hypothesis. These protocols can be designed to work even with a small public value, for example. B a password. Variations on this topic have been proposed for Bluetooth coupling protocols.
First sentence. Suppose, and are three random oracles in the eCK model. After the difficult problem of the GDH, no opponent can break the security of the protocol in polynom time.