A designer's guide to KEMs

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

Volumn 2898, Issue , 2003, Pages 133-151

  Dent, Alexander W ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS; PUBLIC KEY CRYPTOGRAPHY;

ASYMMETRIC ENCRYPTION; DATA ENCAPSULATION MECHANISMS; DETERMINISTIC ALGORITHMS; ENCRYPTION ALGORITHMS; GENERIC CONSTRUCTION; PROBABILISTIC ALGORITHM; PUBLIC-KEY ENCRYPTION SCHEME; SYMMETRIC ENCRYPTION;

DATA ENCAPSULATION;

EID: 33646842805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40974-8_12     Document Type: Article

References (13)

1. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In H. Krawczyk, editor, Advances in Cryptology - Crypto '98, LNCS 1462, pages 26-45. Springer-Verlag, 1998.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. of the First ACM Conference on Computer and Communications Security, pages 62-73, 1993.
3. D. Boneh, A. Joux, and A. Nguyen. Why textbook ElGamal and RSA encryption are insecure. In T. Okamoto, editor, Advances in Cryptology - Asiacrypt 2000, LNCS 1976, pages 30-43. Springer-Verlag, 2000.
4. R. Cramer and V. Shoup. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. Available from http://shoup.net/, 2002.
5. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1976.
6. E. Fujisaki and T. Okamoto. How to enhance the security of public-key encryption at minimal cost. In H. Imai and Y. Zheng, editors, Public Key Cryptography, LNCS 1560, pages 53-68. Springer-Verlag, 1999.
7. M. Joye, J. Quisquater, and M. Yung. On the power of misbehaving adversaries and security analysis of the original EPOC. In D. Naccache, editor, Topics in Cryptography - CT-RSA 2001, LNCS 2020, pages 208-222. Springer-Verlag, 2001.
8. S. Lucks. A variant of the Cramer-Shoup cryptosystem for groups of unknown order. In Y. Zheng, editor, Advances in Cryptology - Asiacrypt 2002, LNCS 2501, pages 27-45. Springer-Verlag, 2002.
9. A. J. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
10. T. Okamoto and D. Pointcheval. The gap problems: A new class of problems for the security of cryptographic schemes. In K. Kim, editor, Public Key Cryptography, LNCS 1992, pages 104-118. Springer-Verlag, 2001.
11. T. Okamoto and D. Pointcheval. REACT: Rapid enhanced-security asymmetric cryptosystem transform. In D. Naccache, editor, Proceedings of CT-RSA 2001, LNCS 2020, pages 159-175. Springer-Verlag, 2001.
12. M. O. Rabin. Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science, 1979.
13. V. Shoup. A proposal for the ISO standard for public-key encryption (version 2.0). Available from http://shoup.net/, 2001.