Security of signed ElGamal encryption

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

Volumn 1976, Issue , 2000, Pages 73-89

  Schnorr, Claus Peter ^a   Jakobsson, Markus ^b  

^a GOETHE UNIVERSITY   (Germany)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

CHOSEN CIPHERTEXT ATTACK; ELGAMAL ENCRYPTION; GENERIC MODELING; PRACTICAL SCHEMES; PRIVATE INFORMATION RETRIEVAL; RANDOM ORACLE MODEL; SCHNORR SIGNATURE; SECURITY PROOFS;

SECURITY OF DATA;

EID: 84937417404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_7     Document Type: Conference Paper

References (27)

1. M. Abdalla, M. Bellare and P. Rogaway: DHES: An Encryption Scheme Based on the Diffie-Hellman Problem. Contributions to P1363, ftp: //stdgbbs.ieee.org/pub/p1363/contributions/aes-uhf.ps
2. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway: Plaintext Awareness, Non-Malleability, and Chosen Ciphertext Security: Implications and Separations. Crypto’98, LNCS 1462, pp. 26–45, 1998.
3. D. Boneh and R.J. Lipton: Algorithms for black-box fields and their application in cryptography. Crypto’96, LNCS 1109, pp. 283–297, 1996.
4. M. Bellare and P. Rogaway: Random Oracles are Practical: a Paradigms for Designing Efficient Protocols. 1st ACM Conference on Computer Communication Security, pp. 62–73, 1993.
5. M. Bellare and P. Rogaway: Optimal Asymmetric Encryption. Eurocrypt’ 94, LNCS 950, pp. 92–111, 1995.
6. R. Canetti, O. Goldreich and S. Halevi: The Random Oracle Methodology, Revisited. STOC’98, ACM Press, pp. 209–218, 1998.
7. R. Cramer and V. Shoup: A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. Crypto’98, LNCS 1462, pp. 13–25, 1998.
8. D. Dolev, C. Dwork and M. Naor: Non-Malleable Cryptography. STOC’91, ACM Press pp. 542–552, 1991.
9. D. Dolev, C. Dwork and M. Naor: Non-Malleable Cryptography. Manuscript (updated, full length version of STOC paper), 1998.
10. T. ElGamal: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Inform. Theory, 31, pp. 469–472, 1985.
11. E. Fujisaki and T. Okamoto: Secure Integration of Asymmetric and Symmetric Encryption Schemes. Crypto’99, LNCS 1666, pp. 537–554, 1999.
12. U. Feige, A. Fiat and A. Shamir: Zero-knowledge proofs of identity. J. Cryptology, 1, pp. 77–94, 1988.
13. A. Fiat and A. Shamir: How to Prove Yourself: Practical Solutions of Identification and Signature Problems. Proc. Crypto’86, LNCS 263, pp. 186–194, 1987.
14. S. Goldwasser and S. Micali: Probabilistic Encryption. J. Computer and System Sciences, 28, pp. 270–299, 1984.
15. M. Jakobsson: A Practical Mix. Eurocrypt’98, LNCS 1403, pp. 448–461, 1998.
16. A. Menezes, P. van Oorschot and S. Vanstone: Handbook of Applied Cryptography. CRC Press, Inc., 1996.
17. V.I. Nechaev: Complexity of a Determinate Algorithm for the Discrete Logarithm. Mathematical Notes 55, pp. 165-172, 1994.
18. C. Rackoff and D.R. Simon: Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. Crypto’91, LNCS 576, pp. 433–444, 1992.
19. J. Schwartz: Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4), pp. 701–717, 1980.
20. C.P. Schnorr: Efficient Signature Generation for Smart Cards. Journal of Cryptology 4 (1991), pp. 161–174.
21. C.P. Schnorr and M. Jakobsson: Security of Discrete Log Cryptosystems in the Random Oracle and Generic Model. TR report University Frankfurt and Bell Laboratories 1999.
22. C.P. Schnorr: Small Generic Hardcore Subsets for the Discrete Logarithm: Short Secret DL-Keys. Presented at rump session of Eurocrypt’2000.
23. V. Shoup: Lower Bounds for Discrete Logarithms and Related Problems. Eurocrypt’97, LNCS 1233, pp. 256-266, 1997.
24. V. Shoup: Using Hash Functions as a Hedge against Chosen Ciphertext Attack. Eurocrypt’2000, LNCS 1807, pp. 275–288, 2000.
25. V. Shoup and R. Gennaro: Securing Threshold Cryptosystems against Chosen Ciphertext Attacks. Eurocrypt’98, LNCS 1404, pp. 1–16, 1998.
26. Y. Tsiounis and M. Yung, On the Security of ElGamal Based Encryption. PKS’98, LNCS 1431, pp. 117-134, 1998.
27. Y. Zheng and J. Seberry, Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks. Crypto’92, LNCS 740, pp. 292-304, 1992.