A Hardware Accelerator for Fully Homomorphic Encryption based Machine Learning Applications
Bibliographic record
Abstract
Fully homomorphic encryption (FHE) is a lattice-based cryptography scheme that enables mathematical operations to be performed on encrypted data without first having to decrypt the data, allowing for the implementation of secure machine learning (ML). As performing ML applications with FHE-encrypted data using current processors can take significant computation time, DARPA has created the DPRIVE challenge for the design of an FHE hardware accelerator. In this thesis, we design and verify through a cycle-accurate Verilog model both residue number system (RNS) and large arithmetic word size (LAWS) implementations of a hardware accelerator capable of realizing the DPRIVE performance specifications for 1024-point logistic regression using the Cheon-Kim-Kim-Song (CKKS) mathematical foundation. We show that the two implementations achieve comparable execution time performance, and that the estimated CMOS ASIC implementation area of the LAWS design requires only 68% of the core area of the equivalent RNS design in an equivalent technology node.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".