{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T10:56:35Z","timestamp":1769684195900,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1007\/bf01388382","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T03:37:09Z","timestamp":1112413029000},"page":"183-187","source":"Crossref","is-referenced-by-count":55,"title":["A perfect threshold secret sharing scheme to identify cheaters"],"prefix":"10.1007","volume":"5","author":[{"given":"Marco","family":"Carpentieri","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","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."},{"key":"CR2","unstructured":"G. R. Blakley, Safeguarding cryptographic keys,Proceedings AFIPS 1979 National Computer Conference, (1979) pp. 313?317."},{"key":"CR3","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":"CR4","series-title":"Lectures Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-46766-1_7","volume-title":"Advances in Cryptology?CRYPTO'91","author":"R. M. Capocelli","year":"1992","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes,Advances in Cryptology?CRYPTO'91 (J. Feigenbaum, ed.), Lectures Notes in Computer Science, Springer-Verlag, New York, 576 (1992) pp. 101?113. Also to appear inJournal of Cryptology."},{"key":"CR5","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, New York, to appear."},{"key":"CR6","volume-title":"Cryptography and Data Security","author":"D. Denning","year":"1983","unstructured":"D. Denning,Cryptography and Data Security, Addison-Wesley, Reading, MA (1983)."},{"key":"CR7","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 Trans. on Inform. Theory, Vol. IT-29 (1983) pp. 35?41.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"CR8","volume-title":"Elements of Algebra and Algebraic Computing","author":"J. D. Lipson","year":"1981","unstructured":"J. D. Lipson,Elements of Algebra and Algebraic Computing, Addison-Wesley, Reading, MA (1981)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes,Communications of the ACM, Vol. 24 (1981) pp. 583?584","journal-title":"Communications of the ACM"},{"key":"CR10","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,Communication of the ACM, Vol. 22 (1979) pp. 612?613.","journal-title":"Communication of the ACM"},{"key":"CR11","first-page":"215","volume":"68","author":"G. Simmons","year":"1989","unstructured":"G. Simmons, Robust shared secret schemes or ?How to be sure you have the right answer even though you do not know the question?,Congr. Numer., Vol. 68 (1989) pp. 215?248.","journal-title":"Congr. Numer."},{"key":"CR12","unstructured":"G. J. Simmons, An introduction to shared secret and\/or shared control schemes and their application,Contemporary Cryptology, IEEE Press (1991) pp. 441?497."},{"key":"CR13","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":"CR14","unstructured":"D. R. Stinson,Decomposition Constructions for Secret Sharing Schemes, Technical Report UNL-CSE-92-020, Department of Computer Science and Engineering, University of Nebraska, September 1992."},{"key":"CR15","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.Journal of Cryptology, Vol. 1 (1988) pp. 133?139.","journal-title":"Journal of Cryptology"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388382\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388382.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388382\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:14:18Z","timestamp":1556799258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["BF01388382"],"URL":"https:\/\/doi.org\/10.1007\/bf01388382","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}