Skip to main content

A Survey of Secret Sharing Schemes Based on Latin Squares

  • Conference paper
  • First Online:

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 82))

Abstract

Secret sharing schemes are wildly used in many applications where the secret must be recovered by joint work of certain amount of participants. There are many techniques to construct a secret sharing scheme, one of them is the construction using critical sets of Latin squares. In this paper, we will investigate the features of back circulant Latin squares, their corresponding critical sets and show how a secret sharing scheme can be constructed using such kind of critical sets. Finally, we will point out the constraints and future research on such kind of secret sharing schemes.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Blakley, G.R.: Safeguarding cryptographic keys. AFIPS Conf. Proc. 48, 313–317 (1979)

    Google Scholar 

  2. Cooper, J., Donovan, D., Seberry, J.: Latin squares and critical sets of minimal size. Australas. J. Combin. 4, 113–120 (1991)

    MathSciNet  MATH  Google Scholar 

  3. Cooper, J., Donovan, D., Seberry, J.: Secret sharing schemes arising from Latin square. Bull. Inst. Combin. Appl. 12, 33–43 (1994)

    MathSciNet  MATH  Google Scholar 

  4. Donovan, D., Cooper, J.: Critical sets in back circulant Latin squares. Aequationes Math. 52, 157–179 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Donovan, D., Cooper, J., Nott, D.J., Seberry, J.: Latin squares: critical sets and their lower bounds. Ars Combin. 39, 33–48 (1995)

    MathSciNet  MATH  Google Scholar 

  6. Shamir, A.: How to share a secret. Comm. ACM 22, 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  7. Smetaniuk, B.: On the minimal critical set of a latin square. Util. Math. 16, 97–100 (1979)

    MathSciNet  MATH  Google Scholar 

  8. Stinson, D.R., van Rees, G.H.J.: Some large critical sets. Congr. Numer. 34, 441–456 (1982)

    MathSciNet  MATH  Google Scholar 

  9. Street, A.P.: Defining sets for \(t\)-designs and critical sets for Latin squares. New Zealand J. Math. 21, 133–144 (1992)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Raylin Tso .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Tso, R., Miao, Y. (2018). A Survey of Secret Sharing Schemes Based on Latin Squares. In: Pan, JS., Tsai, PW., Watada, J., Jain, L. (eds) Advances in Intelligent Information Hiding and Multimedia Signal Processing. IIH-MSP 2017. Smart Innovation, Systems and Technologies, vol 82. Springer, Cham. https://doi.org/10.1007/978-3-319-63859-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63859-1_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63858-4

  • Online ISBN: 978-3-319-63859-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics