New limits of provable security and applications to ElGamal encryption

DOI10.1007/978-3-031-58737-5_10MaRDI QIDQ6637527zbMATH OpenFDO

Authors Sven Schäge

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58737-5_10

zbMATH Keywords

composite residuosity class problemencryption schemesprobabilistic encryption schemespublic-key cryptographytrapdoor mechanismtrapdoor permutation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1186873
• On the hardness of proving CCA-security of Signed ElGamal
• On the CCA1-security of Elgamal and Damgård's Elgamal
• Topics in Cryptology – CT-RSA 2006
• scientific article; zbMATH DE number 1583771

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• Black-box separations for one-more (static) CDH and its generalization
• Breaking RSA may not be equivalent to factoring
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Fast secure two-party ECDSA signing
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1304087 (Why is no real title available?)
• scientific article; zbMATH DE number 1952889 (Why is no real title available?)
• scientific article; zbMATH DE number 2086712 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• Limitations of the meta-reduction technique: the case of Schnorr signatures
• Limits of provable security from standard assumptions
• Memory-tight reductions
• New directions in cryptography
• Notions of black-box reductions, revisited
• On Constant-Round Concurrent Zero-Knowledge
• On the exact security of Schnorr-type signatures in the random oracle model
• On the Generic Insecurity of the Full Domain Hash
• On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
• On the impossibility of tight cryptographic reductions
• On the power of nonuniformity in proofs of security
• On the security loss of unique signatures
• On the Security of One-Witness Blind Signature Schemes
• On tight security proofs for Schnorr signatures
• Optimal security proofs for full domain hash, revisited
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Resettable zero-knowledge (extended abstract)
• Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
• Security proofs for signature schemes
• Separation Results on the “One-More” Computational Problems
• The algebraic group model and its applications
• Theory of Cryptography
• Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
• Waters signatures with optimal security reduction

Cited in

(5)

• Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
• A complete characterization of one-more assumptions in the algebraic group model
• On the limits of non-interactive blind signatures
• New limits for homomorphic encryption
• On new variants of FuncCPA security and related CCA-secure constructions

This page was built for publication: New limits of provable security and applications to ElGamal encryption

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