Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution

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

Volumn 4284 LNCS, Issue , 2006, Pages 364-379

  Obana, Satoshi ^a   Araki, Toshinori ^a  

^a NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS; NOVEL TECHNIQUES; SECRET RECONSTRUCTION; SECRET SHARING SCHEMES; UNIVERSAL HASH FUNCTION;

HASH FUNCTIONS; NETWORK SECURITY;

PROBABILITY DISTRIBUTIONS;

EID: 38149036127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935230_24     Document Type: Conference Paper

References (12)

1. G. R. Blakley, "Safeguarding cryptographic keys," Proc. AFIPS 1979, National Computer Conference, vol. 48, pp. 313-137, 1979. vol. 4, no. 4, pp. 502-510, 1991.
2. M. Carpentieri, "A Perfect Threshold Secret Sharing Scheme to Identify Cheaters," Designs, Codes and Cryptography, vol. 5, no. 3, pp. 183-187, 1995.
3. M. Carpentieri, A. De Santis and U. Vaccaro, "Size of Shares and Probability of Cheating in Threshold Schemes," Proc. Eurocrypt'93, Lecture Notes in Computer Science, vol. 765, Springer Verlag, pp. 118-125, 1993.
4. R. Cramer, I. Damg?ard and U. M. Maurer, "General Secure Multi-party Computation from any Linear Secret-Sharing Scheme," Proc. Eurocrypt'00, Lecture Notes in Computer Science, vol. 1807, Springer Verlag, pp. 316-334, 2000.
5. B. den Boer, "A Simple and Key-Economical Unconditional Authentication Scheme," Journal of Computer Security, vol. 2, pp. 65-71, 1993.
6. K. Kurosawa, S. Obana andW. Ogata, "t-Cheater Identifiable (k, n) Secret Sharing Schemes," Proc. Crypto'95, Lecture Notes in Computer Science, vol. 963, Springer Verlag, pp. 410-423, 1995.
7. F. MacWilliams and N. Sloane, "The Theory of Error Correcting Codes," North Holland, Amsterdam, 1977.
8. W. Ogata, K. Kurosawa and D. R. Stinson, "Optimum Secret Sharing Scheme Secure against Cheating," SIAM Journal on Discrete Mathematics, vol. 20, no. 1, pp. 79-95, 2006.
9. T. Pedersen, "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing," Proc. Crypto'91, Lecture Notes in Computer Science, vol 576, Springer Verlag, pp. 129-149, 1991.
10. A. Shamir, "How to Share a Secret," Communications of the ACM, vol. 22, no. 11, pp. 612-613, 1979.
11. D. R. Stinson, "On the Connections between Universal Hashing, Combinatorial Designs and Error-Correcting Codes," Congressus Numerantium 114, pp. 7-27, 1996.
12. M. Tompa and H. Woll, "How to Share a Secret with Cheaters," Journal of Cryptology, vol. 1, no. 3, pp. 133-138, 1989.