Skip to main content
Log in

On Abelian and Homomorphic Secret Sharing Schemes

  • Research Article
  • Published:
Journal of Cryptology Aims and scope Submit manuscript

Abstract

Homomorphic (resp. abelian) secret sharing is a generalization of ubiquitous linear secret sharing in which the secret value and the shares are taken from finite (resp. abelian) groups instead of vector spaces over a finite field. Homomorphic secret sharing was first defined by Benaloh and, later in the early nineties, Frankel and Desmedt presented some relevant results. Except for a few other related topics such as black-box secret sharing and secret sharing over rings, the subject has remained dormant for about three decades. The study of homomorphic secret sharing is resumed in this paper and three main results are presented: (1) mixed-linear schemes, a subclass of abelian schemes to be introduced in this paper, are more powerful than linear schemes in terms of the best achievable information ratio (the claim is proved for the port of a well-known almost entropic matroid), (2) the information ratios of dual access structures are equal for the class of abelian schemes and (3) every ideal homomorphic scheme can be transformed into an ideal linear scheme with the same access structure.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Benny Applebaum and Barak Arkis. On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate. ACM Trans. Comput. Theory, 12(4):24:1–24:21, 2020.

    Article  MathSciNet  MATH  Google Scholar 

  2. Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, and Naty Peter. Secret-sharing schemes for general and uniform access structures. In Yuval Ishai and Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part III, volume 11478 of Lecture Notes in Computer Science, pages 441–471. Springer, 2019.

  3. László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, and Avi Wigderson. Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In STOC, pages 603–611, 1996.

  4. László Babai, Anna Gál, and Avi Wigderson. Superpolynomial lower bounds for monotone span programs. Combinatorica, 19(3):301–319, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  5. Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, and Carles Padró. Common information, matroid representation, and secret sharing for matroid ports. Des. Codes Cryptogr., 89(1):143–166, 2021.

    Article  MathSciNet  MATH  Google Scholar 

  6. Amos Beimel. Secret-sharing schemes: A survey. In Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings, pages 11–46, 2011.

  7. Amos Beimel, Aner Ben-Efraim, Carles Padró, and Ilya Tyomkin. Multi-linear secret-sharing schemes. In Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings, pages 394–418, 2014.

  8. Amos Beimel, Oriol Farràs, Yuval Mintz, and Naty Peter. Linear secret-sharing schemes for forbidden graph access structures. In Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II, pages 394–423, 2017.

  9. Amos Beimel, Anna Gál, and Mike Paterson. Lower bounds for monotone span programs. Comput. Complex., 6(1):29–45, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  10. Amos Beimel and Yuval Ishai. On the power of nonlinear secret-sharing. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pages 188–202, 2001.

  11. Amos Beimel, Eyal Kushilevitz, and Pnina Nissim. The complexity of multiparty PSM protocols and related models. In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II, pages 287–318, 2018.

  12. Amos Beimel and Noam Livne. On matroids and nonideal secret sharing. IEEE Trans. Inf. Theory, 54(6):2626–2643, 2008.

    Article  MathSciNet  MATH  Google Scholar 

  13. Amos Beimel, Noam Livne, and Carles Padró. Matroids can be far from ideal secret sharing. In Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pages 194–212, 2008.

  14. Amos Beimel and Enav Weinreb. Separating the power of monotone span programs over different fields. SIAM J. Comput., 34(5):1196–1215, 2005.

    Article  MathSciNet  MATH  Google Scholar 

  15. Josh Cohen Benaloh. Secret sharing homomorphisms: Keeping shares of a secret sharing. In Andrew M. Odlyzko, editor, Advances in Cryptology - CRYPTO ’86, Santa Barbara, California, USA, 1986, Proceedings, volume 263 of Lecture Notes in Computer Science, pages 251–260. Springer, 1986.

  16. George Robert Blakley. Safeguarding cryptographic keys. Proceedings of the 1979 AFIPS National Computer Conference, 48:313–317, 1979.

    Google Scholar 

  17. Anna Blasiak, Robert Kleinberg, and Eyal Lubetzky. Lexicographic products and the power of non-linear network coding. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 609–618, 2011.

  18. Ernest F. Brickell. Some ideal secret sharing schemes. In Advances in Cryptology - EUROCRYPT ’89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings, pages 468–475, 1989.

  19. Ernest F. Brickell and Daniel M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptol., 4(2):123–134, 1991.

    Article  MATH  Google Scholar 

  20. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, and Ugo Vaccaro. On the size of shares for secret sharing schemes. J. Cryptol., 6(3):157–167, 1993.

    Article  MATH  Google Scholar 

  21. Terence H. Chan and Raymond W. Yeung. On a relation between information inequalities and group theory. IEEE Trans. Inf. Theory, 48(7):1992–1995, 2002.

    Article  MathSciNet  MATH  Google Scholar 

  22. Ronald Cramer and Serge Fehr. Optimal black-box secret sharing over arbitrary abelian groups. In Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings, pages 272–287, 2002.

  23. Ronald Cramer, Serge Fehr, Yuval Ishai, and Eyal Kushilevitz. Efficient multi-party computation over rings. In Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings, pages 596–613, 2003.

  24. Ronald Cramer, Serge Fehr, and Martijn Stam. Black-box secret sharing from primitive sets in algebraic number fields. In Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings, pages 344–360, 2005.

  25. Ronald Cramer and Chaoping Xing. Blackbox secret sharing revisited: A coding-theoretic approach with application to expansionless near-threshold schemes. In Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part I, pages 499–528, 2020.

  26. László Csirmaz. The size of a share must be large. J. Cryptol., 10(4):223–231, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  27. László Csirmaz. Book inequalities. IEEE Trans. Inf. Theory, 60(11):6811–6818, 2014.

    Article  MathSciNet  MATH  Google Scholar 

  28. László Csirmaz. Secret sharing and duality. J. Math. Cryptol., 15(1):157–173, 2020.

    Article  MathSciNet  MATH  Google Scholar 

  29. Imre Csiszar and János Körner. Information theory: coding theorems for discrete memoryless systems. Cambridge University Press, 2011.

  30. Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In Advances in Cryptology - CRYPTO ’89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings, pages 307–315, 1989.

  31. Yvo Desmedt and Yair Frankel. Perfect homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM J. Discret. Math., 7(4):667–679, 1994.

    Article  MATH  Google Scholar 

  32. Randall Dougherty, Christopher F. Freiling, and Kenneth Zeger. Six new non-Shannon information inequalities. In Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006, pages 233–236. IEEE, 2006.

  33. Randall Dougherty, Christopher F. Freiling, and Kenneth Zeger. Linear rank inequalities on five or more variables. CoRR, arXiv:0910.0284, 2009.

  34. Randall Dougherty, Eric Freiling, and Kenneth Zeger. Characteristic-dependent linear rank inequalities with applications to network coding. IEEE Trans. Information Theory, 61(5):2510–2530, 2015.

    Article  MathSciNet  MATH  Google Scholar 

  35. Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, and Carles Padró. On the information ratio of non-perfect secret sharing schemes. Algorithmica, 79(4):987–1013, 2017.

    Article  MathSciNet  MATH  Google Scholar 

  36. Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, and Carles Padró. Improving the linear programming technique in the search for lower bounds in secret sharing. IEEE Trans. Inf. Theory, 66(11):7088–7100, 2020.

    Article  MathSciNet  MATH  Google Scholar 

  37. Oriol Farràs, Jaume Martí-Farré, and Carles Padró. Ideal multipartite secret sharing schemes. J. Cryptol., 25(3):434–463, 2012.

    Article  MathSciNet  MATH  Google Scholar 

  38. Serge Fehr. Span programs over rings and how to share a secret from a module. Master’s thesis. ETH Zurich, 1998.

  39. Yair Frankel and Yvo Desmedt. Classification of ideal homomorphic threshold schemes over finite abelian groups (extended abstract). In Rainer A. Rueppel, editor, Advances in Cryptology - EUROCRYPT ’92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings, volume 658 of Lecture Notes in Computer Science, pages 25–34. Springer, 1992.

  40. Yair Frankel, Yvo Desmedt, and Mike Burmester. Non-existence of homomorphic general sharing schemes for some key spaces (extended abstract). In Ernest F. Brickell, editor, Advances in Cryptology - CRYPTO ’92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings, volume 740 of Lecture Notes in Computer Science, pages 549–557. Springer, 1992.

  41. Satoru Fujishige. Polymatroidal dependence structure of a set of random variables. Inf. Control., 39(1):55–72, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  42. Anna Gál. A characterization of span program size and improved lower bounds for monotone span programs. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pages 429–437, 1998.

  43. Anna Gál and Pavel Pudlák. A note on monotone complexity and the rank of matrices. Inf. Process. Lett., 87(6):321–326, 2003.

    Article  MathSciNet  MATH  Google Scholar 

  44. Abbas El Gamal and Young-Han Kim. Network Information Theory. Cambridge University Press, 2011.

  45. Emirhan Gürpinar and Andrei E. Romashchenko. How to use undiscovered information inequalities: Direct applications of the copy lemma. In IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019, pages 1377–1381. IEEE, 2019.

  46. Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, and Nikolai K. Vereshchagin. Inequalities for Shannon entropy and Kolmogorov complexity. J. Comput. Syst. Sci., 60(2):442–464, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  47. Aubrey W Ingleton. Representation of matroids. Combinatorial mathematics and its applications, 23, 1971.

  48. Mitsuru Ito, Akira Saito, and Takao Nishizeki. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72(9):56–64, 1989.

    MathSciNet  Google Scholar 

  49. Wen-Ai Jackson and Keith M. Martin. Geometric secret sharing schemes and their duals. Des. Codes Cryptography, 4(1):83–95, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  50. Amir Jafari and Shahram Khazaei. Partial secret sharing schemes. IACR Cryptol. ePrint Arch., 2020:448, 2020.

    Google Scholar 

  51. Reza Kaboli, Shahram Khazaei, and Maghsoud Parviz. On group-characterizability of homomorphic secret sharing schemes. Theor. Comput. Sci. 2021. https://doi.org/10.1016/j.tcs.2021.08.032

  52. Tarik Kaced. Equivalence of two proof techniques for non-shannon-type inequalities. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, pages 236–240. IEEE, 2013.

  53. Tarik Kaced. Information inequalities are not closed under polymatroid duality. IEEE Trans. Information Theory, 64(6):4379–4381, 2018.

    Article  MathSciNet  MATH  Google Scholar 

  54. Mauricio Karchmer and Avi Wigderson. On span programs. In Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pages 102–111, 1993.

  55. Ehud D. Karnin, J. W. Greene, and Martin E. Hellman. On secret sharing systems. IEEE Trans. Information Theory, 29(1):35–41, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  56. Kasper Green Larsen and Mark Simkin. Secret sharing lower bound: Either reconstruction is hard or shares are long. In Clemente Galdi and Vladimir Kolesnikov, editors, Security and Cryptography for Networks - 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings, volume 12238 of Lecture Notes in Computer Science, pages 566–578. Springer, 2020.

  57. Mulan Liu and Zhanfei Zhou. Ideal homomorphic secret sharing schemes over cyclic groups. Science in China Series E: Technological Sciences, 41(6):650–660, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  58. Tianren Liu and Vinod Vaikuntanathan. Breaking the circuit-size barrier in secret sharing. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 699–708, 2018.

  59. Tianren Liu, Vinod Vaikuntanathan, and Hoeteck Wee. Conditional disclosure of secrets via non-linear reconstruction. In Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I, pages 758–790, 2017.

  60. Konstantin Makarychev, Yury Makarychev, Andrei E. Romashchenko, and Nikolai K. Vereshchagin. A new class of non-shannon-type inequalities for entropies. Commun. Inf. Syst., 2(2):147–166, 2002.

    Article  MathSciNet  MATH  Google Scholar 

  61. Jaume Martí-Farré and Carles Padró. Secret sharing schemes on access structures with intersection number equal to one. Discret. Appl. Math., 154(3):552–563, 2006.

    Article  MathSciNet  MATH  Google Scholar 

  62. Jaume Martí-Farré and Carles Padró. Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Des. Codes Cryptogr., 52(1):1–14, 2009.

    Article  MathSciNet  MATH  Google Scholar 

  63. Frantisek Matús. Adhesivity of polymatroids. Discret. Math., 307(21):2464–2477, 2007.

    Article  MathSciNet  MATH  Google Scholar 

  64. Frantisek Matús. Two constructions on limits of entropy functions. IEEE Trans. Information Theory, 53(1):320–330, 2007.

    Article  MathSciNet  MATH  Google Scholar 

  65. Frantisek Matús and László Csirmaz. Entropy region and convolution. IEEE Trans. Inf. Theory, 62(11):6007–6018, 2016.

    Article  MathSciNet  MATH  Google Scholar 

  66. Carles Padró. Lecture notes in secret sharing. IACR Cryptology ePrint Archive, 2012:674, 2012.

    Google Scholar 

  67. Carles Padró and Germán Sáez. Secret sharing schemes with bipartite access structure. IEEE Trans. Inf. Theory, 46(7):2596–2604, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  68. Victor Bryallan Peña Macias. New Characteristic Dependent Linear Rank Inequalities. PhD thesis, Universidad Nacional de Colombia Facultad de Ciencias Departamento de Matemáticas, Bogotá, Colombia, 2020.

  69. Toniann Pitassi and Robert Robere. Lifting nullstellensatz to monotone span programs over any field. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 1207–1219, 2018.

  70. Alexander A. Razborov. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica, 10(1):81–93, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  71. Paul D. Seymour. On secret-sharing matroids. J. Comb. Theory, Ser. B, 56(1):69–73, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  72. Adi Shamir. How to share a secret. Commun. ACM, 22(11):612–613, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  73. Juriaan Simonis and Alexei E. Ashikhmin. Almost affine codes. Des. Codes Cryptography, 14(2):179–197, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  74. Douglas R. Stinson. Decomposition constructions for secret-sharing schemes. IEEE Trans. Inf. Theory, 40(1):118–125, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  75. Hung-Min Sun and Shiuh-Pyng Shieh. Secret sharing in graph-based prohibited structures. In Proceedings IEEE INFOCOM’97, The Conference on Computer Communications, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, Kobe, Japan, April 7-12, 1997, pages 718–724, 1997.

  76. Vinod Vaikuntanathan and Prashant Nalini Vasudevan. Secret sharing and statistical zero knowledge. In Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 - December 3, 2015, Proceedings, Part I, pages 656–680, 2015.

  77. Marten van Dijk, Wen-Ai Jackson, and Keith M. Martin. A general decomposition construction for incomplete secret sharing schemes. Des. Codes Cryptogr., 15(3):301–321, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  78. Zhen Zhang and Raymond W. Yeung. A non-shannon-type conditional inequality of information quantities. IEEE Trans. Information Theory, 43(6):1982–1986, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  79. Zhen Zhang and Raymond W. Yeung. On characterization of entropy function via information inequalities. IEEE Trans. Inf. Theory, 44(4):1440–1452, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  80. Zhanfei Zhou. Classification of universally ideal homomorphic secret sharing schemes and ideal black-box secret sharing schemes. In Information Security and Cryptology, First SKLOIS Conference, CISC 2005, Beijing, China, December 15-17, 2005, Proceedings, pages 370–383, 2005.

