1. [1] T. Araki, “Efficient (k,n) threshold secret sharing schems secure against cheating from n-1 cheaters,” Proc. 12th Australasian Conference Information Security and Privacy (ACISP'07), Lecture Notes in Computer Science, vol.4586, pp.133-142, Springer-Verlag, Heidelberg, 2007.
2. [2] T. Araki and W. Ogata, “A simple and efficient secret sharing scheme secure against cheating,” IEICE Trans. Fundamentals, vol.E94-A, no.6, pp.1338-1345, 2011.
3. [3] G.R. Blarkley, “Safeguarding cryptographic keys,” Proc. AFIPS 1979 National Computer Conference, vol.48, pp.313-317, 1979.
4. [4] E.F. Brickell and D.R. Stinson, “The detection of cheaters in thershold schemes,” SIAM J. Discrete Math., vol.4, no.4, pp.502-510, 1991.
5. [5] A. Choudhury, “Brief announcement: Optimal amortized secret sharing with cheater identification,” Proc. 2012 ACM Symposium on Principles of Distributed Computing — PODC'12, pp.101-102, ACM New York, NY, USA, 2012.