On the Hardness of Proving CCA-Security of Signed ElGamal

DOI10.1007/978-3-662-49384-7_3zbMath1388.94033OpenAlexW2268652597MaRDI QIDQ2798771

David Bernhard, Bogdan Warinschi, Marc Fischlin

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

On the security loss of unique signatures, Naor-Yung paradigm with shared randomness and applications, On the adaptive security of MACs and PRFs, New technique for chosen-ciphertext security based on non-interactive zero-knowledge, Naor-Yung Paradigm with Shared Randomness and Applications, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model

Cites Work

• Unnamed Item
• System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory
• Propositions as sessions
• An Explicit Formula for the Free Exponential Modality of Linear Logic
• Propositions as sessions