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

- 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 language | English |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Computer Science |

Number of pages | 20 |

Publication status | Published - 1996 |

### Publication series

Name | Memoranda informatica |
---|---|

Publisher | University of Twente, Department of Computer Science |

No. | 96-20 |

ISSN (Print) | 0924-3755 |

## Keywords

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