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 New (k,n)-Threshold Secret Sharing Scheme and Its Extension
ISC '08 Proceedings of the 11th international conference on Information Security
On a Fast (k,n)-Threshold Secret Sharing Scheme
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
| Hi-index | 0.00 |
In Shamir's (k,n)-threshold secret sharing scheme [1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. However, there is no fast ideal (k,n)-threshold scheme, where k ≥ 3 and n is arbitrary. This paper proposes a new fast (3,n)-threshold scheme by using just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret, which is an ideal secret sharing scheme similar to Shamir's scheme. Furthermore, we evaluate the efficiency of the scheme, and show that it is more efficient than Shamir's in terms of computational cost. Moreover, we suggest a fast (k,n)-threshold scheme can be constructed in a similar way by increasing the sets of random numbers constructing pieces of shares.