Abstract
Secret sharing scheme is a key component of distributed cryptosystems. In its basic form, secret sharing schemes can tolerate honest but curious adversary. But, in modern open system environment, adversary can behave maliciously i.e., the adversary can do anything according to his available computational resources. To get rid of such adversary, cheating identifiable (multi) secret sharing scheme plays an important role. Informally, cheating identifiable (multi) secret sharing scheme can identify the cheating participants, who are under the control of malicious adversary, and recover the correct secret whenever possible. However, to achieve unconditional security against such adversary, share size should be at least equal to the size of the secret. As a result, the need for computational notion of security of such schemes, which can accommodate smaller share size, has been felt over the years, specially in case of multi-secret sharing schemes. In this paper, we propose a notion of security for computationally secure cheating identifiable multi-secret sharing scheme for general access structure along with a construction which is secure under this new notion.
Research supported in part by National Board for Higher Mathematics, Department of Atomic Energy, Government of India (No 2/48(10)/2013/NBHM(R.P.)/R&D II/695).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 172–184 (2007)
Blakley, G.R.: Safeguarding cryptographic keys. In: The National Computer Conference 1979. AFIPS, vol. 48, pp. 313–317 (1979)
Damgård, I., Jakobsen, T.P., Nielsen, J.B., Pagter, J.I.: Secure key management in the cloud. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 270–289. Springer, Heidelberg (2013)
Das, A., Adhikari, A.: An efficient multi-use multi-secret sharing scheme based on hash function. Applied Mathematics Letters 23(9), 993–996 (2010)
Dehkordi, M.H., Mashhadi, S.: An efficient threshold verifiable multi-secret sharing. Computer Standards and Interfaces 30, 187–190 (2008)
Geng, Y.J., Fan, X.H., Hong, F.: A new multi-secret sharing scheme with multi-policy. In: The 9th International Conference on Advanced Communication Technology, vol. 3, pp. 1515–1517 (2007)
He, J., Dawson, E.: Multi-secret sharing scheme based on one-way function. Electronic Letters 31(2), 93–95 (1994)
He, J., Dawson, E.: Multi-stage secret sharing based on one-way function. Electronic Letters 30(19), 1591–1592 (1994)
Herranz, J., Ruiz, A., Saez, G.: New results and applications for multi-secret sharing schemes. In: Design, Codes and Cryptography, pp. 1–24. Springer (2013)
Herranz, J., Ruiz, A., Saez, G.: Sharing many secrets with computational provable security. Information Processing Letters 113, 572–579 (2013)
Huang, Z., Li, Q., Wei, R., Li, Z.: A Generalized Multi-secret Sharing Scheme to Identify Cheaters. Journal of the China Railway Society (July 2006)
Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 21–38. Springer, Heidelberg (2012)
Martin, K.M.: Challenging the adversary model in secret sharing schemes. Coding and Cryptography II. In: Proceedings of the Royal Flemish Academy of Belgium for Science and the Arts, pp. 45–63 (2008)
McEliece, R., Sarwate, D.: On sharing secrets and reed-solomon codes. Communications of the ACM 24(9), 583–584 (1981)
Roy, P.S., Adhikari, A.: Multi-Use Multi-Secret Sharing Scheme for General Access Structure. Annals of the University of Craiova, Mathematics and Computer Science Series 37(4), 50–57 (2010)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
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
Roy, P.S., Das, A., Adhikari, A. (2015). Computationally Secure Cheating Identifiable Multi-Secret Sharing for General Access Structure. In: Natarajan, R., Barua, G., Patra, M.R. (eds) Distributed Computing and Internet Technology. ICDCIT 2015. Lecture Notes in Computer Science, vol 8956. Springer, Cham. https://doi.org/10.1007/978-3-319-14977-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-14977-6_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14976-9
Online ISBN: 978-3-319-14977-6
eBook Packages: Computer ScienceComputer Science (R0)