A new algorithm for searching a consistent set of shares in a threshold scheme with cheaters

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

Volumn 2971, Issue , 2004, Pages 377-385

  Tso, Raylin ^a   Miao, Ying ^a   Okamoto, Eiji ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CONSISTENT SETS; ITS EFFICIENCIES; MODIFIED ALGORITHMS; SECRET RECONSTRUCTION; THRESHOLD SCHEMES;

ALGORITHMS;

EID: 33847646839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24691-6_28     Document Type: Article

References (9)

1. G. R. Blakley, Safeguarding cryptographic keys, AFIPS Conf. Proceed. 48 (1979), 313-317.
2. E. F. Brickell and D. R. Stinson, The detection of cheaters in threshold schemes, SIAM J. Discrete Math. 4 (1991), 502-510.
3. L. Harn, Efficient sharing (broadcasting) of multiple secrets, IEE Proc. -Comput. Digit. Tech. 142 (1995), 237-240.
4. R. J. McEliece and D.V. Sarwate, On sharing secrets and Reed-Solomon codes, Comm. ACM 24 (1981), 583-584.
5. W. Ogata and K. Kurosawa, Optimum secret sharing scheme secure against cheating, Lecture Notes in Comput. Sci. 1070 (1996), 200-211.
6. R. S. 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), 225-237.
7. A. Shamir, How to share a secret, Comm. ACM 22 (1979), 612-613.
8. M. Tompa and H. Woll, How to share a secret with cheaters, J. Cryptology 1 (1988), 133-138.
9. URL: http://www.ccrwest.org/cover.html