Skip to main content
SpringerLink
Log in

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

  • S.I. : ICACNI 2015
  • Published:
Innovations in Systems and Software Engineering Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Aldosary S, Howells GA (2012) robust multimodal biometric security system using the polynomial curve technique within Shamir’s Secret Sharing algorithm. In: Proceedings of Third International Conference on Emerging Security Technologies, pp 66–69

  2. Alsolami F, Boult T (2014) CloudStash: using secret-sharing scheme to secure data, not keys, in multi-clouds. In: Proceedings of 11th International Conference on Information Technology: New Generations, pp 315–320

  3. Asmuth M, Bloom J (1983) A modular approach to key safeguarding. IEEE Trans Inform Theory 29:566–584

    Article  MathSciNet  Google Scholar 

  4. Ateniese G, Blundo C, De Santis A (1996) Constructions and bounds for visual cryptography. Automata, Lang Program 1099:416–428

    MathSciNet  MATH  Google Scholar 

  5. Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings of the national computer conference, pp 313–317

  6. Buckley N, Nagar AK, Arumugam S (2014) Key-based steganographic textual secret sharing. In: Proceedings of third international conference on soft computing for problem solving, pp 25–34

  7. Daemen J (2014) D-wave systems. http://www.dwavesys.com/d-wave-two-system

  8. Dai S, Guo D (2015) Comparing security notions of secret sharing schemes. MDPI Entropy 17:1135–1145

    Article  MathSciNet  Google Scholar 

  9. Dolev S, Lahiani L, Yung M (2012) Secret swarm unit: eeactive k-secret sharing. Ad Hoc Netw 10:1291–1305

    Article  MATH  Google Scholar 

  10. Ge L, Tang S (2008) Sharing multi-secret based on circle properties. In: Proceedings of International conference on computational intelligence and security, pp 340–344

  11. Kafri O, Keren E (1987) Image encryption by multiple random grids. Opt Lett 12:377–379

    Article  Google Scholar 

  12. Kaya K, Selcuk AA (2007) Threshold cryptography based on Asmuth-Bloom secret sharing 1-20

  13. Kikuchi R, Chida K, Ikarashi D, Hamada K, Takahashi K (2013) Secret sharing schemes with conversion protocol to achieve short share-size and extendibility to multiparty computation. In: Boyd C, Simpson L (eds) Visual Cryptography and Secret Image Sharing. Springer-Verlag, Publisher, pp 419–434

    Google Scholar 

  14. Kolmogorov AN (1968) Three approaches to the quantitative definition of information. Int J Comput Math 2:157–168

    Article  MathSciNet  MATH  Google Scholar 

  15. Micka P (2008) http://en.algoritmy.net/article/40379/Letter-frequency-English

  16. Mohsen T (2008) SMEmail: a new protocol for the secure E-mail in mobile environments. In: Proceedings of the Australian telecommunications networks and applications conference (ATNAC’08), pp 39–44

  17. Muhil M, Krishna UH, Kumar RK, Mary Anita EA (2015) Securing multi-cloud using secret sharing algorithm. In: Proceedings of 2nd international symposium on big data and cloud computing (ISBCC’15), pp 421–426

  18. Naor M, Shamir A (1994) Visual cryptography. In: Proceedings of EUROCRYPT, pp 1–12

  19. Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21:120–126

    Article  MathSciNet  MATH  Google Scholar 

  20. Shamir A (1979) How to share a secret. Commun ACM 22:612–613

    Article  MathSciNet  MATH  Google Scholar 

  21. Ulutas M, Ulutas G, Nabiyev VV (2011) Medical image security and EPR hiding using Shamir’s secret sharing scheme. J Syst Softw 84:341–353

    Article  Google Scholar 

  22. Wu X, Sun W (2013) Improving the visual quality of random grid-based visual secret sharing. Signal Process 93:977–995

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Liverpool Hope University, Liverpool, England

    Neil Buckley & Atulya K. Nagar

  2. Kalasalingam University, Krishnankoil, India

    S. Arumugam

Authors
  1. Neil Buckley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atulya K. Nagar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Arumugam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neil Buckley.

Additional information

This research was funded by Higher Education Institutional Research (HEIR) and Liverpool Hope University. The work is patent pending, application number GB1504243.5. The authors declare no conflict of interest in this research.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Buckley, N., Nagar, A.K. & Arumugam, S. On the use of secret sharing as a secure multi-use pad. Innovations Syst Softw Eng 12, 215–225 (2016). https://doi.org/10.1007/s11334-016-0273-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11334-016-0273-y

Keywords

Search

Navigation