###
**Braun, Johannes and Wiesmaier, Alexander and Buchmann, Johannes**

**Sprague, Ralph H. (ed.)** (2013):

*On the Security of Encrypted Secret Sharing.*

In: 46th Hawaii International Conference on Systems Science (HICSS-46), IEEE Computer Society, Grand Wailea, Maui, Hawaii, ISBN 978-0-7695-4892-0,

DOI: 10.1109/HICSS.2013.426,

[Conference or Workshop Item]

## Abstract

Sensitive electronic data must often be kept confidential over very long periods of time. Known solutions such as conventional encryption, cascaded encryption, and information theoretic schemes suffer from several weaknesses or serious disadvantages that we shortly discuss. We present a method for combining arbitrary encryption algorithms. The scheme has the following properties: (1) It is a (k, n)-threshold scheme, i.e. only k=n of then applied algorithms are needed for decryption. (2) The scheme's effective bit security is the sum of the lengths of the k shortest keys. (3) Under adaptive chosen plaintext attacks, this security level remains intact until at least k algorithms are compromised. (4) Under adaptive chosen chipertext attacks, the security level decreases with each compromised algorithm at most by the corresponding key length. (5) The scheme increases the effective key lengths of repeatedly applied encryption algorithms.

Item Type: | Conference or Workshop Item |
---|---|

Erschienen: | 2013 |

Editors: | Sprague, Ralph H. |

Creators: | Braun, Johannes and Wiesmaier, Alexander and Buchmann, Johannes |

Title: | On the Security of Encrypted Secret Sharing |

Language: | ["languages_typename_1" not defined] |

Abstract: | Sensitive electronic data must often be kept confidential over very long periods of time. Known solutions such as conventional encryption, cascaded encryption, and information theoretic schemes suffer from several weaknesses or serious disadvantages that we shortly discuss. We present a method for combining arbitrary encryption algorithms. The scheme has the following properties: (1) It is a (k, n)-threshold scheme, i.e. only k=n of then applied algorithms are needed for decryption. (2) The scheme's effective bit security is the sum of the lengths of the k shortest keys. (3) Under adaptive chosen plaintext attacks, this security level remains intact until at least k algorithms are compromised. (4) Under adaptive chosen chipertext attacks, the security level decreases with each compromised algorithm at most by the corresponding key length. (5) The scheme increases the effective key lengths of repeatedly applied encryption algorithms. |

Title of Book: | 46th Hawaii International Conference on Systems Science (HICSS-46) |

Publisher: | IEEE Computer Society |

ISBN: | 978-0-7695-4892-0 |

Uncontrolled Keywords: | Secure Data;S6peer |

Divisions: | 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt Profile Areas > Cybersecurity (CYSEC) LOEWE > LOEWE-Zentren 20 Department of Computer Science Profile Areas LOEWE |

Event Location: | Grand Wailea, Maui, Hawaii |

Date Deposited: | 04 Aug 2016 15:08 |

DOI: | 10.1109/HICSS.2013.426 |

Identification Number: | TUD-CS-2012-0186 |

Export: | |

Suche nach Titel in: | TUfind oder in Google |

#### Optionen (nur für Redakteure)

View Item |