R. Cramer and V. Shoup. A practical public key cryptosystem secure against adaptive chosen cipher text attacks. In Proc. CRYPTO '98, Springer Verlag LNCS, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Framework for Password-Based Authenticated Key Exchange - Gennaro, Lindell (2003) (19 citations) (Correct)
....of Cramer and Shoup [10] The advantages of this abstraction are as follows: 1. The security of the resulting protocol can be intuitively understood. Our work can thus also be seen as an explanation of the KOY protocol (in a similar way to the fact that [10] can be seen as an explanation of [9]) 2. The proof of our protocol is significantly simpler than that of [21] although there are definite similarities in the high level overview of the proof (see [20] for a full proof of the [21] protocol) Having abstracted out the building blocks of the protocol, the exact requirements on each ....
.... protocol framework since any CCA2 secure encryption scheme can be used as a non interactive non malleable commitment scheme (in the common reference string model) The KOY protocol implicitly contains one such construction for the encryption scheme of Cramer and Shoup based on the DDH assumption [9]. We prove this fact and then build new smooth projective hash functions for the recent CCA2 secure encryption schemes of Cramer and Shoup [10] that are based on the quadratic residuosity and N residuosity assumptions. Our constructions of these smooth projective hash functions build on the work ....
[Article contains additional citation context not shown here]
R. Cramer and V.Shoup. A practical public-key cryptosystem secure against adaptive chosen ciphertexts attacks. In CRYPTO'98, Springer-Verlag (LNCS 1462), pages 13--25, 1998.
Universal Hash Proofs and a Paradigm for Adaptive Chosen - Ciphertext Secure Public-Key (2001) Self-citation (Cramer Shoup) (Correct)
No context found.
R. Cramer and V. Shoup. A practical public key cryptosystem secure against adaptive chosen cipher text attacks. In Proc. CRYPTO '98, Springer Verlag LNCS, 1998.
Universal Hash Proofs and a Paradigm for Adaptive Chosen.. - Cramer, Shoup (2001) (35 citations) Self-citation (Cramer Shoup) (Correct)
....their scheme is a valuable proof of concept, it appears that it has no practical signi cance. Up until now, the only practical scheme that has been proposed that can be proven secure against adaptive chosen ciphertext attack under a reasonable intractability assumption is that of Cramer and Shoup [CS]. This scheme is based on the Decision Die Hellman (DDH) assumption, and is not much less ecient than traditional ElGamal encryption. Other practical schemes have been proposed and heuristically proved secure against adaptive chosen ciphertext. More precisely, these schemes are proven secure under ....
....assumption. Ours is the rst publickey encryption scheme secure against adaptive chosen ciphertext attack under this assumption that is at all practical, as opposed to theoretical constructions such as [DDN] Before presenting the new schemes, we show how the public key encryption scheme from [CS] can be viewed as a special case of our general construction. 8.1 Schemes based on the Decision Die Hellman assumption 8.1.1 Derivation We show how to derive a secure encryption scheme based on the Decision Die Hellman assumption from our generic encryption scheme construction in x6, together ....
[Article contains additional citation context not shown here]
R. Cramer and V. Shoup. A practical public key cryptosystem secure against adaptive chosen cipher text attacks. In Proc. CRYPTO '98, Springer Verlag LNCS, 1998.
Universal Hash Proofs and a Paradigm for Adaptive Chosen.. - Cramer, Shoup (2001) (35 citations) Self-citation (Cramer Shoup) (Correct)
....their scheme is a valuable proof of concept, it appears that it has no practical signi cance. Up until now, the only practical scheme that has been proposed that can be proven secure against adaptive chosen ciphertext attack under a reasonable intractability assumption is that of Cramer and Shoup [3]. This scheme is based on the Decision Die Hellman (DDH) assumption, and is not much less ecient than traditional ElGamal encryption. Other practical schemes have been proposed and heuristically proved secure against adaptive chosen ciphertext. More precisely, these schemes are proven secure ....
....assumption. Ours is the rst publickey encryption schemes secure against adaptive chosen ciphertext attack under this assumption, that is quite practical, as opposed to theoretical constructions such as [4] Before presenting the new schemes, we show how the public key encryption scheme from [3] can be viewed as a special case of our general construction. 8.1 Schemes based on the DDH Assumption Let G be a group of given large prime order q, and with a given generator g, such that the basic group operations can be performed eciently. Let log g : G ZZ q denote the usual discrete ....
[Article contains additional citation context not shown here]
R. Cramer and V. Shoup. A practical public key cryptosystem secure against adaptive chosen cipher text attacks. In: Proc. CRYPTO '98, Springer Verlag LNCS, 1998.
Multi-trapdoor Commitments and their Applications to Proofs of.. - Gennaro (2004) (3 citations) (Correct)
No context found.
R. Cramer and V.Shoup. A practical public-key cryptosystem secure against adaptive chosen ciphertexts attacks. In CRYPTO'98, Springer-Verlag (LNCS 1462), pages 13--25, 1998.
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