Name
Abstract | ||
|---|---|---|
Hiding a secret is needed in many situations. One might need to hide a password, an encryption key, a secret recipe, and etc. Information can be secured with encryption, but the need to secure the secret key used for such encryption is important too. Imagine you encrypt your important files with one secret key and if such a key is lost then all the important files will be inaccessible. Thus, secure and efficient key management mechanisms are required. One of them is secret sharing scheme (SSS) that lets you split your secret into several parts and distribute them among selected parties. The secret can be recovered once these parties collaborate in some way. This paper will study these schemes and explain the need for them and their security. Across the years, various schemes have been presented. This paper will survey some of them varying from trivial schemes to threshold based ones. Explanations on these schemes constructions are presented. The paper will also look at some applications of SSS. |
Year | Venue | Keywords |
|---|---|---|
2011 | Internet Technology and Secured Transactions | private key cryptography,public key cryptography,encryption key,key management mechanism,password,secret key,secret recipe,secret sharing scheme,Blakley SSS,SSS applications,Secret splitting,Shamir SSS,Threshold schemes,Verfiable SSS |
Field | DocType | ISBN |
Key distribution,Secure multi-party computation,Secret sharing,Computer security,Computer science,Attribute-based encryption,Computer network,Verifiable secret sharing,Shared secret,Homomorphic secret sharing,Pre-shared key | Conference | 978-1-4577-0884-8 |
Citations | PageRank | References |
2 | 0.37 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noura Al Ebri | 1 | 5 | 1.13 |
| Joonsang Baek | 2 | 794 | 52.88 |
| Chan Yeob Yeun | 3 | 170 | 25.61 |