The exact security of ECIES in the generic group model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2260, Issue , 2001, Pages 73-84

  Smart, N P ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ENCRYPTION ALGORITHMS; EXACT SECURITY; GROUP MODELING;

CRYPTOGRAPHY;

EID: 84946832516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45325-3_8     Document Type: Conference Paper

References (19)

1. ANSI. ANSI X9.63-2001. Key agreement and key transport using elliptic curve cryptography. ANSI Standards Committee X9, Working Draft, 2001.
2. SECG. SEC 1: Elliptic Curve Cryptography, Version 1. 0. Standards for Efficient Cryptography Group, 2000.
3. M. Abdalla, M. Bellare and P. Rogaway. DHAES: An encryption scheme based on the Diffie-Hellman problem. Submission to P1363a:Standar d specifications for Public-Key-Cryptography:A dditional techniques, 2000.
4. M. Bellare and P. Rogaway. Minimizing the use of random oracles in authenticated encryption schemes. In Information and Communications Security, Springer- Verlag LNCS 1334, 1–16.
5. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology - EUROCRYPT’94, Springer-Verlag LNCS 950, 92–111, 1995.
6. D. Bleichenbacher. Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS#1. In Advances in Cryptology - CRYPTO’98, Springer-Verlag LNCS 1462, 1–12, 1998.
7. D.R.L. Brown. Concrete lower bounds on the security of ECDSA in the Generic Group Model. Preprint, 2001.
8. D.R.L. Brown and D.B. Johnson. Formal security proofs for a signature scheme with partial message recovery. In Topics in Cryptology:CT-RSA 2001, Springer-Verlag LNCS 2020, 126–142, 2001.
9. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology - CRYPTO’98, Springer-Verlag LNCS 1462, 13–25, 1998.
10. D. Dolev, C. Dwork and M. Naor. Non-malleable cryptography. In 23rd Annual ACM Symposium on Theory of Computing, 542–552, 1991.
11. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology - CRYPTO’94, Springer-Verlag LNCS 196, 10–18, 1985.
12. E. Fujisaki, T. Okamoto, D. Pointcheval and J. Stern. RSA–OAEP is Secure Under the RSA Assumption. In Advances in Cryptology - CRYPTO 2001, Springer-Verlag LNCS 2139, 259–273, 2001.
13. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28, 270–299, 1984.
14. M. Jakobsson and C.P. Schnorr. Security of signed ElGamal encryption. In Advances in Cryptology - ASIACRYPT 2000, Springer-Verlag LNCS 1976, 73–89, 2000.
15. M. Noar and M. Yung. Public key cryptosystems provably secure against chosen ciphertext attacks. In 22nd Annual ACM Symposium on Theory of Computation, 426–437, 1990.
16. C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology - CRYPTO’91, Springer- Verlag LNCS 576, 434–444, 1991.
17. P. Rogaway. Review of SEC 1. Letter to SECG, 1999. Available from http://www.secg.org/.
18. V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology - EUROCRYPT’97, Springer-Verlag 1233, 256–266, 1997.
19. V. Shoup. OAEP Reconsidered. In Advances in Cryptology - CRYPTO 2001, Springer-Verlag LNCS 2139, 238–258, 2001.