원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.6 No.2
2012.04
pp.103-108
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
For the fully homomorphic encryption schemes in [3, 6], this paper presents attacks to solve an equivalent secret key and directly recover plaintext from ciphertext for lattice dimensions n=2048 with lattice reduction algorithm. Given the average-case behavior of LLL in [8] is true, then their schemes are also not secure for n=8192.
목차
Abstract
1. Introduction
1.1 Our Results
1.2 Organization
2. Preliminaries
2.1 Notations
2.2 Lattice Reduction Algorithm
3. Cryptanalysis of Smart-Vercauteren’s Scheme
3.1 Fully Homomorphic Encryption
3.2 Cryptanalysis of Smart-Vercauteren’s FHE
4. Cryptanalysis of Gentry-Halevi’s Scheme
4.1 Fully Homomorphic Encryption
4.2 Cryptanalysis of Gentry-Halevi’s FHE
5. Recovering Plaintext from Ciphertext
6. Conclusion and Open Problems
References
1. Introduction
1.1 Our Results
1.2 Organization
2. Preliminaries
2.1 Notations
2.2 Lattice Reduction Algorithm
3. Cryptanalysis of Smart-Vercauteren’s Scheme
3.1 Fully Homomorphic Encryption
3.2 Cryptanalysis of Smart-Vercauteren’s FHE
4. Cryptanalysis of Gentry-Halevi’s Scheme
4.1 Fully Homomorphic Encryption
4.2 Cryptanalysis of Gentry-Halevi’s FHE
5. Recovering Plaintext from Ciphertext
6. Conclusion and Open Problems
References
저자정보
참고문헌
자료제공 : 네이버학술정보