{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T13:34:11Z","timestamp":1789997651606,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440505","type":"print"},{"value":"9783540457084","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45708-9_18","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:48:16Z","timestamp":1192783696000},"page":"272-287","source":"Crossref","is-referenced-by-count":46,"title":["Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"key":"18_CR1","unstructured":"A. Beimel. Secure schemes for secret sharing and key distribution. Ph.D.-thesis, Technion, Haifa, June 1996."},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","first-page":"274","volume-title":"Generalized secret sharing and monotone functions","author":"J. Benaloh","year":"1988","unstructured":"J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In: Proc. CRYPTO\u2019 88, Springer LNCS, vol. 765, pp. 274\u2013285, 1988."},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"A construction of practical secret sharing schemes using linear block codes","author":"M. Bertilsson","year":"1993","unstructured":"M. Bertilsson, I. Ingemarsson. A construction of practical secret sharing schemes using linear block codes. In Proc. AUSCRYPT\u2019 92, Springer LNCS, vol. 718, pp. 67\u201379, 1993."},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Efficient multiplicative sharing scheme","author":"S. Blackburn","year":"1996","unstructured":"S. Blackburn, M. Burmester, Y. Desmedt, and P. Wild. Efficient multiplicative sharing scheme. In: Proc. EUROCRYPT\u2019 96, Springer LNCS, vol. 1070, pp. 107\u2013118, 1996."},{"key":"18_CR5","unstructured":"G. R. Blakley. Safeguarding cryptographic keys. In: Proc. National Computer Conference\u2019 79, AFIPS Proceedings, vol. 48, pp. 313\u2013317, 1979."},{"key":"18_CR6","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell. Some ideal secret sharing schemes. In: J. Combin. Maths. & Combin. Comp. vol. 9, pp. 105\u2013113, 1989.","journal-title":"J. Combin. Maths. & Combin. Comp."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"T. Cover and J. Thomas. Elements of information theory. Wiley Series in Telecommunications, 1991.","DOI":"10.1002\/0471200611"},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Efficient general secure multi-party computation from any linear secret-sharing scheme","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, I. Damgaard, and U. Maurer. Efficient general secure multi-party computation from any linear secret-sharing scheme. In: Proc. EUROCRYPT\u2019 00, Springer LNCS, vol. 1807, pp. 316\u2013334, 2000."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient multi-party computation over rings. Manuscript, February 2002.","DOI":"10.1007\/3-540-39200-9_37"},{"key":"18_CR10","unstructured":"Y. Di Crescenzo, and Y. Frankel. Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion. In: Proc. SODA\u2019 99, ACM Press, pp. 895\u2013896, 1999."},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Theshold cryptosystem","author":"Y. Desmedt","year":"1990","unstructured":"Y. Desmedt and Y. Frankel. Theshold cryptosystem. In: Proc. CRYPTO\u2019 89, Springer LNCS, vol. 435, pp. 307\u2013315, 1990."},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Y. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite Abelian group. In: SIAM Journal on Discrete Mathematics, 7(4), pp. 667\u2013679, 1994.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, A. De Santis, Y. Frankel, and M. Yung. How to share a function securely. In: Proc. STOC\u2019 94, ACM Press, pp. 22\u201333, 1994.","DOI":"10.1145\/195058.195405"},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","first-page":"21","volume-title":"Multiplicative non-abelian sharing schemes and their application to threshold cryptography","author":"Y. Desmedt","year":"1995","unstructured":"Y. Desmedt, G. Di Crescenzo, and M. Burmester. Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Proc. ASIACRYPT\u2019 94, Springer LNCS, vol. 917, pp. 21\u201331, 1995."},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BFb0053750","volume-title":"A comment on the efficiency of secret sharing scheme over any finite Abelian group","author":"Y. Desmedt","year":"1998","unstructured":"Y. Desmedt, B. King, W. Kishimoto, and K. Kurosawa. A comment on the efficiency of secret sharing scheme over any finite Abelian group. In: Proc. ACISP\u2019 98, Springer LNCS, vol. 1438, pp. 391\u2013402, 1998."},{"key":"18_CR16","unstructured":"M. van Dijk. Secret key sharing and secret key generation. Ph. D. Thesis, Eindhoven University of Technology, 1997."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, P. MacKenzie, and M. Yung. Optimal resilience proactive public-key cryptosystems. In: Proc. FOCS\u2019 97, IEEE Press, pp. 384\u2013393, 1997.","DOI":"10.1109\/SFCS.1997.646127"},{"key":"18_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BFb0052254","volume-title":"Proactive RSA","author":"Y. Frankel","year":"1997","unstructured":"Y. Frankel, P. Gemmell, P. MacKenzie, and M. Yung. Proactive RSA. In: Proc. CRYPTO\u2019 97, Springer LNCS, vol. 1294, pp. 440\u2013454, 1997."},{"key":"18_CR19","unstructured":"A. G\u00e1l. Combinatorial methods in boolean function complexity. Ph.D.-thesis, University of Chicago, 1995."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs. In: Proc. Structures in Complexity Theory\u2019 93, IEEE Computer Society Press, pp. 102\u2013111, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"18_CR21","unstructured":"B. King. Some results in linear secret sharing. Ph.D.-thesis, University of Wisconsin-Milwaukee, 2001."},{"key":"18_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/3-540-47719-5_30","volume-title":"Randomness required for linear threshold sharing schemes defined over any finite abelian group","author":"B. King","year":"2001","unstructured":"B. King. Randomness required for linear threshold sharing schemes defined over any finite abelian group. In: Proc. ACISP\u2019 01, Springer LNCS, vol. 2119, pp. 376\u2013391, 2001."},{"key":"18_CR23","unstructured":"S. Lang. Algebra. Addison-Wesley Publishing Co., 2nd edition, 1984."},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. In: Communications of the ACM, (22) pp. 612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"18_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Practical threshold signatures","author":"V. Shoup","year":"2000","unstructured":"V. Shoup. Practical threshold signatures. In: Proc. EUROCRYPT\u2019 00, Springer LNCS, vol. 1807, pp. 207\u2013220, 2000."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45708-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:27:34Z","timestamp":1556918854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45708-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440505","9783540457084"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45708-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}