Experimental analysis of secret sharing schemes for cloud storage based on rns

V. Miranda-López, A. Tchernykh, J.M. Cortés-Mendoza, M. Babenko, G. Radchenko, S. Nesmachnow, Z. Du, Mocskos E., Nesmachnow S.

    Research output: Book/ReportBookpeer-review

    Abstract

    In this paper, we address the application of Redundant Residue Number System (RRNS) to improve the security of public data storage, reduce storage space, and process encrypted data. We provide a comprehensive experimental analysis of Asmuth-Bloom [14] and Mignotte [15] schemes that use RRNS and Secret Sharing Scheme (SSS) to design reliable and secure storage systems. These schemes are studied in real multi-cloud environment to find compromise between performance, redundancy, and data security. We analyze and compare the speeds of encoding/decoding and upload/download of these algorithms for different RRNS settings with 11 well-known cloud storage providers. We also provide a mathematical analysis of the expected system behavior. © Springer International Publishing AG 2018.
    Original languageEnglish
    Number of pages14
    Volume796
    DOIs
    Publication statusPublished - 2018
    Event4th Latin American Conference on High Performance Computing - , Argentina
    Duration: 20 Sept 201722 Sept 2017
    http://carla2017.ccarla.org/

    Keywords

    • Cloud computing
    • Homomorphic encryption
    • Reliability
    • Residue number system
    • Security
    • Storage
    • Cryptography
    • Digital storage
    • Energy storage
    • Information theory
    • Numbering systems
    • Experimental analysis
    • Ho-momorphic encryptions
    • Mathematical analysis
    • Redundant residue number systems
    • Secret sharing schemes
    • Secure storage systems
    • Distributed computer systems

    Fingerprint

    Dive into the research topics of 'Experimental analysis of secret sharing schemes for cloud storage based on rns'. Together they form a unique fingerprint.

    Cite this