New limits for homomorphic encryption
From MaRDI portal
Cites work
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Adaptive hardness and composable security in the plain model from standard assumptions
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Breaking RSA may not be equivalent to factoring
- Cryptography and Coding
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Fast secure two-party ECDSA signing
- Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
- Homomorphic Encryption with CCA Security
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 176566 (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 2009978 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
- Limitations of the meta-reduction technique: the case of Schnorr signatures
- Limits of provable security from standard assumptions
- Multi-instance security and its application to password-based cryptography
- New limits of provable security and applications to ElGamal encryption
- On CCA-Secure Somewhat Homomorphic Encryption
- On Constant-Round Concurrent Zero-Knowledge
- On the adaptive security of MACs and PRFs
- On the CCA1-security of Elgamal and Damgård's Elgamal
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- 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 tight cryptographic reductions
- 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
- Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key encryption indistinguishable under plaintext-checkable attacks
- Resettable zero-knowledge (extended abstract)
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Round-optimal password-based authenticated key exchange
- Security proofs for signature schemes
- Targeted malleability: homomorphic encryption for restricted computations
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- Waters signatures with optimal security reduction
- Why Proving HIBE Systems Secure Is Difficult
This page was built for publication: New limits for homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232845)
