{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:40:00Z","timestamp":1780069200138,"version":"3.54.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/tit.2018.2886262","type":"journal-article","created":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T15:06:56Z","timestamp":1544540816000},"page":"3233-3245","source":"Crossref","is-referenced-by-count":14,"title":["Verifiably Multiplicative Secret Sharing"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1267-0058","authenticated-orcid":false,"given":"Maki","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4795-4779","authenticated-orcid":false,"given":"Satoshi","family":"Obana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref31","first-page":"172","article-title":"Robust computational secret sharing and a unified account of classical secret-sharing goals","author":"bellare","year":"2007","journal-title":"Proc 14th ACM Conf Comput Commun Secur"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"ref36","article-title":"Flaws in a verifiably multiplicative secret sharing scheme from ICITS 2017","author":"yoshida","year":"2018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72089-0_5"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E98.A.767"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48321-7_14"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_17"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129780"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380853"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"ref17","first-page":"218","article-title":"How to play any mental game or a completeness theorem for protocols with honest majority","author":"goldwasser","year":"1987","journal-title":"Proc 19th Annu ACM Symp Theory Comput"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42045-0_10"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_41"},{"key":"ref4","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc Nat Comput Conf"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9056-z"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref8","first-page":"118","article-title":"Size of shares and probability of cheating in threshold schemes","volume":"765","author":"carpentieri","year":"1993","journal-title":"Proc Workshop Theory Appl Cryptograph Techn"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.15"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_22"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"ref20","first-page":"99","article-title":"Secret sharing scheme realizing general access structure","author":"ito","year":"1987","journal-title":"Proc IEEE Global Telecommun Conf (GLOBECOM)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892118"},{"key":"ref24","article-title":"Finite field","author":"lidl","year":"1997","journal-title":"Encyclopedia Math Appl"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.45288"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36413-7_2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907505"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8694135\/08572752.pdf?arnumber=8572752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:36:36Z","timestamp":1641987396000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8572752\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":36,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2886262","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5]]}}}