Abstract
A (t,n, δ) secret sharing scheme with cheating detection property (SSCD) is a t-out-of-n threshold secret sharing scheme that has the following additional property; the probability that any t malicious players can successfully cheat (without being caught) an honest player by opening forged shares and causing the honest player to reconstruct the wrong secret is at most δ. There are two flavors of security for such schemes known as OKS and CDV. The lower bound on share sizes for an OKS−secure SSCD scheme is known, and concrete schemes in which share sizes are equal to (or almost the same as) the lower bound have been proposed, albeit with some limitations. We first present a OKS−secure scheme with share sizes only one bit longer than its existing lower bound. Our construction is free from any special requirements. We next present a CDV−secure SSCD scheme, where a stronger form of cheating is allowed. The share size of our CDV−secure scheme is also one bit longer than the existing lower bound.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Araki, T.: Efficient (k,n) threshold secret sharing schemes secure against cheating from n − 1 cheaters. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 133–142. Springer, Heidelberg (2007)
Blakley, G.: Safeguarding cryptographic keys. AFIPS National Computer Conference 48, 313–317 (1979)
Cabello, S., Padró, C., Sáez, G.: Secret sharing schemes with detection of cheaters for a general access structure. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 185–194. Springer, Heidelberg (1999)
Cabello, S., Padró, C., Sáez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Cryptography 25(2), 175–188 (2002)
Carpentieri, M., De Santis, A., Vaccaro, U.: Size of shares and probability of cheating in threshold schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 118–125. Springer, Heidelberg (1994)
Cevallos, A., Fehr, S., Ostrovsky, R., Rabani, Y.: Unconditionally-secure robust secret sharing with compact shares. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 195–208. Springer, Heidelberg (2012)
Cramer, R., Damgård, I., Fehr, S.: On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 503–523. Springer, Heidelberg (2001)
Cramer, R., Dodis, Y., Fehr, S., Padró, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471–488. Springer, Heidelberg (2008)
Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. In: FOCS 1990, pp. 36–45. IEEE Computer Society (1990)
Jhanwar, M.P., Safavi-Naini, R.: On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 179–196. Springer, Heidelberg (2013)
Jhanwar, M.P., Safavi-Naini, R.: Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure. J. Mathematical Cryptology 7(4), 279–296 (2013)
Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Transactions on Information Theory 29(1), 35–41 (1983)
Kurosawa, K., Suzuki, K.: Almost secure (1-round, n-channel) message transmission scheme. IEICE Transactions 92-A(1), 105–112 (2009)
Obana, S.: Almost optimum t-cheater identifiable secret sharing schemes. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 284–302. Springer, Heidelberg (2011)
Obana, S., Araki, T.: Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 364–379. Springer, Heidelberg (2006)
Ogata, W., Eguchi, H.: Cheating detectable threshold scheme against most powerful cheaters for long secrets. Des. Codes Cryptography 71(3), 527–539 (2014)
Ogata, W., Kurosawa, K., Stinson, D.R.: Optimum secret sharing scheme secure against cheating. SIAM J. Discrete Math. 20(1), 79–95 (2006)
Padró, C., Sáez, G., Villar, J.L.: Detection of cheaters in vector space secret sharing schemes. Des. Codes Cryptography 16(1), 75–85 (1999)
Pieprzyk, J., Zhang, X.-M.: On cheating immune secret sharing. Discrete Mathematics & Theoretical Computer Science 6(2), 253–264 (2004)
Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)
Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptology 1(2), 133–138 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Jhanwar, M.P., Safavi-Naini, R. (2015). Almost Optimum Secret Sharing with Cheating Detection. In: Chakraborty, R., Schwabe, P., Solworth, J. (eds) Security, Privacy, and Applied Cryptography Engineering. SPACE 2015. Lecture Notes in Computer Science(), vol 9354. Springer, Cham. https://doi.org/10.1007/978-3-319-24126-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-24126-5_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24125-8
Online ISBN: 978-3-319-24126-5
eBook Packages: Computer ScienceComputer Science (R0)