{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:54:10Z","timestamp":1781078050611,"version":"3.54.1"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>To what extent can a computation be made &amp;ldquo;simpler&amp;rdquo; by settling for computing a randomized encoding of the output? Originating from Yao's seminal idea of garbled circuits, answers to this question have found applications in cryptography and elsewhere. We will survey the state of the art on different flavors of this question that are motivated by different problems in secure computation and correspond to different notions of simplicity.<\/jats:p>","DOI":"10.3233\/978-1-61499-169-4-222","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T09:38:17Z","timestamp":1740044297000},"source":"Crossref","is-referenced-by-count":4,"title":["Randomization Techniques for Secure Computation"],"prefix":"10.3233","author":[{"family":"Ishai Yuval","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"7437","container-title":["Cryptology and Information Security Series","Secure Multi-Party Computation"],"original-title":[],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T09:43:24Z","timestamp":1740044604000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=1871-6431&volume=10&spage=222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-169-4-222","relation":{},"ISSN":["1871-6431"],"issn-type":[{"value":"1871-6431","type":"print"}],"subject":[],"published":{"date-parts":[[2013]]}}}