Optimum secret sharing scheme secure against cheating

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 1, 2006, Pages 79-95

  Ogata, Wakaha ^a   Kurosawa, Kaoru ^b   Stinson, Douglas R ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b IBARAKI UNIVERSITY   (Japan)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Balanced incomplete block design; Cheaters; Cryptography; Difference sets; Secret sharing schemes

Indexed keywords

COMPUTATION THEORY; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SET THEORY;

BALANCED INCOMPLETE BLOCK DESIGNS; DIFFERENCE SETS; PARTIAL CONVERSE; SECRET SHARING SCHEMES;

CRYPTOGRAPHY;

EID: 33847657638     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100378689     Document Type: Article

References (24)

1. T. BETH, D. JUNGNICKEL, AND H. LENZ, Design Theory, Cambridge University Press, Cambridge, UK, 1993.
2. G. R. BLAKELY, Safeguarding cryptographic keys, in Proceedings of the AFIPS 1979 National Computer Conference, 1979, pp. 313-317.
3. E. F. BRICKELL AND D. R. STINSON, The detection of cheaters in threshold schemes, SIAM J. Discrete Math., 4 (1991), pp. 502-510.
4. M. CARPENTIERI, A perfect threshold secret sharing scheme to identify cheaters, Des., Codes Cryptogr., 5 (1995), pp. 183-187.
5. M. CARPENTIERI, A. DE SANTIS, AND U. VACCARO, Size of shares and probability of cheating in threshold schemes, in Advances in Cryptography - Eurocrypt '93, Lecture Notes in Comput. Sci. 765, Springer-Verlag, New York, 1994, pp. 118-125.
6. D. CHAUM, C. CREPEAU, AND I. DAMGARD, Multiparty unconditionally secure protocols, in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, 1988, pp. 11-19.
7. B. CHOR, S. GOLDWASSER, S. MICALI, AND B. AWERBUCH, Verifiable secret sharing and achieving simultaneity in the presence of faults, in Proceedings of the 26th IEEE Annual Symposium on the Foundations of Computer Science, 1985, pp. 383-395.
8. C. J. COLBOURN AND J. H. DINITZ, EDS., The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996.
9. R. CRAMER, I. DAMGÅRD, AND U. M. MAURER, General secure multi-party computation from any linear secret-sharing scheme, in Advances in Cryptography - Eurocrypt '00, Lecture Notes in Comput. Sci. 1807, Springer-Verlag, New York, 2000, pp. 316-334.
10. Y. DESMEDT, K. KUROSAWA, AND T. V. LE, Error correcting and complexity aspects of linear secret sharing schemes, in Information Security: 6th International Conference, ISO 2003, Lecture Notes in Comput. Sci. 2851, Springer-Verlag, New York, 2003, pp. 396-407.
11. P. FELDMAN, A practical scheme for non-interactive verifiable secret sharing, in Proceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science, 1987, pp. 427-437.
12. M. ITO, A. SAITO, AND T. NISHIZEKI, Multiple assignment scheme for sharing secret, J. Cryptology, 6 (1993), pp. 15-20.
13. E. D. KARNIN, J. W. GREENE, AND M. E. HELLMAN, On secret sharing systems, IEEE Trans. Inform. Theory, 29 (1982), pp. 35-41.
14. K. KUROSAWA, S. OBANA, AND W. OGATA, t-cheater identifiable (k, n) threshold secret sharing schemes, in Advances in Cryptography - Crypto '95, Lecture Notes in Comput. Sci. 963, Springer-Verlag, New York, 1995, pp. 410-423.
15. F. J. MACWILLIAMS AND N. J. A. SLOANE, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
16. R. J. MCELIECE AND D. V. SARWATE, On sharing secrets and Reed-Solomon codes, Comm. ACM, 24 (1981), pp. 583-584.
17. T. PEDERSEN, Non-interactive and information-theoretic secure verifiable secret sharing, in Advances in Cryptography - Crypto '91, Lecture Notes in Comput. Sci. 576, Springer-Verlag, New York, 1991, pp. 129-149.
18. T. RABIN AND M. BEN-OR, Verifiable secret sharing and multiparty protocols with honest majority, in Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989, pp. 73-85.
19. R. REES, D. R. STINSON, R. WEI, AND G. H. J. VAN REES, An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme, Ars Combin., 53 (1999), pp. 225-237.
20. A. SHAMIR, How to share a secret, Comm. ACM, 22 (1979), pp. 612-613.
21. D. R. STINSON, Cryptography: Theory and Practice, CRC Press, Boca Raton, PL, 1995.
22. D. R. STINSON AND R. WEI, Unconditionally secure proactive secret sharing scheme with combinatorial structures, in Selected Areas in Cryptography: 6th Annual International Workshop, SAC'99, Lecture Notes in Comput. Sci. 1758, Springer-Verlag, New York, 2000, pp. 200-214
23. M. TOMPA AND H. WOLL, How to share a secret with cheaters, J. Cryptology, 1 (1988), pp. 133-138.
24. R. TSO, Y. MIAO, AND E. OKAMOTO, A new algorithm for searching a consistent set of shares in a threshold scheme with cheaters, in Information Security and Cryptology - ICISC 2003, Lecture Notes in Comput. Sci. 2971, Springer-Verlag, New York, 2004, pp. 377-385.