Cheating immune secret sharing

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

Volumn 2229, Issue , 2001, Pages 144-149

  Zhang, Xian Mo ^a   Pieprzyk, Josef ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CHEATING IMMUNE SECRET SHARING; CRYPTOGRAPHIC CRITERION; SECRET SHARING;

BOOLEAN FUNCTIONS;

EID: 29244431868     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45600-7_16     Document Type: Conference Paper

References (14)

1. E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, Vol. 4, No. 1: 3-72, 1991.
2. G. R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 National Computer Conference, pages 313-317. AFIPS, 1979.
3. M. Carpentieri. A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography, 5(3): 183-187, 1995.
4. M. Carpentieri, A. De Santis, and U. Vaccaro. Size of shares and probability of cheating in threshold schemes. Advances in Cryptology - EUROCRYPT’93, LNCS No. 765, pages 118-125. Springer-Verlag, 1993.
5. Y. Desmedt. Society and group oriented cryptography: A new concept. Advances in Cryptology - CRYPTO’87, LNCS No. 293 pages 120-127. Springer-Verlag, 1988.
6. 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.
7. O. S. Rothaus. On "bent" functions. Journal of Combinatorial Theory (A), 20: 300- 305, 1976.
8. P. Sarkar and S. Maitra. Highly nonlinear balanced boolean functions with important cryptographic properties. Advances in Cryptology - EUROCRYPT2000, LNCS No. 1807, pages 485-506. Springer-Verlag, 2000.
9. A. Shamir. How to share a secret. Communications of the ACM, 22: 612-613, November 1979.
10. D.R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
11. M. Tompa and H. Woll. How to share a secret with cheaters. Journal of Cryptology, 1(2): 133-138, 1988.
12. A. F. Webster. Plaintext/ciphertext bit dependencies in cryptographic system. Master’s Thesis, Department of Electrical Engineering, Queen’s University, Ontario, 1985.
13. A.F. Webster and S.E. Tavares. On the design of S-boxes. Advances in Cryptology - CRYPTO’85, pages 523-534. Springer-Verlag, 1986.
14. X. M. Zhang and Y. Zheng. Cryptographically resilient functions. IEEE Transactions on Information Theory, 43(5): 1740-1747, 1997.