D. Beaver. Plug and play cryptography. In Advances in Cryptology-- Crypto '97, 1997. 22 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Why Chosen Ciphertext Security Matters - Shoup (1998) (19 citations) (Correct)
....original Di#e Hellman key exchange protocol. It is often, and incorrectly, asserted that breaking the Di#e Hellman key exchange protocol is equivalent to solving the Di#e Hellman problem. This is not true under any 18 Other places where the decisional Di#e Hellman assumption is used include [2, 4, 8, 19, 23, 24]. With this background, we can present ElGamal s encryption scheme. In this scheme, we assume that messages can be encoded as elements in G, which is easy to do, in fact. Secret Key: random z in Z q G: u, e) where u = g , e = h m, r in Z q is random. Decryption of (u, e) m = ....
D. Beaver. Plug and play cryptography. In Advances in Cryptology-- Crypto '97, 1997. 22
Why Chosen Ciphertext Security Matters - Shoup (1998) (19 citations) (Correct)
....Diffie Hellman key exchange protocol. 4 4 It is often, and incorrectly, asserted that breaking the Diffie Hellman key exchange protocol is equivalent to solving the Diffie Hellman problem. This is not true under any Other places where the decisional Diffie Hellman assumption is used include [2, 4, 8, 19, 23, 24]. With this background, we can present ElGamal s encryption scheme. In this scheme, we assume that messages can be encoded as elements in G, which is easy to do, in fact. Secret Key: random z in Z q Public Key: h = g z Encryption of m 2 G: u; e) where u = g r , e = h r m, r in Z q is ....
D. Beaver. Plug and play cryptography. In Advances in Cryptology-- Crypto '97, 1997.
On the Security of ElGamal based Encryption - Tsiounis, Yung (1998) (76 citations) (Correct)
.... under the random oracle model [BR94,BR97] and then construct practical random oracles under, e.g. variants of the decision Diffie Hellman assumption as was advocated and done in [Can97] Recently, some results have utilized the decision Diffie Hellman assumption or some of its variants (see [FTY96,Bea97,Bea96,NR97,Can97,CS98]) The last three works also claim the correctness of the first result we report here, but as a side issue (since they mainly deal with other interesting problems) and without a proof. We believe that the exact proof of security together with related results presented here is a central issue which ....
D. Beaver. Plug and play cryptography. In Advances in Cryptology --- CRYPTO '97 Proceedings, LLNCS 1294, Santa Barbara, CA, August 17-- 21 1997. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC