{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:50:31Z","timestamp":1755838231673,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/icccn.2011.6005766","type":"proceedings-article","created":{"date-parts":[[2011,9,12]],"date-time":"2011-09-12T19:33:30Z","timestamp":1315856010000},"page":"1-6","source":"Crossref","is-referenced-by-count":9,"title":["A New Approach to Weighted Multi-Secret Sharing"],"prefix":"10.1109","author":[{"given":"Xukai","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Maino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisa","family":"Bertino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Sui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-45664-3_14","article-title":"On the security of the threshold scheme based on the chinese remainder theorem","volume":"2274","author":"quisquater","year":"2002","journal-title":"Lecture Notes in Computer Science"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISECS.2008.60"},{"key":"18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","article-title":"Non-interactive and information theoretic secure verifiable secret sharing","volume":"576","author":"pedersen","year":"1992","journal-title":"Lecture Notes in Computer Science"},{"key":"15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-48970-3_15","article-title":"Changing thresholds in the absence of secure channels","volume":"1587","author":"martin","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39466-4_27"},{"key":"13","first-page":"161","article-title":"Weighted threshold secret sharing based on the chinese remainder theorem","author":"iftene","year":"2005","journal-title":"Computer Science Section"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46877-3_24"},{"key":"11","first-page":"196","article-title":"A generalization of mignotte's secret sharing scheme","author":"iftene","year":"2004","journal-title":"Proceedings of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.01.065"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2005.04.007"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899541"},{"journal-title":"Cryptography Theory and Practice","year":"1995","author":"stinson","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0334-8"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_25"},{"key":"3","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/978-3-540-30576-7_32","article-title":"Characterizing ideal weighted threshold secret sharing","volume":"3378","author":"beimel","year":"2005","journal-title":"Lecture Notes in Comput Sci"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1504\/IJSN.2009.028667"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1049\/el:19941076"},{"journal-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"aho","key":"1"},{"key":"7","first-page":"699","article-title":"Communication complexity of secure computation","author":"franklin","year":"1992","journal-title":"STOC"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"5","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"American Federation of Information Processing Societies Proceedings"},{"key":"4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","article-title":"Generalized secret sharing and monotone functions","volume":"403","author":"benaloh","year":"1989","journal-title":"Lecture Notes in Computer Science"},{"key":"9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0053748","article-title":"Secret Sharing in Multilevel and Compartmented Groups","author":"ghodosi","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"Theory and Practice of Verifiable Secret Sharing","year":"1995","author":"gennaro","key":"8"}],"event":{"name":"2011 20th International Conference on Computer Communications and Networks - ICCCN 2011","start":{"date-parts":[[2011,7,31]]},"location":"Lahaina, HI, USA","end":{"date-parts":[[2011,8,4]]}},"container-title":["2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6005186\/6005707\/06005766.pdf?arnumber=6005766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T06:12:18Z","timestamp":1497939138000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6005766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icccn.2011.6005766","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}