Dynamic threshold and cheater resistance for shamir secret sharing scheme

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

Volumn 4318 LNCS, Issue , 2006, Pages 103-117

  Tartary, Christophe ^a   Wang, Huaxiong ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Cheater resistance; Insecure network; Polynomial reconstruction problem; Secret sharing scheme; Threshold changeability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; SECURITY OF DATA;

CHEATER RESISTANCE; INSECURE NETWORK; POLYNOMIAL RECONSTRUCTION PROBLEM; SECRET SHARING SCHEME; THRESHOLD CHANGEABILITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33845927130     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11937807_9     Document Type: Conference Paper

References (41)

1. G. R. Blakley. Safeguarding cryptographic keys. In AFIPS 1979, pages 313-317, 1979.
2. D. Bleichenbacher and P. Q. Nguyen. Noisy polynomial interpolation and noisy Chinese remaindering. In Eurocrypt'00, volume 1807 of LNCS, pages 53 - 69. Springer - Verlag, May 2000.
3. C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. In Crypto'93, volume 773 of LNCS, pages 110 - 125. Springer - Verlag, August 1993.
4. W. Dai. Crypto++ 5.2.1 benchmarks, July 2004.
5. Y. Desmedt. Society and group oriented cryptography: A new concept. In Crypto'87, volume 293 of LNCS, pages 120 - 127. Springer - Verlag, August 1987.
6. Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its application. Technical Report ISSE TR-97-01, George Mason university, 1997.
7. Y. Desmedt and B. King. Verifiable democracy a protocol to secure an electronic legislature. In EGOV2002, volume 2456 of LNCS, pages 460-463. Springer - Verlag, September 2002.
8. Y. Desmedt, K. Kurosawa, and T. Van Le. Error correcting and complexity aspects of linear secret sharing schemes. In 6th International Conference on Information Security, volume 2851 of LNCS, pages 396 - 407. Springer - Verlag, October 2003.
9. Y. Frankel, P. Gemmel, P. D. MacKenzie, and M. Yung. Optimal-resilience proactive public-key cryptosystems. In FOCS'97, pages 384 - 393. IEEE Press, October 1997.
10. Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure fault-tolerant protocols and the public-key model (extended abstract). In Crypto '87, volume 293 of LNCS, pages 135 - 155. Springer - Verlag, August 1987.
11. H. Ghodosi and J. Pieprzyk. Democratic systems. In ACISP 2001, volume 2119 of LNCS, pages 392 - 402. Springer - Verlag, July 2001.
12. V. Guruswami. List Decoding of Error-Correcting Codes. Springer-Verlag, 2004.
13. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Trans, on Information Theory, 45(6): 1757 - 1767, September 1999.
14. L. Harn. Group-oriented (t, n)-threshold digital signature scheme and digital multisignature. IEE Proceedings - Computers and Digital Techniques, 141(5):307 - 313, September 1994.
15. A. Juels and M. Sudan. A fuzzy vault scheme. In ISIT 2002, page 408. IEEE Press, July 2002. Extended version available at: http://www. rsasecurity.com/rsalabs/staff/bios/ajuels/publications/fuzzy-vault/fuzzy_vault. pdf.
16. C. Karlof, N. Sastry, Y. Li, A. Perrig, and J. D. Tygar. Distillation codes and applications to DoS resistant multicast authentication. In NDSS 2004, February 2004.
17. E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Transactions on Information Theory, 29(1):35 - 41, January 1983.
18. Q. Li, Z. Wang, X. Niu, and S. Sun. A non-interactive modular verifiable secret sharing scheme. In International Conference on Communications, Circuits and Systems, pages 84 - 87. IEEE Press, May 2005.
19. A. Lysyanskaya, R. Tamassia, and N. Triandopoulos. Multicast authentication in fully adversarial networks. In IEEE Symp. on Security and Privacy, November 2003.
20. A. Maeda, A. Miyaji, and M. Tada. Efficient and unconditionally secure verifiable threshold changeable scheme. In ACISP 2001, volume 2119 of LNCS, pages 402 - 416. Springer - Verlag, 2001.
21. K. Martin. Untrustworthy participants in secret sharing schemes. In Cryptography and Coding III, pages 255 - 264. Oxford University Press, 1993.
22. K. Martin, J. Pieprzyk, R. Safavi-Naini, and H. Wang. Changing thresholds in the absence of secure channels. Australian Computer Journal, 31:34-43, 1999.
23. K. Martin, R. Safavi-Naini, and H. Wang. Bounds and techniques for efficient redistribution of secret shares to new access structures. The Computer Journal, 42(8):638 - 649, September 1999.
24. R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Communications of the ACM, 24(9):583 - 584, September 1981.
25. F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In 46th Annual IEEE Symposium on Foundations of Computer Science, pages 285 - 294, Pittsburgh, USA, October 2005. IEEE Computer Society.
26. J. Pieprzyk, T. Hardjono, and J. Seberry. Fundamentals of Computer Security. Springer, 2003.
27. t). In Indocrypt 2001, volume 2247 of LNCS, pages 79 - 90. Springer - Verlag, December 2001.
28. J. Pieprzyk and X. M. Zhang. Constructions of cheating immune secret sharing. In ICICS 2001, volume 2288 of LNCS, pages 226 - 243. Springer - Verlag, December 2001.
29. J. Pieprzyk and X. M. Zhang. On cheating immune secret sharing. Discrete Mathematics and Theoretical Computer Science, 6:253 - 264, March 2004.
30. C. P. Schnorr. A hierarchy of polynomial lattice basis reduction algorithms. Theoretical Computer Science, 53:201-224, 1987.
31. C. P. Schnorr and M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problem. Math. Programming, 66(1 - 3): 181 - 199, August 1994.
32. B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In Crypto'99, volume 1666 of LNCS, pages 148-164. Springer - Verlag, August 1999.
33. A. Shamir. How to share a secret. Communication of the ACM, 22(11):612 - 613, November 1979.
34. V. Shoup. Number Theory Library (NTL). Available online at: http://www.shoup.net/ntl/.
35. R. Steinfeld, H. Wang, and J. Pieprzyk. Lattice-based threshold-changeability for standard Shamir secret-sharing schemes. In Asiacrypt'04, volume 3329 of LNCS, pages 170 - 186. Springer - Verlag, December 2004.
36. D. R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
37. D. R. Stinson and S. Zhang. Algorithms for detecting cheaters threshold schemes. Available online at: http://www.cacr.math.uwaterloo.ca/~dstinson/ papers/cheat.pdf, January 2006.
38. C. Tang, Z. Liu, and M. Wang. A verifiable secret sharing scheme with statistical zero-knowledge. Avaliable onlne at: http://eprint.iacr.org/2003/222. pdf, October 2003.
39. C. Tartary and H. Wang. Efficient multicast stream authentication for the fully adversarial network. In WISA 2005, volume 3786 of LNCS, pages 108 - 125. Springer - Verlag, August 2005.
40. M. Tompa and H. Woll. How to share a secret with cheaters. In Crypto'86, volume 263 of LNCS, pages 261 - 265. Springer - Verlag, August 1986.
41. X. M. Zhang and J. Pieprzyk. Cheating immune secret sharing. In ICICS 2001, volume 2229 of LNCS, pages 144 - 149. Springer - Verlag, November 2001.