The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 2×
“Recently, López-Alt et al. [15] proposed an FHE scheme based on the work by Stehlé and Steinfeld [23] in which a provably secure version of NTRUEncrypt [12] is presented with security based on standard problems in ideal lattices.”
Method(1978) · Cited by 1,875
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Brakerski, Z. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_50 · Cited by 1,252
Somewhat Practical Fully Homomorphic Encryption.
Fan, J., & Vercauteren, F. (2012) · Cited by 1,189
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Can homomorphic encryption be practical?
Naehrig, M., Lauter, K., & Vaikuntanathan, V. (2011) · Proceedings of the 3rd ACM workshop on Cloud computing security workshop · doi:10.1145/2046660.2046682 · Cited by 1,004
Self-citationOn-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Micciancio, D., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447360 · Cited by 907
Implementing Gentry’s Fully-Homomorphic Encryption Scheme
Gentry, C., & Halevi, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_9 · Cited by 889
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
Smart, N. P., & Vercauteren, F. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_25 · Cited by 808
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
Better Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688
Fully homomorphic SIMD operations
Smart, N. P., & Vercauteren, F. (2014) · Designs, Codes and Cryptography · doi:10.1007/s10623-012-9720-4 · Cited by 656
A hierarchy of polynomial time lattice basis reduction algorithms
Schnorr, C. P. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90064-8 · Cited by 648
Micciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
BKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
Coron, J.-S., Mandal, A., Naccache, D., & Tibouchi, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_28 · Cited by 466
Foundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
Batch Fully Homomorphic Encryption over the Integers
Cheon, J. H., Coron, J.-S., Kim, J., Lee, M. S., Lepoint, T., Tibouchi, M., & Yun, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_20 · Cited by 352
Fully Homomorphic Encryption without Bootstrapping.
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2011) · Cited by 337
Cited by
Homomorphic Encryption for Arithmetic of Approximate Numbers
Cheon, J. H., Kim, A., Kim, M., & Song, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70694-8_15 · Cited by 2,522
“, [17, 6, 7, 4, 5, 23, 24, 29, 2, 25, 12, 11, 18, 20]) have been suggested following Gentry’s blueprint [22].”
BackgroundA Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
(2016) · International Conference on Machine Learning · Cited by 1,270
Oblivious Neural Network Predictions via MiniONN Transformations
Liu, J., Juuti, M., Lu, Y., & Asokan, N. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134056 · Cited by 691
Bootstrapping for Approximate Homomorphic Encryption
Cheon, J. H., Han, K., Kim, A., Kim, M., & Song, Y. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78381-9_14 · Cited by 373
Metadata
- Authors
- Bos, J. W., Lauter, K., Loftus, J., & Naehrig, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Volume
- 2013
- Pages
- 45-64
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2233194383
- Cited by
- 421
- References
- 29
- FWCI
- 19.08
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.