Secret sharing scheme security and performance analysis
In cryptography, secret sharing is a technique to share a secret among a group of members, each of which holds a portion of the secret. The secret can only be retrieved when a certain number of members combine their shares together, while any combination with fewer shares has no extra information ab...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2016
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/73466/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965102341&doi=10.1109%2fICCNEEE.2015.7381357&partnerID=40&md5=53f1efbf63752474dd69f86855c4b622 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In cryptography, secret sharing is a technique to share a secret among a group of members, each of which holds a portion of the secret. The secret can only be retrieved when a certain number of members combine their shares together, while any combination with fewer shares has no extra information about the secret. There are many secret sharing schemes, and each one achieves a different level of security with different performance and storage requirements. In this paper we analyze the security and performance of three secret schemes which are the most common schemes for information dispersal used within distributed storage systems, namely Shamir's scheme, Rabin's IDA and hybrid scheme. Several tests were conducted to understand the fundamental concept of the schemes as well as to explore the security, performance and the capability of the schemes. |
|---|