Proceedings of CRYPTO 84 on Advances in cryptology
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
Cryptography: Theory and Practice
Cryptography: Theory and Practice
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A Fast (3,n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Secure RFID application data management using all-or-nothing transform encryption
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
AONT encryption based application data management in mobile RFID environment
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
An efficient group-based secret sharing scheme
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
| Hi-index | 0.00 |
In Shamir's (k,n)-threshold secret sharing scheme (threshold scheme), a heavy computational cost is required to make nshares and recover the secret. As a solution to this problem, several fast threshold schemes have been proposed. This paper proposes a new (k,n)-threshold scheme. For the purpose to realize high performance, the proposed scheme uses just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret. We prove that the proposed scheme is a perfectsecret sharing scheme, every combination of kor more participants can recover the secret, but every group of less than kparticipants cannot obtain any information about the secret. Moreover, we show that the proposed scheme is an idealsecret sharing scheme similar to Shamir's scheme, which is a perfectscheme such that every bit-size of shares equals that of the secret. We also evaluate the efficiency of the scheme, and show that our scheme realizes operations that are much faster than Shamir's. Furthermore, from the aspect of both computational cost and storage usage, we also introduce how to extend the proposed scheme to a new (k,L,n)-threshold rampscheme similar to the existing rampscheme based on Shamir's scheme.