Skip to main content
SpringerLink
Log in

Linear Secret Sharing Schemes and Rearrangements of Access Structures

  • Original Papers
  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

In this paper we study linear secret sharing schemes by monotone span programs, according to the relation between realizing access structures by linear secret sharing schemes and computing monotone Boolean functions by monotone span programs. We construct some linear secret sharing schemes. Furthermore, we study the rearrangements of access structures that is very important in practice.

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. Beimel, A. Secure schemes for secret sharing and key distribution. PhD thesis, Technion—Israel Institute of Techonlogy, 1996

  2. Blackley, G.R. Safeguarding cryptographic keys. In R. E. Merwin, J.T. Zanca, and M. Smith, editors, In: Proc. of the 1979 AFIPS National Computer Conference, Vol.48 of AFIPS Conference proceedings, 313–317. AFIPS Press, 1979

  3. Ito, M., Saito, A., Nishizeki, T. Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 87, 99–102, 1987 Journal version: Multiple Assignment Scheme for Sharing Secret. J. of Cryptology, 6(1): 15–20 1993

    Article  MATH  Google Scholar 

  4. Shamir, A. How to share a secret. Communications of the ACM, 22: 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Simmons, G.J. Contemporary Cryptology—The Science of Information Integrity, 1992

Download references

Author information

Authors and Affiliations

  1. Institute of Software, The State Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing, 100080, China

    Liang-liang Xiao

  2. Academy of Mathematics and Systems Science, Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing, 100080, China

    Mu-lan Liu

Authors
  1. Liang-liang Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mu-lan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang-liang Xiao.

Additional information

Supported by the National Natural Science Foundation of China (90304012, 90204016, 2003AA144030)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xiao, Ll., Liu, Ml. Linear Secret Sharing Schemes and Rearrangements of Access Structures. Acta Mathematicae Applicatae Sinica, English Series 20, 685–694 (2004). https://doi.org/10.1007/s10255-004-0206-7

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-004-0206-7

Keywords

2000 MR Subject Classification

Search

Navigation