Fully homomorphic encryption using ideal lattices is a research paper published in Proceedings of the forty-first annual ACM symposium on Theory of computing (2009). On theSindex it has a DataRank of 1.3. It has been cited 6,487 times.
Scored on demand from live citation data
Linked data & code
DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?
FAIR checklist signals are shown for context only and do not affect DataRank scoring.
We only score data papers we can read in full — never from an abstract alone.
Base Score Contribution
1.3
From this paper's citation signal
Citation Network Contribution
0
Citation network not refreshed for this result
This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.
Learn more about DataRank methodology →FWCI
150.60
Citation Percentile
1.0%
Influential Citations
520
Citation Trend
Fields of Study
Keywords
Sustainable Development Goals
Secure Compressed Suffix Arrays
Foundations of Homomorphic Secret Sharing
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
On White-Box Learning and Public-Key Encryption
Bootstrapping Homomorphic Encryption via Functional Encryption
SoK: Privacy-Enhancing Technologies in Finance
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture
Correlation-Intractable Hash Functions via Shift-Hiding
Bounded Simultaneous Messages
Maliciously Circuit-Private FHE from Information-Theoretic Principles
Interaction-Preserving Compilers for Secure Computation
Algebraic Restriction Codes and Their Applications
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
Some Open Problems in Information-Theoretic Cryptography