Simple Key Agreement Protocol

The exponential key exchange itself does not indicate prior agreement or subsequent authentication between participants. It has therefore been described as an anonymous key memorandum of understanding. Key exchange algorithm, often called key exchange protocol, is any method in cryptography that allows the exchange of secret cryptographic keys between two parties, usually via a public communication channel. In cryptography, a key memorandum of understanding is a protocol in which two or more parties can agree on a key so that both influence the outcome. If this is done correctly, it prevents undesirable third parties from imposing an important decision on the appropriate parties. Protocols that are useful in practice also do not reveal to a listening party the key that has been agreed upon. Three-headed authenticated leniency is an important cryptographic technique in secure communication areas, where two customers who each share a human password with a trusted server can agree on a secure session key. In recent years, many parties have proposed authenticated key exchange protocols. However, to our knowledge, not everyone can meet safety and efficiency requirements simultaneously. That`s why we would like to propose in this document a new simple password-based protocol for the replacement key. Compared to other existing protocols, our proposed protocol does not require a public key to a server, but can withstand various known attacks. Therefore, we think it is appropriate for some practical scenarios.

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. The first public public key memorandum of understanding [1] that meets the above criteria was the Diffie-Hellman key exchange, in which two parties jointly exposed a generator to random numbers, so that an earpiece cannot easily determine what the resulting value is used to create a common key. If you have a way to ensure the integrity of a freed key 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. A large number of cryptographic authentication schemes and protocols have been designed to provide authenticated key agreements to prevent man-in-the-middle and related attacks.

These methods typically mathematically link the agreed key to other agreed data, such as.B. key password protocols identified by password authentication require the separate setting up of a password (which may be less than a key) in a way that is both private and integrity. These are designed to withstand man-in-the-middle and other active attacks on the password and established keys. For example, DH-EKE, SPEKE and SRP are Diffie-Hellman password authentication variants. A widespread mechanism for repelling these attacks is the use of digitally signed keys, which must be secured for integrity: if Bob`s key is signed by a trusted third party guarantor of his identity, Alice can have great confidence that a signed key she receives is not an attempt to intercept Eve. If Alice and Bob have an infrastructure with public keys, they can digitally sign an agreed Hellman Diffie key or the public key Diffie Hellman at

This entry was posted in Uncategorized. Bookmark the permalink.