Security of signed ElGamal encryption

DOI10.1007/3-540-44448-3_7MaRDI QIDQ2707405zbMATH OpenFDO

Authors Markus Jakobsson, Claus Peter Schnorr

Publication date 6 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44448-3_7

zbMATH Keywords

ciphertext attackcyclic groupElGamalhash function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the security of ElGamal based encryption
• A robust and plaintext-aware variant of signed ElGamal encryption
• On the hardness of proving CCA-security of Signed ElGamal
• Topics in Cryptology – CT-RSA 2006
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model

Cited in

(27)

• Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
• Bootstrapping for approximate homomorphic encryption
• Classical proofs of quantum knowledge
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• On the multi-user security of short Schnorr signatures with preprocessing
• New technique for chosen-ciphertext security based on non-interactive zero-knowledge
• Enhancing the security of perfect blind DL-signatures
• Generic groups, collision resistance, and ECDSA
• On the hardness of proving CCA-security of Signed ElGamal
• Secure ElGamal-type cryptosystems without message encoding
• Designated confirmer signatures with unified verification
• The Group of Signed Quadratic Residues and Applications
• Efficiency limitations for -protocols for group homomorphisms
• scientific article; zbMATH DE number 5519732 (Why is no real title available?)
• On the security of ElGamal based encryption
• scientific article; zbMATH DE number 2170299 (Why is no real title available?)
• A robust and plaintext-aware variant of signed ElGamal encryption
• ElGamal cryptosystems on Boolean functions
• A new enhanced ElGamal encryption scheme
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• On the Equivalence of Generic Group Models
• How to challenge and cast your e-vote
• Machine-checked security proofs of cryptographic signature schemes
• Public Key Cryptography - PKC 2006
• New limits of provable security and applications to ElGamal encryption
• The structured generic-group model
• A tight lower bound on the \textsc{TdScrypt} trapdoor memory-hard function

This page was built for publication: Security of signed ElGamal encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707405)