Name
Abstract | ||
|---|---|---|
In this work we adapt residue numbering and modular arithmetic, combining them with the intrinsic properties of partial homomorphic encryption algorithms, in order to propose an efficient fault tolerance framework specifically tailored to encrypted computation. Our approach can be easily integrated to such systems and protect the individual processing components, such as the ALU, the memory, and the outputs. Experimental results demonstrate that the proposed methodology offers more than 99.9% fault coverage for single bit-flips and clustered multiple bit upsets, incurring a runtime overhead of up to 8%. Compared to resource duplication approaches, our framework incurs approximately 47% less area overhead. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TEST.2015.7342419 | 2015 IEEE International Test Conference (ITC) |
Keywords | Field | DocType |
fault tolerance,homomorphic encryption computation,partial homomorphic encryption algorithm | Homomorphic encryption,Numbering,Fault coverage,Modular arithmetic,Computer science,Real-time computing,Encryption,Fault tolerance,Probabilistic encryption,Computation | Conference |
ISSN | Citations | PageRank |
1089-3539 | 1 | 0.36 |
References | Authors | |
20 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nektarios Georgios Tsoutsos | 1 | 62 | 9.83 |
| M. Maniatakos | 2 | 358 | 35.84 |