Download references

Acknowledgements

We would like to thank the anonymous reviewers for their constructive feedback which lead to improve the presentation of our work substantially. We also thank Sorush Bahariyan for his help in completing the results of Tables 1 and 2. The second author has been supported by Iran National Science Foundation (INSF) Grant No. 99025148.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shahram Khazaei.

Additional information

Communicated by Serge Fehr.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

A. Pontryagin Dual

For a vector space V over a field \(\mathbb {F}\), a basis \(\{v_1,\dots ,v_n\}\) gives a way to uniquely write any element \(v\in V\) as a linear combination \(v=c_1v_1+\dots +c_nv_n\), with \(c_i\)’s all in \(\mathbb {F}\). The map that sends v to \(c_i\) defines a linear map from V to \(\mathbb {F}\), called a functional on V. The space of all functionals on V is the dual vector space for V and has a basis given by the above functionals constructed from the given basis.

To extend these notions from vector spaces to finite (and more generally locally compact) abelian groups, Pontryagin devised the notion of a dual group, commonly known as the Pontryagin dual. For a finite abelian group G, the Pontryagin dual of G, denoted by \(\widehat{G}\), is the group of all homomorphisms from the group G to the multiplicative group of nonzero complex numbers. That is,

$$\begin{aligned} \widehat{G} = \{ \alpha : G\rightarrow \mathbb {C}^* | \alpha (0)=1, \alpha (a+b)= \alpha (a) \alpha (b) \}. \end{aligned}$$

