Constructions of cheating immune secret sharing

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

Volumn 2288, Issue , 2002, Pages 226-243

  Pieprzyk, Josef ^a   Zhang, Xian Mo ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

CHEATING IMMUNE SECRET SHARING; CHEATING PREVENTIONS; CRYPTOGRAPHIC PROPERTIES; SECRET SHARING;

CHROMIUM COMPOUNDS;

EID: 84949949642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45861-1_18     Document Type: Conference Paper

References (22)

1. M. Carpentieri. A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography, 5(3):183–187, 1995.
2. M. Carpentieri, A. De Santis, and U. Vaccaro. Size of shares and probability of cheating in threshold schemes. In T. Helleseth, editor, Advances in Cryptology - EUROCRYPT’93, LNCS No 765, pages 118–125. Springer-Verlag, 1993.
3. C. Ding, D. Pei and A Salomaa. Chinese remainder theorem: applications in computing, coding and cryptography. World Scientific, Singapore, 1996
4. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 427–437. IEEE, 1987.
5. F.J. MacWilliams and N.J.A. Sloane. The theory of error-correcting codes. North- Holland, Amsterdam, 1977.
6. K. Nyberg. On the construction of highly nonlinear permutations. In Advances in Cryptology - EUROCRYPT’92, LNCS No 658, pages 92–98. Springer-Verlag, 1993.
7. K. Nyberg and L. R. Knudsen. Provable security against differential cryptanalysis. In Advances in Cryptology - CRYPTO’92, LNCS No 740, pages 566–574. Springer- Verlag, 1993.
8. T.P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO’91, LNCS No 576, pages 129–140. Springer-Verlag, 1992.
9. J. Pieprzyk and X. M. Zhang. Cheating prevention in secret sharing over GF(pt). to appear in Indocrypt 2001.
10. B. Preneel, W. V. Leekwijck, L. V. Linden, R. Govaerts, and J. Vandewalle. Propagation characteristics of boolean functions. In Advances in Cryptology - EUROCRYPT’ 90, LNCS No 437, pages 155–165. Springer-Verlag, 1991.
11. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of 21st ACM Symposium on Theory of Computing, pages 73–85, 1989.
12. O. S. Rothaus. On “bent” functions. Journal of Combinatorial Theory (A), 20:300–305, 1976.
13. B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In M. Wiener, editor, Advances in Cryptology - CRYPTO’99, LNCS No 1666, pages 148–164. Springer-Verlag, 1999.
14. J. Seberry, X. M. Zhang, and Y. Zheng. On constructions and nonlinearity of correlation immune functions. In Advances in Cryptology - EUROCRYPT’93, LNCS No 765, pages 181–199. Springer-Verlag, 1994.
15. J. Seberry, X. M. Zhang, and Y. Zheng. Nonlinearity and propagation characteristics of balanced boolean functions. Information and Computation, 119(1):1–13, 1995.
16. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30 No. 5:776–779, 1984.
17. M. Stadler. Publicly verifiable secret sharing. In U. Maurer, editor, Advances in Cryptology - EUROCRYPT’96, LNCS No 1070, pages 190–199. Springer-Verlag, 1996.
18. D.R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
19. A. F. Webster and S. E. Tavares. On the design of S-boxes. In Advances in Cryptology - CRYPTO’85, LNCS No 219, pages 523–534. Springer-Verlag, 1986.
20. Martin Tompa and Heather Woll. How to share a secret with cheaters. In A.M. Odlyzko, editor, Advances in Cryptology - CRYPTO’86, LNCS No 263, pages 261–265. Springer-Verlag, 1987.
21. X. M. Zhang and J. Pieprzyk, Cheating immune secret sharing. to appear in The Third International Conference on Information and Communication Security (ICICS) 2001.
22. X. M. Zhang and Y. Zheng. Cryptographically resilient functions. IEEE Transactions on Information Theory, 43(5):1740–1747, 1997.