On key recovery attacks against existing somewhat homomorphic encryption schemes
From MaRDI portal
Publication:2946478
DOI10.1007/978-3-319-16295-9_13zbMATH Open1370.94495OpenAlexW2159015104MaRDI QIDQ2946478FDOQ2946478
Authors: Massimo Chenal, Qiang Tang 
Publication date: 17 September 2015
Published in: Progress in Cryptology - LATINCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16295-9_13
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
- Title not available (Why is that?)
- Fully homomorphic encryption with polylog overhead
- Better bootstrapping in fully homomorphic encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Implementing Gentry's fully-homomorphic encryption scheme
- Faster fully homomorphic encryption
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- (Leveled) fully homomorphic encryption without bootstrapping
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Trapdoors for lattices: simpler, tighter, faster, smaller
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Computing arbitrary functions of encrypted data
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Batch fully homomorphic encryption over the integers
- On CCA-Secure Somewhat Homomorphic Encryption
- On the CCA-1 security of somewhat homomorphic encryption over the integers
- On key recovery attacks against existing somewhat homomorphic encryption schemes
Cited In (17)
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Comparison-based attacks against noise-free fully 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 practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
- Fooling an unbounded adversary with a short key, repeatedly: The honey encryption perspective
- On the CCA-1 security of somewhat homomorphic encryption over the integers
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- From distinguishers to key recovery: improved related-key attacks on Even-Mansour
- A direct key recovery attack on SIDH
- An efficient key recovery attack on SIDH
- \textit{Caveat implementor!} Key recovery attacks on MEGA
- Key recovery attacks against NTRU-based somewhat homomorphic encryption schemes
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- On the IND-CPA security of ring homomorphic encryption schemes over \(\mathbb{F}_2\)
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)