Note that in fact the image of this homomorphism is inside the subgroup of the complex numbers of absolute value 1 (circle). If the group G is cyclic of order n, then \(\widehat{G}\) can be identified with the group of nth roots of unity. The reason is that any homomorphism is determined by its value on a generator of the group, which must be an nth root of unity. This way, one sees that the dual group in this case is isomorphic to itself (in a non-canonical way). This can be generalized to be valid for all finite abelian groups, because any such group is a direct sum of finite cyclic groups. Pontryagin showed that if for a locally compact abelian group G we take the dual once more, then the double dual \(\widehat{\widehat{G}}\) is canonically isomorphic to the original group G. And this was the beginning of the Fourier theory on locally compact abelian groups.

B. On Equivalent Definitions for Abelian RVs

In the following, we will show the four implications (i)\(\Rightarrow \)(ii)\(\Rightarrow \)(iii)\(\Rightarrow \)(iv)\(\Rightarrow \)(i) for abelian RVs given in Definition 2.6.

i\(\Rightarrow \)ii:

Let \(\mu _i:S\rightarrow S_i\) be a collection of homomorphisms as in (i), inducing a linear RV \(\varvec{X}=\mu (\varvec{S})\) where \(\mu : S\rightarrow \bigoplus _{i=1}^n S_i\) is the direct sum homomorphism defined by \(\mu (s)=\big (\mu _1(s),\ldots ,\mu _n(s)\big )\) and \(\varvec{S}\) is uniformly distributed on S. Let \(\varOmega _i=S_i\) and \(\varOmega \) be the image of this homomorphism. Clearly, \(\varvec{X}\) is uniformly distributed on \(\varOmega \) and hence we are in the setting of (ii).

