Skip to main content
SpringerLink
Log in

Ideal composite modular secret sharing schemes

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The paper deals with modular secret sharing schemes for certain non-threshold access structures. It is shown that based on compositions of ideal threshold modular schemes it is possible to build an ideal scheme for compartment access structures, as well as some of the more common structures, which were called composite.

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

Similar content being viewed by others

References

  1. Shamir, A., How to share a secret, Comm. of the ACM, 1979, vol. 22, pp. 612–613.

    Article  MathSciNet  MATH  Google Scholar 

  2. Blakley, G., Safeguarding cryptographic keys, Proc. AFIPS Nat. Comp. Conf., New York, 1979, vol. 48, pp. 313–317.

    Google Scholar 

  3. Simmons, G.J., How to (really) share a secret, Adv. Cryptol., 1990, vol. 403, pp. 390–448.

    MathSciNet  Google Scholar 

  4. Brickell, E.F., Some ideal secret sharing schemes, J. Comb. Math. Comb. Comput., 1989, pp. 105–113.

    Google Scholar 

  5. Biemel, A., Tassa, T., and Wienreb, E., Characterizing ideal weighted threshold secret sharing, Theory Cryptogr., 2005, vol. 3378, pp. 600–619.

    Article  Google Scholar 

  6. Mignotte, M., How to share a secret, Adv. Cryptol., 1982, pp. 371–375.

    Google Scholar 

  7. Asmuth, C. and Bloom, J., A modular approach to key safeguarding, IEEE Trans. Inf. Theory, 1983, vol. 29, pp. 156–169.

    Article  MathSciNet  Google Scholar 

  8. Galibus, T. and Matveev, G., Mignotte’s sequences over polynomial rings, Electron. Notes Theor. Comput. Sci., 2007, vol. 186, pp. 41–46.

    Article  MathSciNet  Google Scholar 

  9. Galibus, T., Matveev, G., and Shenets, N., Some structural and security properties of the modular secret sharing, SYNASC'2008: 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE Comp. Soc., CPS, Los Alamitos, California, 2009, pp. 197–200.

    Google Scholar 

  10. Shenets, N.N., On the information rate of modular secret sharing schemes, Akad. Navuk Belarusi, Ser. Fiz.Mat. Navuk, 2010, vol. 54, no. 6, pp. 9–12.

    MathSciNet  MATH  Google Scholar 

  11. Shenets, N.N., Modular sharing of the secret and the electronic voting system, Vestn. Belorus. Gos. Univ., Ser. 1, Fiz. Mat. Inf., 2011, no. 1, pp. 101–104.

    MathSciNet  Google Scholar 

  12. STB (State Standard) 34.101.60: Information Technology and Security. Algorithms for Secret Sharing, Republic of Belarus, 2014.

Download references

Author information

Authors and Affiliations

  1. Peter the Great St. Petersburg Polytechnic University, St. Petersburg, Russia

    N. N. Shenets

Authors
  1. N. N. Shenets
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. N. Shenets.

Additional information

Original Russian Text © N.N. Shenets, 2015, published in Problemy Informatsionnoi Bezopasnosti. Komp’yuternye Sistemy.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shenets, N.N. Ideal composite modular secret sharing schemes. Aut. Control Comp. Sci. 49, 798–802 (2015). https://doi.org/10.3103/S0146411615080337

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411615080337

Keywords

Search

Navigation