Advertisement

Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups

Extended Abstract
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 658)

Abstract

Threshold schemes allow any t out of l individuals to recompute a secret (key). General sharing schemes are a generalization. In homomorphic sharing schemes the “product” of shares of the keys gives a share of the product of the keys. We prove that there exist infinitely many Abelian groups over which there does not exist an ideal homomorphic threshold scheme. Additionally we classify ideal homomorphic general sharing schemes. We discuss the potential impact of our result on the construction of general sharing schemes.

Keywords

Secret Sharing Sylow Subgroup Access Structure Sharing Scheme Secret Sharing Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto’ 86 (Lecture Notes in Computer Science 263), pp. 251–260. Springer-Verlag, 1987. Santa Barbara, California, U.S.A., August 11–15.Google Scholar
  2. [2]
    J. C. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In S. Goldwasser, editor, Advances in Cryptology, Proc. of Crypto’ 88 (Lecture Notes in Computer Science 403), pp. 27–35. Springer-Verlag, 1990. Santa Barbara, California, U.S.A., August 11–15.Google Scholar
  3. [3]
    G. R. Blakley. Safeguarding cryptographic keys. In Proc. Nat. Computer Conf. AFIPS Conf. Proc., pp. 313–317, 1979, vol.48.Google Scholar
  4. [4]
    E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. Journal of Cryptology, 4(2), pp. 123–134, 1991.zbMATHCrossRefGoogle Scholar
  5. [5]
    G. I. Davida, R. DeMillo, and R. Lipton. Protecting shared cryptographic keys. In Proceedings of the 1980 Symposium on Security and Privacy, pp. 100–102. IEEE Computer Society, April 1980. IEEE Catalog No. 80 CH1522-2.Google Scholar
  6. [6]
    Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Advances in Cryptology, Proc. of Crypto’ 91 (Lecture Notes in Computer Science 576), pp. 457–469. Springer-Verlag, 1992. Santa Barbara, California, U.S.A., August 11–15.Google Scholar
  7. [7]
    Y. Frankel, Y. Desmedt, and M. Burmester. Non-existence of homomorphic general sharing schemes for some key spaces. To be presented at Crypto’ 92, to appear in: Advances in Cryptology. Proc. of Crypto’ 92 (Lecture Notes in Computer Science), Springer-Verlag, 1992.Google Scholar
  8. [8]
    R. G. Gallager. Information Theory and Reliable Communications. John Wiley and Sons, New York, 1968.Google Scholar
  9. [9]
    M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures (in English). In Proc. IEEE Global Telccommunications Conf., Globecom’ 87, pp. 99–102, Washington, DC., 1987. IEEE Communications Soc. Press. Also in “Trans. IEICE Japan” Vol. J71-A, No. 8, 1988 (in Japanese).Google Scholar
  10. [10]
    N. Jacobson. Basic Algebra I. W. H. Freeman and Company, New York, 2nd edition, 1985.zbMATHGoogle Scholar
  11. [11]
    E. D. Karnin, J. W. Greene, and M. Hellman. On secret sharing systems. IEEE Tr. Inform. Theory, 29(1), pp. 35–41, January 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9), pp. 583–584, September 1981.CrossRefMathSciNetGoogle Scholar
  13. [13]
    M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2), pp. 335–348, April 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    A. Shamir. How to share a secret. Commun. ACM, 22, pp. 612–613. November 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    C. E. Shannon. Communication theory of secrecy systems. Bell System Techn. Jour., 28, pp. 656–715, October 1949.MathSciNetGoogle Scholar
  16. [16]
    G. J. Simmons, W. Jackson, and K. Martin. The geometry of shared secret schemes. Bulletin of the Institute of Combinatorics and its Applications, 1, pp. 71–88, 1991.zbMATHMathSciNetGoogle Scholar
  17. [17]
    D. R. Stinson and S. A. Vanstone. A combinatorial approach to threshold schemes. SIAM Journal on Discrete Mathematics, 1(2), pp. 230–236, 1988.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  1. 1.Department of EE & CSUniversity of Wisconsin — MilwaukeeMilwaukeeUSA

Personalised recommendations