ii\(\Rightarrow \)iii:

Let \(\varOmega \) be a subgroup of \(\bigoplus _{i=1}^n \varOmega _i\) as in (ii). Let \(U=\varOmega \) and \(U_i\) be the subgroup of \(\varOmega \) of those elements with i’th coordinate equal to zero. Then, by the first isomorphism theorem of groups, the image of the projection \(\pi _i: \varOmega \rightarrow \varOmega _i\) is isomorphic to the quotient group \(U/U_i\). More generally, for a subset \({A}\subseteq [n]\), the image of the projection \(\pi _{{A}}: \varOmega \rightarrow \bigoplus _{i\in {A}}\varOmega _i\) is isomorphic to the quotient group \(U/U_{A}\), where \(U_{{A}}=\bigcap _{i\in {A}}U_i\). Also, \(U/U_{A}\) is isomorphic to the group of all elements of the form \((u+U_1,\ldots ,u+U_n)\), for all \(u\in U\). Therefore, a uniform RV on \(\varOmega \) as in (ii) is equivalent to a uniform RV as in (iii).

iii\(\Rightarrow \)iv:

Let U and its subgroups \(U_1,\dots , U_n\) be given as in the case (iii). Let \(T=\widehat{U}\) and define \(T_i\) to be the subgroup of T of those homomorphisms that vanishes on \(U_i\); that is, \(T_{i}=\{\alpha \in \widehat{U}: \alpha (x)=0 \text { for every } x\in U_{i}\}\). Then, by Pontryagin duality, \(\widehat{T}\) is isomorphic to U and the map \(\widehat{T}\rightarrow \widehat{T}_i\) that sends \(\alpha \in \widehat{T}\) to \(\alpha |_{T_i}\) is equivalent to the projection \(U\rightarrow U/U_i\). More generally, for a subset \({A}\subseteq [n]\), the map \(\widehat{T}\rightarrow \bigoplus _{i\in {A}}\widehat{T}_i\) that sends \(\alpha \in \widehat{T}\) to \((\alpha |_{T_i})_{i\in {A}}\) is equivalent to the projection \(U\rightarrow U/U_{A}\), where \(U_{{A}}=\bigcap _{i\in {A}}U_i\). Also, as we mentioned earlier \(U/U_{A}\) is isomorphic to the group of all elements of the form \((u+U_1,\ldots ,u+U_n)\), for all \(u\in U\). Therefore, a uniform RV as in (iii) is equivalent to a uniform RV as in (iv).

