Practical FHE parameters against lattice attacks

키워드

참고문헌 (29)

1. M. Ajtai, "Generating hard instances of lattice problems (extended abstract)", Pro-ceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing, pp.99~108 (1996), ACM
2. M. R. Albrecht, "On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL", Advances in cryptology—EUROCRYPT 2017, (Part II), pp.103~129 (2017), Springer
3. M. Albrecht, "Homomorphic encryption standard", ~ (2018)
4. M. R. Albrecht, "Revisiting the expected cost of solving uSVP and applications to LWE", Advances in cryptology—ASIACRYPT 2017, (Part I), pp.297~322 (2017), Springer
5. Applications of homomorphic encryption, "D. Archer", ~ (2017)
6. A. Becker, "New directions in nearest neighbor searching with applications to lattice sieving", Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.10~24 (2016), ACM
7. Z. Brakerski, "(Leveled) fully homomorphic encryp-tion without bootstrapping", ACM Trans. Comput. Theory, 6(3), pp.36~ (2014)[DOI]
8. A standard API for RLWE-based homomorphic encryption, "M. Brenner", ~ (2017)
9. J. Buchmann, "On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack", Progress in cryptology—AFRICACRYPT 2016, pp.24~43 (2016), Springer
10. Security of homomorphic encryption, "M. Chase", ~ (2017)
11. H. Chen, "Improved bootstrapping for approximate homomor-phic encryption", Advances in cryptology—EUROCRYPT 2019, (Part II), pp.34~54 (2019), Springer
12. H. Chen, "Homomorphic lower digits removal an improved FHE bootstrap-ping", Advances in cryptology—EUROCRYPT 2018, (Part I), pp.315~337 (2018), Springer
13. Y. Chen, "BKZ 2.0: better lattice security estimates", Advances in cryptology—ASIACRYPT 2011, pp.1~20 (2011), Springer
14. J. H. Cheon, "Bootstrapping for approximate homomorphic encryption", Advances in cryptology—EUROCRYPT 2018, (Part I), pp.360~384 (2018), Springer
15. J. H. Cheon, "A hybrid of dual and meet-in-the-middle attack on sparse and ternary secret LWE", IEEE Access, 7, pp.89497~89506 (2019)
16. J. H. Cheon, "Homomorphic encryption for arithmetic of approximate numbers", Advances in cryptology—ASIACRYPT 2017, (Part I), pp.409~437 (2017), Springer
17. J. H. Cheon, "Revisiting the hybrid attack on sparse and ternary secret LWE", IACR Cryptol. ePrint Arch, 2019, pp.1019~ (2019)
18. I. Chillotti, "TFHE: fast fully homomorphic encryption library", ~ (2016)
19. B. R. Curtis, "On the feasibility and impact of standardising sparse-secret LWE parmeter sets for homomorphic encryption", Proceedings of the 7th ACM Work-shop on Encrypted Computing & Applied Homomorphic Cryptography, pp.1~10 (2019)
20. J. Fan, "Somewhat practical fully homomorphic encryption", IACR Cryptol. ePrint Arch, 2012, pp.144~ (2012)
21. C. Gentry, "Fully homomorphic encryption using ideal lattices", STOC’09—Proceedings of the 2009 ACM International Symposium on Theory of Computing, pp.169~178 (2009), ACM
22. M. Ibtihal, "Cryptography: Breakthroughs in Research and Practice", pp.316~330 (2020), IGI Global
23. P. Li, "Privacy-preserving out-sourced classification in cloud computing", Cluster Computing, 21(1), pp.277~286 (2018)
24. R. Lindner, "Better key sizes (and attacks) for LWE-based encryption", Topics in cryptology—CT-RSA 2011, pp.319~339 (2011), Springer
25. D. Micciancio, "Post-quantum cryptography", pp.147~191, Springer
26. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography", J. ACM, 56(6), pp.40~ (2009)[DOI]
27. "Microsoft SEAL (release 3.6)" (2020)[URL]
28. T. Wunderer, "Revisiting the hybrid attack: Improved analysis and refined security esti-mates", IACR Cryptol. ePrint Arch, 2016, pp.733~ (2016)
29. Y. Zhang, "FORESEE: Fully Outsourced secuRe gEnome Study basEd on homomorphic Encryption", BMC medical informatics and decision making, 15, pp.S5~ (2015), Springer

관련 논문AI추천