Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1907602> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Q1907602 subject Q8273680.
- Q1907602 abstract "In cryptography, a three-pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without the need to exchange or distribute encryption keys. Such message protocols should not be confused with various other algorithms which use 3 passes for authentication. It is called a three-pass protocol because the sender and the receiver exchange three encrypted messages. The first three-pass protocol was developed by Adi Shamir circa 1980, and is described in more detail in a later section. The basic concept of the Three-Pass Protocol is that each party has a private encryption key and a private decryption key. The two parties use their keys independently, first to encrypt the message, and then to decrypt the message.The protocol uses an encryption function E and a decryption function D. The encryption function uses an encryption key e to change a plaintext message m into an encrypted message, or ciphertext, E(e,m). Corresponding to each encryption key e there is a decryption key d which allows the message to be recovered using the decryption function, D(d,E(e,m))=m. Sometimes the encryption function and decryption function are the same.In order for the encryption function and decryption function to be suitable for the Three-Pass Protocol they must have the property that for any message m, any encryption key e with corresponding decryption key d and any independent encryption key k, D(d,E(k,E(e,m))) = E(k,m). In other words, it must be possible to remove the first encryption with the key e even though a second encryption with the key k has been performed. This will always be possible with a commutative encryption. A commutative encryption is an encryption that is order-independent, i.e. it satisfies E(a,E(b,m))=E(b,E(a,m)) for all encryption keys a and b and all messages m. Commutative encryptions satisfy D(d,E(k,E(e,m))) = D(d,E(e,E(k,m))) = E(k,m). The Three-Pass Protocol works as follows: The sender chooses a private encryption key s and a corresponding decryption key t. The sender encrypts the message m with the key s and sends the encrypted message E(s,m) to the receiver. The receiver chooses a private encryption key r and a corresponding decryption key q and super-encrypts the first message E(s,m) with the key r and sends the doubly encrypted message E(r,E(s,m)) back to the sender. The sender decrypts the second message with the key t. Because of the commutativity property described above D(t,E(r,E(s,m)))=E(r,m) which is the message encrypted with only the receiver's private key. The sender sends this to the receiver.The receiver can now decrypt the message using the key q, namely D(q,E(r,m))=m the original message.Notice that all of the operations involving the sender's private keys s and t are performed by the sender, and all of the operations involving the receiver's private keys r and q are performed by the receiver, so that neither party needs to know the other party's keys.".
- Q1907602 wikiPageWikiLink Q1162538.
- Q1907602 wikiPageWikiLink Q141090.
- Q1907602 wikiPageWikiLink Q1589480.
- Q1907602 wikiPageWikiLink Q188295.
- Q1907602 wikiPageWikiLink Q189569.
- Q1907602 wikiPageWikiLink Q212108.
- Q1907602 wikiPageWikiLink Q251262.
- Q1907602 wikiPageWikiLink Q2716994.
- Q1907602 wikiPageWikiLink Q3042450.
- Q1907602 wikiPageWikiLink Q320624.
- Q1907602 wikiPageWikiLink Q33456.
- Q1907602 wikiPageWikiLink Q3505167.
- Q1907602 wikiPageWikiLink Q3527199.
- Q1907602 wikiPageWikiLink Q3913.
- Q1907602 wikiPageWikiLink Q471771.
- Q1907602 wikiPageWikiLink Q49008.
- Q1907602 wikiPageWikiLink Q505798.
- Q1907602 wikiPageWikiLink Q554830.
- Q1907602 wikiPageWikiLink Q589491.
- Q1907602 wikiPageWikiLink Q603880.
- Q1907602 wikiPageWikiLink Q6195974.
- Q1907602 wikiPageWikiLink Q8273680.
- Q1907602 wikiPageWikiLink Q864003.
- Q1907602 wikiPageWikiLink Q8789.
- Q1907602 comment "In cryptography, a three-pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without the need to exchange or distribute encryption keys. Such message protocols should not be confused with various other algorithms which use 3 passes for authentication. It is called a three-pass protocol because the sender and the receiver exchange three encrypted messages.".
- Q1907602 label "Three-pass protocol".