iv\(\Rightarrow \)i:

Let T be a finite abelian group with its subgroups \(T_1,\dots , T_n\) as in (iv). Let \(S=\widehat{T}\) and \(S_i=\widehat{T}_i\) and let \(\mu _i:S\rightarrow S_i\) be the map that sends a homomorphism \(\alpha \in S\) to \(\alpha |_{T_i}\) (clearly, \(\alpha |_{T_i}\in S_i\)). Obviously the distribution induced by T and \(T_i\)’s as in (iv) is also definable by \(\big (\mu _1(\varvec{S}),\ldots ,\mu _n(\varvec{S})\big )\), where \(\varvec{S}\) is uniformly distributed on S. Therefore, we are in the setting of (i).

C. Proof of Theorem 3.25

The theorem follows by the following lemma. Part (i) has been proved by Frankel, Desmedt and Burmester in [40]. Part (ii) was proved in a subsequent work by Frankel and Desmedt in [39].

Lemma C.1

(Homomorphic SSS) Let \({\mathcal {A}}\) be an access structure with at least one minimal qualified subset of size at least two. Let \(\varOmega \subseteq \prod _{i\in Q}\varOmega _i\) be a homomorphic SSS for \({\mathcal {A}}\). Then,

  1. (i)

    the secret space, \(\varOmega _0\), is an abelian group.

  2. (ii)

    if \(\varOmega \) is ideal, then \(\varOmega _0\cong \varOmega _i\).

