Skip to main content
SpringerLink
Log in

Ideal homomorphic secret sharing schemes over cyclic groups

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

For a cyclic groupG and an access structureA, the sufficient and necessary condition under whichA isG-ideal homomorphic is given by using the fine-representation of the corresponding matroid over the ring\(\mathbb{Z}_m \). Furthermore, the clasification ofG-ideal homomorphic graphic access structures is shown.

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. Benaloh, J. C., Secret sharing homomorphisms: keeping shares of a secret secret,Advances in Cryptology-CRYPTO' 86, Berlin: Springer-Verlag, 1987, LNCS 263: 251.

    Google Scholar 

  2. Desmedt, Y., Frankel, Y., Shared generation of authenticators and signatures,Advances in Cryptology-CRYPTO' 91, Berlin: Springer-Verlag, 1992, LNCS576: 457.

    Google Scholar 

  3. Frankel, Y., Desmedt, Y., Burmester, M., Non-existence of homomorphic general sharing schemes for some key spaces,Advances in Cryptology-CRYPTO' 92, Berlin: Springer-Verlag, 1993, LNCS740: 549.

    Google Scholar 

  4. Frankel, Y., Desmedt, Y., Classification of ideal homomorphic threshold schemes over finite abelian groups,Advances in Cryptology-EUROCRYPT' 92, Berlin: Springer-Verlag, 1993, LNCS 658: 25.

    Google Scholar 

  5. Ito, M., Saito, A., Nishizeki, T., Secret sharing scheme realizing general access structure,Proc. IEEE Global Telecommunications Conf., Globecom 87, Los Angeles: IEEE Press, 1987, 99–102.

    Google Scholar 

  6. Brickell, E. F., Davenport, D. M., On the classification of ideal secret sharing schemes,J. Cryptology, 1991, Berlin: Springer-Verlag, 4(2): 123.

    Google Scholar 

  7. Benaloh, C., Leichter, J., Generalized secret sharing and monotone functions,Advances in Cryptology-CRYPTO' 88, Berlin: Springer-Verlag, 1990, LNCS403: 27.

    Google Scholar 

  8. Welsh, D. J. A.,Matroid Theory, London: Academic, 1976.

    MATH  Google Scholar 

  9. Beimel, A., Chor, B., Universally ideal secret sharing schemes,IEEE Trans. on IT, 1994, IT-40(3): 786.

    Article  MATH  MathSciNet  Google Scholar 

  10. Seymour, P.D., On secret sharing matroids,J. Comb. Theory, Ser. B, 1992, 56: 69.

    Article  MATH  MathSciNet  Google Scholar 

  11. McDonald, B.R.,Linear Algebra over Commutative Rings, New York: Marcel Dekker, 1984.

    MATH  Google Scholar 

  12. Karnin, E.D., Greene, J.W., Hellman, M.E., On secret sharing systems,IEEE Trans. on I T, 1983, IT-29(1): 35.

    Article  MATH  MathSciNet  Google Scholar 

  13. Blakley, G.R., Safeguarding cryptographic keys,Proc. AFIPS 1979 Nat. Computer Conf., Vol. 48, 1979, 313–317.

    Google Scholar 

  14. Shamir, A., How to share a secret,Commun. ACM., 1979, 22(11): 612.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Systems Science, Chinese Academy of Sciences, 100080, Beijing, China

    Mulan Liu

  2. Institute of Software, Chinese Academy of Sciences, 100080, Beijing, China

    Zhanfei Zhou

Authors
  1. Mulan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhanfei Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Project supported by the National Natural Science Foundation of China (Grant Nos. 69573039, 19331011).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, M., Zhou, Z. Ideal homomorphic secret sharing schemes over cyclic groups. Sci. China Ser. E-Technol. Sci. 41, 650–660 (1998). https://doi.org/10.1007/BF02917049

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02917049

Keywords

Search

Navigation