On the practical secret sharing scheme

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E84-A, Issue 1, 2001, Pages 256-261

  Ogata, Wakaha ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; SECURITY OF DATA; SET THEORY;

SECRET SHARING SCHEMES;

CRYPTOGRAPHY;

EID: 0035123204     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. G.R. Blakley, "Safeguarding cryptographie keys," Proc. AFIPS 1979 National Computer Conference, vol.48, pp.313- 317, 1979
2. A. Shamir, "How to share a secret," Commun. ACM, vol.22, no.ll, pp.612-613, 1979
3. E.D. Kamin, J.W. Green, and M.E. Hellman, "On secret sharing systems," IEEE Trans. Inf. Theory, vol.IT-29, pp.35- 41, 1983
4. U.M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, "On the size of shares for secret sharing schemes," J. Cryptology, vol.6, no.3, pp.157-167, 1993
5. G.R. Blakley and C. Meadows, "Security of ramp scheme," Proc. Crypto'84, Lecture Note in Computer Science, vol.196, pp.242-268, 1984
6. M. Tompa and H. Woll, "How to share a secret with cheaters," J. Cryptology, vol.1, pp.133-139, 1988
7. K. Kurosawa and K. Okada, "Combinatorial lower bounds for secret sharing schemes," Inf. Proc. Lett., vol.60, no.6, pp.301-304, 1990
8. W. Ogata and K. Kurosawa, "Optimum secret sharing scheme secure against cheating," Proc. Eurocrypt'96, Lecture Note in Computer Science, vol.1070, pp.200-211, 1996
9. F.J. MacWilliams and N.J.A. Sloane, The theory of Errorcorrecting codes, pp.397-398, North-Holland, 1981.