Proof

For a subset \(A\subseteq Q\), we have a projection map \(\pi _A\) from \(\prod _{i\in Q}\varOmega _i\) onto \(\prod _{i\in A} \varOmega _i\) and we use the notation \(\varOmega _A\) to denote the projection of the group \(\varOmega \) onto the components in A, i.e., \(\varOmega _A=\pi _A(\varOmega )\). Also, for \(x\in \varOmega \), we denote the projection on entries with indices in a subset \({A}\subseteq Q\) by \(x_A\); we use \(x_i\) for \(i\in Q\).

  1. (i)

    We need to show that for all \(s_1,s_2\in \varOmega _0\), \(s_1\cdot s_2=s_2\cdot s_1\). Let \(e\in \varOmega \) be the identity element, that is, an element whose i component is the identity elements of the corresponding groups \(\varOmega _i\). Let \(A=\{j_1,j_2,\dots , j_k\}\) be a minimal set in \({\mathcal {A}}\) of size at least 2 and, for \(i=1,2\), let \(A_i=A\backslash \{j_i\}\). Since \(A_i\not \in {\mathcal {A}}\) and \(e\in \varOmega \), there are \(x(i)\in \varOmega \) such that \(x(i)_{A_i}=e_{A_i}\) and \(x(i)_0=s_i\). Then, since any element in a group commutes with the identity element, we have \((x(1)\cdot x(2))_A=(x(2)\cdot x(1))_A\), and since \(A\in {\mathcal {A}}\), we must have \((x(1)\cdot x(2))_0=(x(2)\cdot x(1))_0\), that is \(s_1\cdot s_2=s_2\cdot s_1\).

  2. (ii)

    We first show that for a general homomorphic scheme \(\varOmega \) and for every \(i\in Q\), the secret group \(\varOmega _0\) is a sub-quotient of \(\varOmega _i\); that is, there is an into group homomorphism from a subgroup of \(\varOmega _i\) to \(\varOmega _0\). Let \(A\in {\mathcal {A}}\) be a minimal set of size at least two that contains i and \(A_i=A\backslash \{i\}\). Let \(\varOmega '_i\) be the kernel of the projection \(\pi '_{i}:\varOmega _A\rightarrow \varOmega _{A_i}\). Then, \(\varOmega '_i\) can be identified with a subgroup of \(\varOmega _i\). We show that the restriction of the reconstruction homomorphism \(R_A\) to \(\varOmega '_i\) is an onto homomorphism to \(\varOmega _0\). For any \(s\in \varOmega _0\) we need to find an element \(y\in \varOmega \) such that \(y_{A_i}=e_{A_i}\) and \(y_0=s\), since then \(y_A\in \varOmega _i'\) and \(R_A(y_A)=s\). This follows from the fact that \(A_i\not \in {\mathcal {A}}\).

    Therefore, there is an onto homomorphism from a subgroup \(\varOmega _i'\) of \(\varOmega _i\) onto \(\varOmega _0\). But for an ideal \(\varOmega \), since \(|\varOmega _i|=|\varOmega _0|\), we must have \(\varOmega _i'=\varOmega _i\) and the homomorphism must be an isomorphism, because an onto map between sets of the same size is also one to one. So all \(\varOmega _i\)’s are isomorphic to \(\varOmega _0\).

\(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jafari, A., Khazaei, S. On Abelian and Homomorphic Secret Sharing Schemes. J Cryptol 34, 43 (2021). https://doi.org/10.1007/s00145-021-09410-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00145-021-09410-2

Keywords

Navigation