{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:48Z","timestamp":1766281008894,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/itw.2012.6404773","type":"proceedings-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T20:30:12Z","timestamp":1358454612000},"page":"99-103","source":"Crossref","is-referenced-by-count":8,"title":["On secure multiparty sampling for more than two parties"],"prefix":"10.1109","author":[{"given":"Manoj M.","family":"Prabhakaran","sequence":"first","affiliation":[]},{"given":"Vinod M.","family":"Prabhakaran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050832"},{"year":"0","key":"13"},{"key":"14","first-page":"73","article-title":"How to solve any protocol problem - An efficiency improvement","author":"goldreich","year":"1987","journal-title":"Crypto"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"12","first-page":"20","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"1988","journal-title":"STOC"},{"key":"3","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1145\/335305.335342","article-title":"More general completeness theorems for secure two-party computation","author":"kilian","year":"2000","journal-title":"STOC"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"journal-title":"Assisted Common Information with an Application to Secure Two-party Sampling","year":"2012","author":"prabhakaran","key":"1"},{"key":"10","first-page":"1782","article-title":"On unconditionally secure multi-party sampling from scratch","author":"wang","year":"2011","journal-title":"Proc IEEE International Symposium on Information Theory (ISIT)"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_15"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/0405021"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0150-y"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_16"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.3013"},{"key":"8","first-page":"256","article-title":"Complexity of multiparty computation problems: The case of 2-party symmetric secure function evaluation","volume":"5444","author":"maji","year":"2009","journal-title":"TCC"}],"event":{"name":"2012 IEEE Information Theory Workshop (ITW 2012)","start":{"date-parts":[[2012,9,3]]},"location":"Lausanne, Switzerland","end":{"date-parts":[[2012,9,7]]}},"container-title":["2012 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6389798\/6404631\/06404773.pdf?arnumber=6404773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T12:31:31Z","timestamp":1562589091000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6404773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2012.6404773","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}