A Practical Elliptic Curve Public Key Encryption Scheme Provably Secure Against Adaptive Chosen-message Attack
نویسنده
چکیده
We study elliptic curve cryptosystems by first investigating the schemes defined over Zp and show that the scheme is provably secure against adaptive chosen cipher-text attack under the decisional DiffieHellman assumption. Then we derive a practical elliptic curve cryptosystem by making use of some nice elliptic curve where the decisional DiffieHellman assumption is reserved.
منابع مشابه
PSEC: Provably Secure Elliptic Curve Encryption Scheme (Submission to P1363a)
We describe an elliptic curve encryption scheme, PSEC (provably secure elliptic curve encryption scheme), which has two versions: PSEC-1 and PSEC-2. PSEC-1 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function and a random function (hash function). PSEC-2 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function, two random funct...
متن کاملDesign and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
A new public key encryption scheme, along with several variants, is proposed and analyzed. The scheme and its variants are quite practical, and are proved secure against adaptive chosen ciphertext attack under standard intractability assumptions. These appear to be the first publickey encryption schemes in the literature that are simultaneously practical and provably secure. This paper is a sig...
متن کاملA Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
1 I n t r o d u c t i o n In this paper, we present and analyze a new public key cryptosystem that is provably secure against adaptive chosen ciphertext attack (as defined by Rackoff and Simon [20]). The scheme is quite practical, requiring just a few exponentiations over a group. Moreover, the proof of security relies only on a standard intractability assumption, namely, the hardness of the Di...
متن کاملProvably Secure Length-saving Public-key Encryption Scheme under the Computational Diie-hellman Assumption
A design of secure and eecient public-key encryption schemes under weaker computational assumptions has been regarded as an important and challenging task. As far as ElGamal-type encryption schemes are concerned, some variants of the original ElGamal encryption scheme based on the weaker computational assumption have been proposed. For instance, security of the ElGamal variant of Fujisaki-Okamo...
متن کاملPsec{3: Provably Secure Elliptic Curve Encryption Scheme { V3 (submission to P1363a)
We describe a new version of the elliptic curve encryption schemes PSEC (Provably Secure Elliptic Curve). PSEC{3 is a public-key encryption system that uses the elliptic curve El Gamal trapdoor function and two random functions (hash functions) as well as any semantically secure symmetric encryption scheme, such as the one-time pad, or any classical block-cipher. Furthermore, we dene a new prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003