Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
FL is not immune to various kinds of attacks and failures that target each step of the system's training and deployment pipelines.
“However, FL is not immune to various kinds of attacks and failures that target each step of the system's training and deployment pipelines.”
From Vulnerabilities in federated learning (2021) · cites this paper as [11]
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012 · see citing works
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 · see citing works
Goldwasser, S., & Micali, S. M. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,667 · see citing works
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,359 · see citing works
(1978) · Cited by 1,875 · see citing works
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,861 · see citing works
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,360 · see citing works
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,156 · see citing works
Mollin, R. A. (2005) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035087-10 · Cited by 914 · see citing works
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 898 · see citing works
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., et al. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055718 · Cited by 811 · see citing works
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 811 · see citing works
Advances in Cryptology -- CRYPTO 2015
Gennaro, R., & Robshaw, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48000-7 · Cited by 661 · see citing works
Computing arbitrary functions of encrypted data
Gentry, C. (2010) · Communications of the ACM · doi:10.1145/1666420.1666444 · Cited by 650 · see citing works
Advances in Cryptology – EUROCRYPT 2010
(2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13190-5 · Cited by 504 · see citing works
Advances in Cryptology – CRYPTO 2010
Rabin, T., & 2010, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7 · Cited by 370 · see citing works
The World Is Not Enough: Another Look on Second-Order DPA
Standaert, F., Veyrat-Charvillon, N., Oswald, E., et al. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_7 · Cited by 352 · see citing works
Faster Fully Homomorphic Encryption
Stehlé, D., & Steinfeld, R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_22 · Cited by 327 · see citing works
Fully Homomorphic Encryption without Bootstrapping.
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2011) · Cited by 324 · see citing works
Advances in Cryptology – EUROCRYPT 2011
(2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4 · Cited by 252 · see citing works
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 215 · see citing works
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_9 · Cited by 132 · see citing works
Reaction Attacks against Several Public-Key Cryptosystem
Hall, C., Goldberg, I., & Schneier, B. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-47942-0_2 · Cited by 92 · see citing works
Myers, S., & Shelat, A. A. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.65 · Cited by 75 · see citing works
On CCA-Secure Somewhat Homomorphic Encryption
Loftus, J., May, A., Smart, N. P., et al. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28496-0_4 · Cited by 74 · see citing works
Information and Communication Security
Varadharajan, V., & Mu, Y. (1999) · Lecture notes in computer science · doi:10.1007/b72329 · Cited by 74 · see citing works
Stochastics: introduction to probability and statistics
(2008) · Choice Reviews Online · doi:10.5860/choice.46-0347 · Cited by 23 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Vulnerabilities in federated learning
Bouacida, N., & Mohapatra, P. (2021) · IEEE Access · doi:10.1109/access.2021.3075203 · Cited by 248 · see citing works
- Authors
- Zhang, Z., Plantard, T., & Susilo, W.
- Affiliations
- University of Wollongong (AU)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 419-436
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1607369907
- Cited by
- 27
- References
- 28
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 3 · 2023: 1 · 2022: 3 · 2021: 2 · 2019: 3 · 2018: 2 · 2017: 2 · 2016: 2 · 2015: 2 · 2014: 2 · 2013: 1
- FWCI
- 1.23
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Research Online (University of Wollongong) (submittedVersion)
- Figshare (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- fully homomorphic encryption, outsourced computation, cloud security, key recovery, user privacy
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
