Multipartite Secret Sharing Based on CRT
- 218 Downloads
Secure communication has become more and more important for system security. Since avoiding the use of encryption one by one can introduce less computation complexity, secret sharing scheme (SSS) has been used to design many security protocols. In SSSs, several authors have studied multipartite access structures, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role. Access structures realized by threshold secret sharing are the simplest multipartite access structures, i.e., unipartite access structures. Since Asmuth–Bloom scheme based on Chinese remainder theorem (CRT) was presented for threshold secret sharing, recently, threshold cryptography based on Asmuth–Bloom secret sharing were firstly proposed by Kaya et al. In this paper, we extend Asmuth–Bloom and Kaya schemes to bipartite access structures and further investigate how SSSs realizing multipartite access structures can be conducted with the CRT. Actually, every access structure is multipartite and, hence, the results in this paper can be seen as a new construction of general SSS based on the CRT. Asmuth–Bloom and Kaya schemes become the special cases of our scheme.
KeywordsSecret sharing schemes Multipartite access structures Chinese remainder theorem Asmuth–Bloom secret sharing
- 1.Blakley, G. R. (1979). Safeguarding cryptographic keys. In Proceedings of AFIPs I979 national computer conference, New York (Vol. 48, pp. 313–317).Google Scholar
- 3.Guo, C., & Chang, C.-C. (2012). An authenticated group key distribution protocol based on the generalized Chinese remainder theorem. International Journal of Communication System. doi: 10.1002/dac.2348.
- 4.He, D., Chen, C., Ma, M., Chan, S., & Bu, J. (2011). A secure and efficient password-authenticated group key exchange protocol for mobile ad hoc networks. International Journal of Communication System. doi: 10.1002/dac.1355.
- 6.Chang, C.-C., Cheng, T.-F., & Wu, H.-L. (2012). An authentication and key agreement protocol for satellite communications. International Journal of Communication System. doi: 10.1002/dac.2448.
- 9.Bloom, J. R. (1981). Threshold schemes and error-correcting codes. In Abstract of papers presented to America Mathematical Society (Vol. 2, p. 230).Google Scholar
- 12.Kaya, K., & Selçuk, A. A. (2008). Robust threshold schemes based on the Chinese remainder Ttheorem. In Advances in cryptography—AFRICACRYPT 2008. Lecture notes in computer sciences (Vol. 5023, pp. 94–108).Google Scholar
- 14.Harn, L., Fuyou, M., & Chang, C. C. (2013). Verifiable secret sharing based on the Chinese remainder theorem. Security and Communication Networks. doi: 10.1002/sec.807.
- 15.Liu, Y., Harn, L., & Chang, C.-C. (2014). An authenticated group key distribution Mechanism using theory of numbers. International Journal of Communication Systems.Google Scholar
- 18.Beimel, A., Tassa, T., & Weinreb, E. (2005). Characterizing ideal weighted threshold secret sharing. In Second theory of cryptography conference, TCC 2005. Lecture notes in computer science (Vol. 3378, pp. 600–619).Google Scholar
- 20.Simmons, G. J. (1990). How to (really) share a secret. In Advances in cryptology CRYPTO ’88. Lecture notes in computer science (Vol. 403, pp. 390–448).Google Scholar
- 21.Herranz, J., & Sáez, G. (2006). New results on multipartite access structures. IEE Proceedings-Information Security, 153(4), 153–162.Google Scholar
- 23.Tassa, T. (2004). Hierarchical threshold secret sharing. In First theory of cryptography conference, TCC 2004. Lecture notes in computer science (Vol. 2951, pp. 473–490).Google Scholar
- 24.Tassa, T., & Dyn, N. (2006). Multipartite secret sharing by bivariate interpolation. In 33rd international colloquium on automata, languages and programming, ICALP 2006. Lecture notes in computer science (Vol. 4052, pp. 288–299).Google Scholar
- 27.Collins, M. J. (2002). A note on ideal tripartite access structures. IACR Cryptology ePrint Archive, 2002, 193.Google Scholar
- 29.Mignotte, M. (1983). How to share a secret. In T. Beth (Ed.), Cryptography-proceedings of the workshop on cryptography, Burg Feuerstein, 1982. Lecture notes in computer science (Vol. 149, pp. 371–375).Google Scholar
- 30.Chaum, D., Crépeau, C., & Damgard, I. (1998). Multiparty unconditionally secure protocols[C]. In Proceedings of the twentieth annual ACM symposium on theory of computing (pp. 11–19). ACM.Google Scholar
- 31.Cohen, H. (2000). A course in computational algebraic number theory, 4th ed., Ser. Graduate texts in mathematics. Berlin: Springer.Google Scholar