t-cheater identifiable (k, n) threshold secret sharing schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 963, Issue , 1995, Pages 410-423

  Kurosawa, Kaoru ^a   Obana, Satoshi ^a   Ogata, Wakaha ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF HYOGO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

LOWER BOUNDS; THRESHOLD SECRET SHARING;

CRYPTOGRAPHY;

EID: 84957630266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44750-4_33     Document Type: Conference Paper

References (16)

1. A.Shamir, How to share a secret, Comm.ACM, 22(1979), pp.612-613.
2. G.R.Blakley, Safeguarding cryptographic keys, Proc. National Computer Conference, AFIPS Conference Proceedings, 48(1979), pp.313-317.
3. R.J.McEliece and D.V.Sarwate, On sharing secrets and Reed-Solomon codes, Comm.ACM, 24(1981), pp.583-584.
4. G.Simmons, Robust shared secret schemes or "how to be sure you have the right answer even though you don't know the question," Congr.Numer., 68(1989), pp.215- 248.
5. T.Rabin and M.Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. 21st ACM Symposium on Theory of Computing (1989), pp.73-85.
6. E.F.Brickell and D.R.Stinson, The Detection of Cheaters in Threshold Schemes, SIAM J. DISC. MATH, Vol.4, No.4, Nov.1991, pp.502-510.
7. M.Tompa and H.Woll, How to share a secret with cheaters, Journal of Cryptology, vol.l(1988), pp.133-138.
8. Marco Carpentieri, Alfredo De Santis and Ugo Vaccaro, Size of Shares and Probability of Cheating in Threshold Schemes, Proceedings of Eurocrypt'93, Lecture Notes in Computer Science, LNCS 765, Springer Verlag (1993), pp.118-125.
9. E.D.Karnin, J.W.Greene, and M.E.Hellman, On Secret Sharing Systems, IEEE Trans, on Inform. Theory, Vol.IT-29 (1983), pp.35-41.
10. R.M.Capocelli, A.De Santis, L.Gargano and U.Vaccaro, On the size of shares for secret sharing schemes, Proceedings of Crypto'91, Lecture Notes in Computer Science, LNCS 576, Springer Verlag (1991), pp.101-113.
11. K.Kurosawa and K.Okada, Combinatorial interpretation of secret sharing schemes, In Pre-Proceedings of Asiacrypt'94 (1994), pp.38-48.
12. G.J.Simmons, A survey of Information Authentication, in Contemporary Cryptology, The science of information integrity, ed. G.J.Simmons, IEEE Press, New York (1992).
13. G.J.Simmons, Message authentication: a game on hypergraphs, Congr. Numer. 45 (1984), pp.161-192.
14. D.R.Stinson, Some constructions and bounds for authentication codes, Journal of Cryptology, vol.l (1988), pp.37-51.
15. J.L.Massey, Cryptography - a selective survey, in Digital Communications, North- Holland (pub.) (1986), pp.3-21.
16. M.De Soete, New Bounds and Constructions for Authentication/Secrecy Codes with Splitting, Journal of Cryptology, vol.3, no.3 (1991), pp.173-186.