{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:05Z","timestamp":1754161565045,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1023\/a:1008378426278","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"75-85","source":"Crossref","is-referenced-by-count":19,"title":["Detection of Cheaters in Vector Space Secret Sharing Schemes"],"prefix":"10.1007","volume":"16","author":[{"given":"Carles","family":"Padro","sequence":"first","affiliation":[]},{"given":"Germ\u00e1n","family":"S\u00e1ez","sequence":"additional","affiliation":[]},{"given":"Jorge Luis","family":"Villar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"189032_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or and T. Rabin, Verifiable secret sharing and multiparty protocols with honest majority, Proc. 21st ACM Symposium on Theory of Computing, (1989) pp. 73-85.","DOI":"10.1145\/73007.73014"},{"key":"189032_CR2","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, AFIPS Conference Proceedings, Vol. 48 (1979) pp. 313-317.","journal-title":"AFIPS Conference Proceedings"},{"key":"189032_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48071-4_11","volume-title":"Advances in Cryptology CRYPTO'92","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, Advances in Cryptology CRYPTO'92 (E.F. Brickell, ed.) Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 740 (1993) pp. 148-167."},{"key":"189032_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C. Blundo","year":"1995","unstructured":"C. Blundo, A. De Santis, D.R. Stinson and U. Vaccaro, Graph Decompositions and Secret Sharing Schemes, J. Cryptology, Vol. 8 (1995) pp. 39-64.","journal-title":"J. Cryptology"},{"key":"189032_CR5","first-page":"105","volume":"9","author":"E.F. Brickell","year":"1989","unstructured":"E.F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. and Combin. Comput., Vol. 9 (1989) pp. 105-113.","journal-title":"J. Combin. Math. and Combin. Comput."},{"key":"189032_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol. 4 (1991) pp. 123-134.","journal-title":"J. Cryptology"},{"key":"189032_CR7","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0404044","volume":"4","author":"E.F. Brickell","year":"1991","unstructured":"E.F. Brickell and D.R. Stinson, The detection of cheaters in threshold schemes, SIAM J. Disc. Math., Vol. 4 (1991) pp. 502-510.","journal-title":"SIAM J. Disc. Math."},{"key":"189032_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R. M. Capocelli","year":"1993","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, On the Size of Shares of Secret Sharing Schemes, J. Cryptology, Vol. 6 (1993) pp. 157-168.","journal-title":"J. Cryptology"},{"key":"189032_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01388382","volume":"5","author":"M. Carpentieri","year":"1995","unstructured":"M. Carpentieri, A perfect threshold secret sharing scheme to identify cheaters, Designs, Codes and Cryptography, Vol. 5 (1995) pp. 183-187.","journal-title":"Designs, Codes and Cryptography"},{"key":"189032_CR10","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'93","author":"M. Carpentieri","year":"1994","unstructured":"M. Carpentieri, A. De Santis and U. Vaccaro, Size of shares and probability of cheating in threshold schemes, Advances in Cryptology, EUROCRYPT'93 (T. Helleseth, ed.) Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 765 (1994) pp. 118-125."},{"key":"189032_CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W.A. Jackson","year":"1994","unstructured":"W.A. Jackson and K.M. Martin, Geometric Secret Sharing Schemes and Their Duals, Designs, Codes and Cryptography, Vol. 4 (1994) pp. 83-95.","journal-title":"Designs, Codes and Cryptography"},{"key":"189032_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E.D. Karnin","year":"1983","unstructured":"E.D. Karnin, J.W. Greene and M.E. Hellman, On secret sharing systems, IEEE Transactions on Information Theory, Vol. 29 (1983) pp. 35-41.","journal-title":"IEEE Transactions on Information Theory"},{"key":"189032_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-68339-9_18","volume-title":"Advances in Cryptology, EUROCRYPT'96","author":"W. Ogata","year":"1996","unstructured":"W. Ogata and K. Kurosawa, Optimum Secret Sharing Scheme Secure against Cheating, Advances in Cryptology, EUROCRYPT'96(U. Maurer, ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 1070 (1996) pp. 200-211."},{"key":"189032_CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01388483","volume":"3","author":"J. Rif\u00e0-Coma","year":"1993","unstructured":"J. Rif\u00e0-Coma, How to avoid cheaters succeeding in the key sharing scheme, Designs, Codes and Cryptography, Vol. 3 (1993) pp. 221-228.","journal-title":"Designs, Codes and Cryptography"},{"key":"189032_CR15","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Commun. of the ACM, Vol. 22 (1979) pp. 612-613.","journal-title":"Commun. of the ACM"},{"key":"189032_CR16","series-title":"Lecture Notes in Computer Science","first-page":"390","volume-title":"Advances in Cryptology-CRYPTO'88","author":"G.J. Simmons","year":"1989","unstructured":"G.J. Simmons, How to (really) share a secret, Advances in Cryptology-CRYPTO'88 (S. Goldwasser, ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 403 (1989) pp. 390-448."},{"key":"189032_CR17","first-page":"441","volume-title":"Contemporary Cryptology: The Science of Information Integrity","author":"G.J. Simmons","year":"1992","unstructured":"G.J. Simmons, An introduction to shared secret and\/or shared control schemes and their applications, Contemporary Cryptology: The Science of Information Integrity (G.J. Simmons, ed.), Piscataway, N.J., IEEE Press, (1992) pp. 441-497."},{"key":"189032_CR18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D.R. Stinson","year":"1992","unstructured":"D.R. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography, Vol. 2 (1992) pp. 357-390.","journal-title":"Designs, Codes and Cryptography"},{"key":"189032_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M. Tompa","year":"1988","unstructured":"M. Tompa and H. Woll, How to share a secret with cheaters, J. Cryptology, Vol. 1 (1988) pp. 133-139.","journal-title":"J. Cryptology"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008378426278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008378426278\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008378426278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:17:39Z","timestamp":1753759059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008378426278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["189032"],"URL":"https:\/\/doi.org\/10.1023\/a:1008378426278","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}