Limits of provable security for homomorphic encryption
From MaRDI portal
Recommendations
Cited in
(13)- On basing search SIVP on \(\mathbf{NP}\)-hardness
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- On the complexity of collision resistant hash functions: new and old black-box separations
- Statistical difference beyond the polarizing regime
- Homomorphic evaluation requires depth
- On basing private information retrieval on NP-hardness
- On statistically secure obfuscation with approximate correctness
- Limits of Constructive Security Proofs
- Structure versus hardness through the obfuscation lens
- Combinatorially homomorphic encryption
- Quantum state testing beyond the polarizing regime and quantum triangular discrimination
- On basing auxiliary-input cryptography on NP-hardness via nonadaptive black-box reductions
- On the cryptographic futility of non-collapsing measurements
This page was built for publication: Limits of provable security for homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845664)