New limits of provable security and applications to ElGamal encryption
From MaRDI portal
Publication:6637527
DOI10.1007/978-3-031-58737-5_10MaRDI QIDQ6637527
Publication date: 13 November 2024
encryption schemespublic-key cryptographytrapdoor permutationprobabilistic encryption schemescomposite residuosity class problemtrapdoor mechanism
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the security loss of unique signatures
- Memory-tight reductions
- The algebraic group model and its applications
- On the Security of One-Witness Blind Signature Schemes
- Notions of Black-Box Reductions, Revisited
- Security Proofs for Signature Schemes
- Optimal Security Proofs for Full Domain Hash, Revisited
- On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
- Waters Signatures with Optimal Security Reduction
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Black-Box Separations for One-More (Static) CDH and Its Generalization
- On Tight Security Proofs for Schnorr Signatures
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- On the power of nonuniformity in proofs of security
- Resettable zero-knowledge (extended abstract)
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- New directions in cryptography
- Breaking RSA may not be equivalent to factoring
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Limits of provable security from standard assumptions
- On Constant-Round Concurrent Zero-Knowledge
- On the Generic Insecurity of the Full Domain Hash
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Separation Results on the “One-More” Computational Problems
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- On the Impossibility of Tight Cryptographic Reductions
- Theory of Cryptography
- Fast secure two-party ECDSA signing
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)
