On the use of secret sharing as a secure multi-use pad

Secret sharing (SS) is a cryptographic method proposed independently by Adi Shamir and George Blakley in 1979 to encode the keys of public-key cryptography by splitting them into maximally entropic shares that are distributed to participants, only revealing the secret when combined. Each new sharing instance, even of the same key, produces a different set of shares to distribute anew. This paper investigates SS as an independent cipher to secure confidential messages between a limited set of trusted participants by eliminating the need to redistribute shares. A participant’s master share is permanently fixed and unlimited temporary shares are created and combined with it to reveal new messages. Security is argued against specific and general attacks.

[1]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[2]  Terrance E. Boult,et al.  CloudStash: Using Secret-Sharing Scheme to Secure Data, Not Keys, in Multi-clouds , 2014, 2014 11th International Conference on Information Technology: New Generations.

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

[4]  Shyong Jian Shyu,et al.  Image encryption by multiple random grids , 2009, Pattern Recognit..

[5]  Atulya K. Nagar,et al.  Key-Based Steganographic Textual Secret Sharing for Confidential Messaging , 2013, SocProS.

[6]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[7]  Vasif V. Nabiyev,et al.  Medical image security and EPR hiding using Shamir's secret sharing scheme , 2011, J. Syst. Softw..

[8]  Mohsen Toorani,et al.  SMEmail - A New Protocol for the Secure E-mail in Mobile Environments , 2008, 2008 Australasian Telecommunication Networks and Applications Conference.

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

[10]  Ali Aydin Selçuk,et al.  Threshold Cryptography Based on Asmuth-Bloom Secret Sharing , 2006, ISCIS.

[11]  R. Kishore Kumar,et al.  Securing Multi-cloud Using Secret Sharing Algorithm , 2015 .

[12]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[13]  Katsumi Takahashi,et al.  Secret Sharing Schemes with Conversion Protocol to Achieve Short Share-Size and Extendibility to Multiparty Computation , 2013, ACISP.

[14]  KayaKamer,et al.  Threshold cryptography based on Asmuth-Bloom secret sharing , 2007 .

[15]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[16]  Alfredo De Santis,et al.  Constructions and Bounds for Visual Cryptography , 1996, ICALP.

[17]  E. Keren,et al.  Encryption of pictures and shapes by random grids. , 1987, Optics letters.

[18]  Donghui Guo,et al.  Comparing Security Notions of Secret Sharing Schemes , 2015, Entropy.

[19]  Shaohua Tang,et al.  Sharing Multi-Secret Based on Circle Properties , 2008, 2008 International Conference on Computational Intelligence and Security.

[20]  Moti Yung,et al.  Secret swarm unit: Reactive k-secret sharing , 2012, Ad Hoc Networks.

[21]  W. Gareth J. Howells,et al.  A Robust Multimodal Biometric Security System Using the Polynomial Curve Technique within Shamir's Secret Sharing Algorithm , 2012, 2012 Third International Conference on Emerging Security Technologies.

[22]  Wei Sun,et al.  Improving the visual quality of random grid-based visual secret sharing , 2013, Signal Process..