You have full access to this open access chapter, Download conference paper PDF
Similar content being viewed by others
Correction to: Chapter “Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem” in: T. Peyrin and S. Galbraith (Eds.): Advances in Cryptology – ASIACRYPT 2018, LNCS 11274, https://doi.org/10.1007/978-3-030-03332-3_12
Two references to papers by T. Galibus et al. have been added to this paper because these publications, published in 2007 and 2008, contain results mentioned in the present paper. The authors of the present paper were unaware of these publications and obtained their results independently.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 International Association for Cryptologic Research
About this paper
Cite this paper
Ning, Y., Miao, F., Huang, W., Meng, K., Xiong, Y., Wang, X. (2021). Correction to: Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem. In: Peyrin, T., Galbraith, S. (eds) Advances in Cryptology – ASIACRYPT 2018. ASIACRYPT 2018. Lecture Notes in Computer Science(), vol 11274. Springer, Cham. https://doi.org/10.1007/978-3-030-03332-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-03332-3_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03331-6
Online ISBN: 978-3-030-03332-3
eBook Packages: Computer ScienceComputer Science (R0)
