The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Overview
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
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
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
Self-citationOn lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
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
(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
Self-citationOn 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
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
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
Self-citation(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
(2000) · Lecture Notes in Computer Science · doi:10.1007/10722028 · Cited by 1,001
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
Advances in Cryptology — EUROCRYPT ’99
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x · Cited by 902
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
Probabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802212 · Cited by 883
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
Secure Two-Party Computation Is Practical
Pinkas, B., Schneider, T., Smart, N. P., & Williams, S. C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_15 · Cited by 711
(2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1 · Cited by 628
Computationally Private Information Retrieval with Polylogarithmic Communication
Cachin, C., Micali, S., & Stadler, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_28 · Cited by 579
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
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5 · Cited by 500
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
(2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8 · Cited by 421
A robust and verifiable cryptographically secure election scheme
Cohen, J. D., & Fischer, M. J. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.2 · Cited by 408
Advances in Cryptology – CRYPTO 2010
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7 · Cited by 370
Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)
Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_36 · Cited by 369
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
Stam, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_22 · Cited by 361
Cryptographic Primitives Based on Hard Learning Problems
Blum, A., Furst, M., Kearns, M., & Lipton, R. J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_24 · Cited by 332
Single-Database Private Information Retrieval with Constant Communication Rate
Gentry, C., & Ramzan, Z. (2005) · Lecture Notes in Computer Science · doi:10.1007/11523468_65 · Cited by 313
Circular-Secure Encryption from Decision Diffie-Hellman
Boneh, D., Halevi, S., Hamburg, M., & Ostrovsky, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_7 · Cited by 293
Generalized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_13 · Cited by 268
SWIFFT: A Modest Proposal for FFT Hashing
Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_4 · Cited by 265
(2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4 · Cited by 252
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Micciancio, D. (2007) · computational complexity · doi:10.1007/s00037-007-0234-9 · Cited by 242
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Peikert, C., & Rosen, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_8 · Cited by 229
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
Groth, J., Kiayias, A., & Lipmaa, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_7 · Cited by 214
Asymptotically Efficient Lattice-Based Digital Signatures
Lyubashevsky, V., & Micciancio, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_3 · Cited by 178
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
Gentry, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_7 · Cited by 175
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
Brakerski, Z., & Goldwasser, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_1 · Cited by 155
Self-citationBounded Key-Dependent Message Security
Barak, B., Haitner, I., Hofheinz, D., & Ishai, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13190-5_22 · Cited by 141
Brakerski, Z., & Goldwasser, S. (2010) · Cited by 78
Self-citationKey-Dependent Message Security: Generic Amplification and Completeness
Applebaum, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4_29 · Cited by 78
Homomorphic Encryption: From Private-Key to Public-Key
Rothblum, R. D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_14 · Cited by 76
Black-Box Circular-Secure Encryption beyond Affine Functions
Brakerski, Z., Goldwasser, S., & Kalai, Y. T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_13 · Cited by 73
Self-citationLattices that admit logarithmic worst-case to average-case connection factors
Peikert, C., & Rosen, A. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250860 · Cited by 69
Efficient Circuit-Size Independent Public Key Encryption with KDM Security
Malkin, T., Teranishi, I., & Yung, M. M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4_28 · Cited by 61
A Brief Introduction to Classical and Adelic Algebraic Number Theory
Stein, W. A. (2004) · Cited by 17
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].”
Background(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
Self-citationGentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
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
Self-citation(Leveled) Fully Homomorphic Encryption without Bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2633600 · Cited by 1,430
Self-citation
Metadata
- Authors
- Brakerski, Z., & Vaikuntanathan, V.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 505-524
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1494049356
- Cited by
- 1,096
- References
- 51
- FWCI
- 55.78
- Type
- conference paper
- Language
- en
- Open access
- closed
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.