On key recovery attacks against existing somewhat homomorphic encryption schemes
From MaRDI portal
(Redirected from Publication:2946478)
Recommendations
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Key recovery attacks against NTRU-based somewhat homomorphic encryption schemes
- On the CCA-1 security of somewhat homomorphic encryption over the integers
- On CCA-Secure Somewhat Homomorphic Encryption
- Cryptanalysis of chosen symmetric homomorphic schemes
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Batch fully homomorphic encryption over the integers
- Better bootstrapping in fully homomorphic encryption
- Computing arbitrary functions of encrypted data
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Faster fully homomorphic encryption
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- Implementing Gentry's fully-homomorphic encryption scheme
- On CCA-Secure Somewhat Homomorphic Encryption
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- On the CCA-1 security of somewhat homomorphic encryption over the integers
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(21)- From distinguishers to key recovery: improved related-key attacks on Even-Mansour
- Key recovery attacks against NTRU-based somewhat homomorphic encryption schemes
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
- Comparison-based attacks against noise-free fully homomorphic encryption schemes
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- On the CCA-1 security of somewhat homomorphic encryption over the integers
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- On the IND-CPA security of ring homomorphic encryption schemes over \(\mathbb{F}_2\)
- \textit{Caveat implementor!} Key recovery attacks on MEGA
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Fooling an unbounded adversary with a short key, repeatedly: The honey encryption perspective
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
- Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
- IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption
- Verifiable FHE via lattice-based SNARKs
This page was built for publication: On key recovery attacks against existing somewhat homomorphic encryption schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946478)
