{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:53:08Z","timestamp":1769719988153,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338512","type":"print"},{"value":"9783540338529","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11745853_6","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"75-90","source":"Crossref","is-referenced-by-count":36,"title":["Linear Integer Secret Sharing and Distributed Exponentiation"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Rune","family":"Thorbek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","first-page":"27","volume-title":"Advances in Cryptology - CRYPTO 1988","author":"J.C. Benaloh","year":"1988","unstructured":"Benaloh, J.C., Leichter, J.: Generalized Secret Sharing and Monotone Functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1988)"},{"key":"6_CR2","first-page":"27","volume":"5","author":"R.B. Boppana","year":"1989","unstructured":"Boppana, R.B.: Amplification of Probabilistic Boolean Formulas. Advances in Computing Research\u00a05, 27\u201345 (1989)","journal-title":"Advances in Computing Research"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jcss.1997.1287","volume":"54","author":"J. Radhakrishnan","year":"1997","unstructured":"Radhakrishnan, J.: Better Lower Bounds for Monotone Threshold Formulas. J. Comput. Syst. Sci.\u00a054(2), 221\u2013226 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02620136","volume":"6","author":"B. Chor","year":"1993","unstructured":"Chor, B., Kushilevitz, E.: Secret Sharing Over Infinite Domains. J. Cryptology\u00a06(2), 87\u201395 (1993)","journal-title":"J. Cryptology"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/S0097539791194999","volume":"24","author":"B. Chor","year":"1995","unstructured":"Chor, B., Ger\u00e9b-Graus, M., Kushilevitz, E.: Private Computations over the Integers. SIAM J. Comput.\u00a024(2), 376\u2013386 (1995)","journal-title":"SIAM J. Comput."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24638-1_13","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2004","unstructured":"Cramer, R., Damg\u00e5rd, I.B.: Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 223\u2013237. Springer, Heidelberg (2004)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45708-9_18","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Fehr, S.: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 272\u2013287. Springer, Heidelberg (2002)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/11535218_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Fehr, S., Stam, M.: Black-Box Secret Sharing from Primitve Sets in Algebraic Number Fields. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 344\u2013360. Springer, Heidelberg (2005)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-30580-4_24","volume-title":"Public Key Cryptography - PKC 2005","author":"I. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Dupont, K.: Efficient threshold RSA signatures with general moduli and no extra assumptions. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 346\u2013361. Springer, Heidelberg (2005)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11681878_3","volume-title":"Theory of Cryptography","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Fazio, N., Nicolosi, A.: Non-Interactive Zero-Knowledge Proofs from Homomorphic Encryption. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 41\u201359. Springer, Heidelberg (2006)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-44987-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"I.B. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I.B., Koprowski, M.: Practical Threshold RSA Signatures without a Trusted Dealer. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 152\u2013165. Springer, Heidelberg (2001)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y., Frankel, Y.: Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group. SIAM J. Discrete Math.\u00a07(4), 667\u2013679 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR14","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation (full version), the Eprint archive, \n                    \n                      http:\/\/www.iacr.org"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal Resilience Proactive Public-Key Cryptosystems. In: FOCS 1997, pp. 384\u2013393 (1997)","DOI":"10.1109\/SFCS.1997.646127"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s001459910011","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R., Rabin, T., Jarecki, S., Krawczyk, H.: Robust and Efficient Sharing of RSA Functions. J. Cryptology\u00a013(2), 273\u2013300 (2000)","journal-title":"J. Cryptology"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM\u00a038(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Advances in Cryptology - CRYPTO 1998","author":"T. Rabin","year":"1998","unstructured":"Rabin, T.: A Simplified Approach to Threshold and Proactive RSA. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 89\u2013104. Springer, Heidelberg (1998)"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Efficient Signature Generation by Smart Cards. J. Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"issue":"11","key":"6_CR20","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. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: STOC 1994, pp. 522\u2013533 (1994)","DOI":"10.1145\/195058.195405"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 207\u2013220. Springer, Heidelberg (2000)"},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","volume":"5","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: Short Monotone Formulae for the Majority Function. J. Algorithms\u00a05(3), 363\u2013366 (1984)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T04:12:18Z","timestamp":1552363938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11745853_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}