{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:18Z","timestamp":1725475818997},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677420"},{"type":"electronic","value":"9783540450306"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10718964_28","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T21:04:09Z","timestamp":1167426249000},"page":"342-351","source":"Crossref","is-referenced-by-count":2,"title":["On Multiplicative Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Huaxiong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwok Yan","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guo-Zhen","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanhui","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N. Alon","year":"1996","unstructured":"Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica\u00a016, 434\u2013449 (1996)","journal-title":"Algorithmica"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M. Atici","year":"1996","unstructured":"Atici, M., Magliveras, S.S., Stinson, D.R., Wei, W.D.: Some Recursive Constructions for Perfect Hash Families. Journal of Combinatorial Designs\u00a04, 353\u2013363 (1996)","journal-title":"Journal of Combinatorial Designs"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","first-page":"251","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"J.C. Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: Keeping shares of a secret secret. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 251\u2013260. Springer, Heidelberg (1987)"},{"key":"28_CR4","first-page":"49","volume-title":"Combinatorial Designs and their Applications (Chapman and Hall\/CRC Research Notes in Mathematics)","author":"S.R. Blackburn","year":"1999","unstructured":"Blackburn, S.R.: Combinatorics and Threshold Cryptology. In: Combinatorial Designs and their Applications (Chapman and Hall\/CRC Research Notes in Mathematics), pp. 49\u201370. CRC Press, London (1999)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"S.R. Blackburn","year":"1996","unstructured":"Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 107\u2013118. Springer, Heidelberg (1996)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"Z.J. Czech","year":"1997","unstructured":"Czech, Z.J., Havas, G., Majewski, B.S.: Perfect Hashing. Theoretical Computer Science\u00a0182, 1\u2013143 (1997)","journal-title":"Theoretical Computer Science"},{"key":"28_CR8","first-page":"522","volume-title":"Proc. 26th Annual Symp. on the Theory of Computing","author":"A. Santis De","year":"1994","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proc. 26th Annual Symp. on the Theory of Computing, pp. 522\u2013533. ACM, New York (1994)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0030418","volume-title":"Information Security","author":"Y. Desmedt","year":"1998","unstructured":"Desmedt, Y.: Some recent research aspects of threshold cryptography. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol.\u00a01396, pp. 99\u2013114. Springer, Heidelberg (1998)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0000421","volume-title":"Advances in Cryptology - ASIACRYPT \u201994","author":"Y. Desmedt","year":"1995","unstructured":"Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol.\u00a0917, pp. 21\u201332. Springer, Heidelberg (1995)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y., Frankel, Y.: Homomorphic zero-knowledge threshold schemes over any finite group. SIAM J. Disc. Math.\u00a07, 667\u2013679 (1994)","journal-title":"SIAM J. Disc. Math."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 480\u2013490. Springer, Heidelberg (1994)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s001459900031","volume":"10","author":"W.-A. Jackson","year":"1997","unstructured":"Jackson, W.-A., Martin, K., O\u2019keefe, C.M.: Mutually trusted authority free secret sharing schemes. J. Cryptology\u00a010, 261\u2013289 (1997)","journal-title":"J. Cryptology"},{"key":"28_CR14","volume-title":"Data Structures and Algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms, vol.\u00a01. Springer, Heidelberg (1984)"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr.\u00a02, 357\u2013390 (1992)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10718964_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T15:19:06Z","timestamp":1587309546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10718964_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677420","9783540450306"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/10718964_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}