Efficient Secret Sharing Schemes Based on Unauthorized Subsets

Authors:
Kouya Tochikubo
Affiliations:
-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 5
Cited 1

How to share a secret

Communications of the ACM
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures*This paper was presented at the technical meeting on ISEC of IEICE, 2003, and the IEEE International Symposium on Information Theory, 2004.

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Secret Sharing Schemes Based on Unauthorized Subsets

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Efficient Secret Sharing Schemes Based on Unauthorized Subsets

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two multiple assignment secret sharing schemes realizing general access structures. One is always more efficient than the secret sharing scheme proposed by Ito, Saito and Nishizeki [5] from the viewpoint of the number of shares distributed to each participant. The other is also always more efficient than the scheme I of [7].