TU Darmstadt / ULB / TUbiblio

On the Security of Encrypted Secret Sharing

Braun, Johannes ; Wiesmaier, Alexander ; Buchmann, Johannes
Sprague, Ralph H. (ed.) :

On the Security of Encrypted Secret Sharing.
46th Hawaii International Conference on Systems Science (HICSS-46) IEEE Computer Society
[ Konferenzveröffentlichung] , (2013)

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
Titel: On the Security of Encrypted Secret Sharing
Sprache: ["languages_typename_1" not defined]
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.

Buchtitel: 46th Hawaii International Conference on Systems Science (HICSS-46)
Verlag: IEEE Computer Society
Freie Schlagworte: Secure Data;S6peer
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Profilbereiche > Cybersicherheit (CYSEC)
LOEWE > LOEWE-Zentren
20 Fachbereich Informatik
Profilbereiche
LOEWE
Veranstaltungsort: Grand Wailea, Maui, Hawaii
Hinterlegungsdatum: 04 Aug 2016 15:08
DOI: 10.1109/HICSS.2013.426
ID-Nummer: TUD-CS-2012-0186
Export:

Optionen (nur für Redakteure)

Eintrag anzeigen Eintrag anzeigen