{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:27Z","timestamp":1725475827340},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_27","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T16:04:09Z","timestamp":1167408249000},"page":"328-341","source":"Crossref","is-referenced-by-count":5,"title":["Cheating Prevention in Secret Sharing"],"prefix":"10.1007","author":[{"given":"Hossein","family":"Ghodosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"27_CR1","first-page":"133","volume":"1","author":"M. Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How To Share a Secret with Cheaters. Journal of Cryptology\u00a01(2), 133\u2013138 (1988)","journal-title":"Journal of Cryptology"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-48285-7_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M. Carpentieri","year":"1994","unstructured":"Carpentieri, M., Santis, A., Vaccaro, U.: Size of Shares and Probability of Cheating in Threshold Schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 118\u2013125. Springer, Heidelberg (1994)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"27_CR4","unstructured":"Chaum, D.: Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups, tech. rep., Memorandum No. UCB\/ERL M\/79\/10, University of California, Berkeley, CA (February 1979)"},{"key":"27_CR5","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":"27_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: 28th IEEE Symposium on Foundations of Computer Science, pp. 427\u2013437 (October 1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T. Pedersen","year":"1991","unstructured":"Pedersen, T.: A Threshold Cryptosystem without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Stadler","year":"1996","unstructured":"Stadler, M.: Publicly Verifiable Secret Sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of 21st ACM Symposium on Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01388382","volume":"5","author":"M. Carpentieri","year":"1995","unstructured":"Carpentieri, M.: A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography\u00a05(3), 183\u2013187 (1995)","journal-title":"Designs, Codes and Cryptography"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Advances in Cryptology","author":"G. Blakley","year":"1985","unstructured":"Blakley, G., Meadows, C.: Security Of Ramp Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 242\u2013268. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10718964_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T11:19:11Z","timestamp":1587295151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10718964_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677420","9783540450306"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/10718964_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}