{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:19:44Z","timestamp":1742984384011,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642111440"},{"type":"electronic","value":"9783642111457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11145-7_34","type":"book-chapter","created":{"date-parts":[[2010,1,13]],"date-time":"2010-01-13T08:23:04Z","timestamp":1263370984000},"page":"439-448","source":"Crossref","is-referenced-by-count":5,"title":["Proactive Verifiable Linear Integer Secret Sharing Scheme"],"prefix":"10.1007","author":[{"given":"Chuangui","family":"Ma","sequence":"first","affiliation":[]},{"given":"Xiaofei","family":"Ding","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Blackley, G.R.: Safeguarding cryptographic keys. In: AFIPS 1979, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"11","key":"34_CR2","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":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11745853_6","volume-title":"Public Key Cryptography - PKC 2006","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damgard, I., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 75\u201390. Springer, Heidelberg (2006)"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J.C. Benaloh","year":"1990","unstructured":"Benaloh, J.C., Leichter, J.: Generalizad Secret Sharing and Monotone Functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"34_CR5","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":"34_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Kushilevitz, E.: Secret Sharing Over Infinite Domains. In: Cryptology 1993, vol.\u00a06(2), pp. 87\u201395 (1993)","DOI":"10.1007\/BF02620136"},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/S0097539791194999","volume":"24","author":"B. Chor","year":"1995","unstructured":"Chor, B., Mih\u00e1ly Ger\u00e9b, G., Kushilevitz, E.: Private Computations over the Intergers. SIAM J. Comput.\u00a024(2), 376\u2013386 (1995)","journal-title":"SIAM J. Comput."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: ACM Symposium on principles of distributed computing 1991, pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A Practical Scheme of Non-Interactive Verifiable Secret sharing. In: 28th Annual Symp. on the Foundations of Computing Science 1987, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"34_CR12","unstructured":"Rees, R.S., Stinson, D.R., Wei, R., Rees, G.H.J.V.: An application of covering designs:determining the maximum consistent set of shares in a threshold scheme. In: Ars Combinatoria 1999. LNCS, vol. 531, pp. 225\u2013237. Springer, Heidelberg (1999)"},{"key":"34_CR13","unstructured":"Damgard, I., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation(full version). The Eprint archive, http:\/\/www.iacr.org"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46513-8_15","volume-title":"Selected Areas in Cryptography","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R.: Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 200\u2013214. Springer, Heidelberg (2000)"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/3-540-60313-1_168","volume-title":"Algorithms - ESA \u201995","author":"N. Alon","year":"1995","unstructured":"Alon, N., Gail, Z., Yung, M.: Efficient dynamic-resharing \u201cverfiable secret sharing\u201d against mobile adversary. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 523\u2013537. Springer, Heidelberg (1995)"},{"key":"34_CR16","unstructured":"Boppana, R.B.: Amplification of Probabilistic Boolean Formulas. In: Advances in Computing Research 1989, pp. 27\u201345 (1989)"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Santis, A.D., 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":"34_CR18","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)"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/jcd.3180030404","volume":"3","author":"D.M. Gordon","year":"1995","unstructured":"Gordon, D.M., Kuperberg, G., Patashnik, O.: New constructions for covering design. J. Combin. Designs\u00a03, 269\u2013284 (1995)","journal-title":"J. Combin. Designs"},{"key":"34_CR20","volume-title":"Cryptography Theory and Practice","author":"D.R. Stinson","year":"1995","unstructured":"Stinson, D.R.: Cryptography Theory and Practice. CRC Press, Inc., Boca Raton (1995)"},{"key":"34_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/10718964_27","volume-title":"Information Security and Privacy","author":"H. Ghodosi","year":"2000","unstructured":"Ghodosi, H., Pieprzyk, J.: Cheating Prenvention in Secret Sharing. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol.\u00a01841, pp. 328\u2013341. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11145-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T17:52:44Z","timestamp":1739728364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11145-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642111440","9783642111457"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11145-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}