TU Darmstadt / ULB / TUbiblio

On the Security of Encrypted Secret Sharing

Braun, Johannes ; Wiesmaier, Alexander ; Buchmann, Johannes
ed.: Sprague, Ralph H. (2013)
On the Security of Encrypted Secret Sharing.
Grand Wailea, Maui, Hawaii
doi: 10.1109/HICSS.2013.426
Conference or Workshop Item, Bibliographie

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 ; Wiesmaier, Alexander ; Buchmann, Johannes
Type of entry: Bibliographie
Title: On the Security of Encrypted Secret Sharing
Language: English
Date: January 2013
Publisher: IEEE Computer Society
Book Title: 46th Hawaii International Conference on Systems Science (HICSS-46)
Event Location: Grand Wailea, Maui, Hawaii
DOI: 10.1109/HICSS.2013.426
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.

Uncontrolled Keywords: Secure Data;S6peer
Identification Number: TUD-CS-2012-0186
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra
Profile Areas
Profile Areas > Cybersecurity (CYSEC)
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Date Deposited: 04 Aug 2016 15:08
Last Modified: 11 Dec 2019 12:52
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details