{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:20:27Z","timestamp":1740115227165,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Most of this book has considered two-party and multiparty computation with security with (unfair) abort. This security notion allows the adversary to force the honest parties to abort even depending on the outputs of corrupted parties. (Note, however, that the adversary is not allowed to bias the output of honest parties in any other manner.) This relaxation of security is necessary if one wishes to tolerate arbitrarily many corruptions. A further relaxation considers computational security, where the adversary is assumed to be computationally bounded, e.g., probabilistic polynomial time. In this setting, any circuit can be securely realized even when arbitrarily many parties are corrupted, as long as one is willing to sacrifice fairness and robustness.<\/jats:p>","DOI":"10.3233\/978-1-61499-169-4-168","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T09:38:17Z","timestamp":1740044297000},"source":"Crossref","is-referenced-by-count":0,"title":["Information-Theoretic Secure Multiparty Computation"],"prefix":"10.3233","author":[{"family":"Maurer Ueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zikas Vassilis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"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:44:54Z","timestamp":1740044694000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=1871-6431&volume=10&spage=168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-169-4-168","relation":{},"ISSN":["1871-6431"],"issn-type":[{"value":"1871-6431","type":"print"}],"subject":[],"published":{"date-parts":[[2013]]}}}