Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP-Reference-Cited by-同舟云学术

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

Published:2012 Issue: Volume: Page:868-886
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Brakerski Zvika

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32009-5_50

Reference28 articles.

1. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: Leighton, F.T., Shor, P.W. (eds.) STOC, pp. 284–293. ACM (1997)

2. Lecture Notes in Computer Science;B Applebaum,2009

3. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: ITCS (2012), http://eprint.iacr.org/2011/277

4. Lecture Notes in Computer Science;Z Brakerski,2011

5. Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky (ed.) [19], pp. 97–106, References are to full version, http://eprint.iacr.org/2011/344

Cited by 694 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Homomorphic multi-party computation for Internet of Medical Things;Peer-to-Peer Networking and Applications;2024-09-12

2. Phantom: A CUDA-Accelerated Word-Wise Homomorphic Encryption Library;IEEE Transactions on Dependable and Secure Computing;2024-09

3. On the Security of Homomorphic Encryption Schemes with Restricted Decryption Oracles;Journal of Systems Science and Complexity;2024-08-30

4. Secure and efficient general matrix multiplication on cloud using homomorphic encryption;The Journal of Supercomputing;2024-08-26

5. Efficient Twiddle Factor Generators for NTT;Electronics;2024-08-07