Multi-Secret Communication Scheme

In this era of Information, exchange of digital data in various forms and formats is an important activity of human and computer networks. This digital communication pops up many security issues to keep the data and thus information reliable. This paper presents a secured scheme using Chinese remainder theorem to communicate multiple secrets in shared forms to disjoint groups of users and also presents a proof of security that this scheme can offer.

[1]  Moni Naor,et al.  Visual Cryptography , 1994, Encyclopedia of Multimedia.

[2]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[3]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[4]  Chakravarthy Bhagvati,et al.  CRT based secured encryption scheme , 2012, 2012 1st International Conference on Recent Advances in Information Technology (RAIT).

[5]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[6]  Jagdish Chandra Patra,et al.  Robust CRT-based watermarking technique for authentication of image and document , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[7]  Bart Preneel,et al.  On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem , 2002, Public Key Cryptography.

[8]  Sorin Iftene,et al.  Secret Sharing Schemes with Applications in Security Protocols , 2006, Sci. Ann. Cuza Univ..

[9]  C. Ding.  Chinese remainder theorem , 1996 .

[10]  Ali Aydin Selçuk,et al.  A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem , 2008, INDOCRYPT.

[11]  Ali Aydin Selçuk,et al.  Robust Threshold Schemes Based on the Chinese Remainder Theorem , 2008, AFRICACRYPT.