Distributed Encryption and Decryption Algorithms

André Postma, Willem de Boer, Arne Helme, Gerard Smit

    Research output: Book/ReportReportAcademic

    Abstract

    In this paper, we describe distributed encryption and decryption algorithms. These algorithms are required in order to make a dependable distributed data storage system in which data is stored in an encrypted form resilient to a number of arbitrarily faulty nodes in the system. By execution of these algorithms, a group of n nodes is able to encrypt or decrypt data with any secret cryptographic function in the system in the presence of up to t arbitrarily faulty nodes, whereas the following requirements are met:
    - loss of information of up to t nodes never leads to loss of any cryptographic key
    - t or less nodes are unable to compute a secret cryptographic function and encrypt or decrypt data with it
    - any group of n - t or more nodes may encrypt or decrypt data with any cryptographic function.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherUniversity of Twente, Department of Computer Science
    Number of pages20
    Publication statusPublished - 1996

    Publication series

    NameMemoranda informatica
    PublisherUniversity of Twente, Department of Computer Science
    No.96-20
    ISSN (Print)0924-3755

    Keywords

    • Dependable distributed systems
    • Fault-tolerance
    • Byzantine failure model
    • Security
    • Cryptography

    Fingerprint Dive into the research topics of 'Distributed Encryption and Decryption Algorithms'. Together they form a unique fingerprint.

  • Cite this

    Postma, A., de Boer, W., Helme, A., & Smit, G. (1996). Distributed Encryption and Decryption Algorithms. (Memoranda informatica; No. 96-20). Enschede: University of Twente, Department of Computer Science.