Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping
@article{Wang2015NotesOT, title={Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping}, author={Y. Wang}, journal={IACR Cryptol. ePrint Arch.}, year={2015}, volume={2015}, pages={519} }
Recently, IACR ePrint archive posted two fully homomorphic encryption schemes without bootstrapping. In this note, we show that these schemes are trivially insecure. Furthermore, we also show that the encryption schemes of Liu and Wang [6] in CCS 2012 and the encryption scheme of Liu, Bertino, and Xun [5] in ASIACCS 2014 are insecure either.
Topics from this paper
26 Citations
Fully Homomorphic Encryption with Isotropic Elements
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2016
- 4
- PDF
Fully Homomorphic Encryption with Composite Number Modulus
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2015
- 6
- PDF
Fully Homomorphic Encryption without bootstrapping
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2015
- 177
- PDF
Noise-free Symmetric Fully Homomorphic Encryption based on noncommutative rings
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2015
- 19
- PDF
Fully Homomorphic Public-Key Encryption Against Ciphertext Square Attack with Two Ciphertexts
- Computer Science
- 2018
- PDF
Improved fully homomorphic public-key encryption with small ciphertext size
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2018
- 1
- PDF
References
SHOWING 1-9 OF 9 REFERENCES
Practical Fully Homomorphic Encryption without Noise Reduction
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2015
- 27
- PDF
Fully Homomorphic Encryption without bootstrapping
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2015
- 177
- Highly Influential
- PDF
When Homomorphism Becomes a Liability
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2012
- 23
- PDF
Fully homomorphic encryption without bootstrapping Cryptology ePrint Archive
- Report
- 2015