ICICS 2001: Information and Communications Security pp 144-149 | Cite as
Cheating Immune Secret Sharing
Abstract
We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., \( \bar \rho = \frac{1} {n} \cdot 2^{ - n} \sum _{c = 1}^n \sum _{\alpha \in Vn} \rho _{c,\alpha } \) , satisfies \( \bar \rho \geqslant \frac{1} {2} \) , and the equality holds ⇔ ρc,α satisfies ρc,α = 1/2 for every cheating vector δc and every original vector α. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.
Preview
Unable to display preview. Download preview PDF.
References
- 1.E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, Vol. 4, No. 1:3–72, 1991.MATHCrossRefMathSciNetGoogle Scholar
- 2.G. R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 National Computer Conference, pages 313–317. AFIPS, 1979.Google Scholar
- 3.M. Carpentieri. A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography, 5(3):183–187, 1995.MATHCrossRefMathSciNetGoogle Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 7.O. S. Rothaus. On “bent” functions. Journal of Combinatorial Theory (A), 20:300–305, 1976.MATHCrossRefMathSciNetGoogle Scholar
- 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.CrossRefGoogle Scholar
- 9.A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, November 1979.MATHCrossRefMathSciNetGoogle Scholar
- 10.D. R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.Google Scholar
- 11.M. Tompa and H. Woll. How to share a secret with cheaters. Journal of Cryptology, 1(2):133–138, 1988.MATHMathSciNetGoogle Scholar
- 12.A. F. Webster. Plaintext/ciphertext bit dependencies in cryptographic system. Master’s Thesis, Department of Electrical Engineering, Queen’s University, Ontario, 1985.Google Scholar
- 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.Google Scholar
- 14.X. M. Zhang and Y. Zheng. Cryptographically resilient functions. IEEE Transactions on Information Theory, 43(5):1740–1747, 1997.MATHCrossRefMathSciNetGoogle Scholar