Extending residue-based fault tolerance to encrypted computation

Nektarios Georgios Tsoutsos, Mihalis Maniatakos

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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.

    Original languageEnglish (US)
    Title of host publicationInternational Test Conference 2015, ITC 2015 - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Volume2015-November
    ISBN (Electronic)9781467365789
    DOIs
    StatePublished - Nov 30 2015
    Event46th IEEE International Test Conference, ITC 2015 - Anaheim, United States
    Duration: Oct 6 2015Oct 8 2015

    Other

    Other46th IEEE International Test Conference, ITC 2015
    CountryUnited States
    CityAnaheim
    Period10/6/1510/8/15

    Fingerprint

    Fault tolerance
    Fault Tolerance
    Modular arithmetic
    Homomorphic Encryption
    Duplication
    Flip
    Cryptography
    Coverage
    Fault
    Partial
    Data storage equipment
    Resources
    Methodology
    Output
    Experimental Results
    Processing
    Demonstrate
    Framework

    ASJC Scopus subject areas

    • Applied Mathematics
    • Electrical and Electronic Engineering

    Cite this

    Tsoutsos, N. G., & Maniatakos, M. (2015). Extending residue-based fault tolerance to encrypted computation. In International Test Conference 2015, ITC 2015 - Proceedings (Vol. 2015-November). [7342419] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/TEST.2015.7342419

    Extending residue-based fault tolerance to encrypted computation. / Tsoutsos, Nektarios Georgios; Maniatakos, Mihalis.

    International Test Conference 2015, ITC 2015 - Proceedings. Vol. 2015-November Institute of Electrical and Electronics Engineers Inc., 2015. 7342419.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Tsoutsos, NG & Maniatakos, M 2015, Extending residue-based fault tolerance to encrypted computation. in International Test Conference 2015, ITC 2015 - Proceedings. vol. 2015-November, 7342419, Institute of Electrical and Electronics Engineers Inc., 46th IEEE International Test Conference, ITC 2015, Anaheim, United States, 10/6/15. https://doi.org/10.1109/TEST.2015.7342419
    Tsoutsos NG, Maniatakos M. Extending residue-based fault tolerance to encrypted computation. In International Test Conference 2015, ITC 2015 - Proceedings. Vol. 2015-November. Institute of Electrical and Electronics Engineers Inc. 2015. 7342419 https://doi.org/10.1109/TEST.2015.7342419
    Tsoutsos, Nektarios Georgios ; Maniatakos, Mihalis. / Extending residue-based fault tolerance to encrypted computation. International Test Conference 2015, ITC 2015 - Proceedings. Vol. 2015-November Institute of Electrical and Electronics Engineers Inc., 2015.
    @inproceedings{feefe40c0f084cd48ad0a694a12415ee,
    title = "Extending residue-based fault tolerance to encrypted computation",
    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.",
    author = "Tsoutsos, {Nektarios Georgios} and Mihalis Maniatakos",
    year = "2015",
    month = "11",
    day = "30",
    doi = "10.1109/TEST.2015.7342419",
    language = "English (US)",
    volume = "2015-November",
    booktitle = "International Test Conference 2015, ITC 2015 - Proceedings",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - GEN

    T1 - Extending residue-based fault tolerance to encrypted computation

    AU - Tsoutsos, Nektarios Georgios

    AU - Maniatakos, Mihalis

    PY - 2015/11/30

    Y1 - 2015/11/30

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=84958637240&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84958637240&partnerID=8YFLogxK

    U2 - 10.1109/TEST.2015.7342419

    DO - 10.1109/TEST.2015.7342419

    M3 - Conference contribution

    VL - 2015-November

    BT - International Test Conference 2015, ITC 2015 - Proceedings

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -