{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T16:28:55Z","timestamp":1749745735611,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9,9]]},"DOI":"10.1109\/iscisc51277.2020.9261914","type":"proceedings-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T00:02:15Z","timestamp":1606176135000},"page":"7-13","source":"Crossref","is-referenced-by-count":2,"title":["A fast non-interactive publicly verifiable secret sharing scheme"],"prefix":"10.1109","author":[{"given":"Shahrooz","family":"Janbaz","sequence":"first","affiliation":[]},{"given":"Rahim","family":"Asghari","sequence":"additional","affiliation":[]},{"given":"Bagher","family":"Bagherpour","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Zaghian","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/902462"},{"key":"ref11","first-page":"294","article-title":"Public verifiability of pairings in secret sharing schemes","author":"heidarvand","year":"2008","journal-title":"SAC 2008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_27"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.05.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9952-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21031-0_21"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.09.040"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.10.040"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48071-4_9"},{"key":"ref19","first-page":"223","article-title":"Public key cryptosystems based on composite degree residuosity classes","author":"paillier","year":"1990","journal-title":"EUROCRYPT’99"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref3","first-page":"367","author":"biggs","year":"1989","journal-title":"Discrete Mathematics"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"2262","DOI":"10.1016\/j.ins.2007.11.031","article-title":"New efficient and practical verifiable multi-secret sharing schemes","volume":"178","author":"dehkordi","year":"2008","journal-title":"Information Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2007.08.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2018.5167"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","article-title":"How to prove yourself: practical solutions to identification and signature problems","volume":"263","author":"fiat","year":"1986","journal-title":"Advances in Cryptology Lecture Notes in Computer Science"},{"key":"ref1","first-page":"79","article-title":"A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions","volume":"12","author":"zaghian","year":"2020","journal-title":"ISC International Journal of Information Security"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref21","first-page":"98","article-title":"Publicly verifiable secret sharing from pailliers cryptosystem","volume":"lni p 74","author":"ruiz","year":"2005","journal-title":"WEWORC 2005"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_17"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_10"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-011-8408-6"},{"journal-title":"Cryptography Theory and Practice","year":"2019","author":"stinson","key":"ref25"}],"event":{"name":"2020 17th International ISC Conference on Information Security and Cryptology (ISCISC)","start":{"date-parts":[[2020,9,9]]},"location":"Tehran, Iran","end":{"date-parts":[[2020,9,10]]}},"container-title":["2020 17th International ISC Conference on Information Security and Cryptology (ISCISC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9261900\/9261901\/09261914.pdf?arnumber=9261914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:54:35Z","timestamp":1656453275000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9261914\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,9]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/iscisc51277.2020.9261914","relation":{},"subject":[],"published":{"date-parts":[[2020,9,9]]}}}