Braun, Johannes ; Wiesmaier, Alexander ; Buchmann, Johannes
Hrsg.: Sprague, Ralph H. (2013)
On the Security of Encrypted Secret Sharing.
Grand Wailea, Maui, Hawaii
doi: 10.1109/HICSS.2013.426
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2013 |
| Herausgeber: | Sprague, Ralph H. |
| Autor(en): | Braun, Johannes ; Wiesmaier, Alexander ; Buchmann, Johannes |
| Art des Eintrags: | Bibliographie |
| Titel: | On the Security of Encrypted Secret Sharing |
| Sprache: | Englisch |
| Publikationsjahr: | Januar 2013 |
| Verlag: | IEEE Computer Society |
| Buchtitel: | 46th Hawaii International Conference on Systems Science (HICSS-46) |
| Veranstaltungsort: | Grand Wailea, Maui, Hawaii |
| DOI: | 10.1109/HICSS.2013.426 |
| Kurzbeschreibung (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. |
| Freie Schlagworte: | Secure Data;S6peer |
| ID-Nummer: | TUD-CS-2012-0186 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra Profilbereiche Profilbereiche > Cybersicherheit (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt |
| Hinterlegungsdatum: | 04 Aug 2016 15:08 |
| Letzte Änderung: | 11 Dez 2019 12:52 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum