{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:46:18Z","timestamp":1748994378998,"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>We survey basic definitions and results concerning secure multi-party computations, where the two-party case is an important special case. In a nutshell, these results assert that, under a variety of reasonable settings and\/or assumptions, it is possible to construct protocols for securely computing any desirable multi-party functionality. Confining ourselves to the very basics of this vast area of study, we focus on the stand-alone setting, while leaving the survey of the study of the security of concurrent executions to other surveys.<\/jats:p>","DOI":"10.3233\/978-1-61499-169-4-1","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T09:38:17Z","timestamp":1740044297000},"source":"Crossref","is-referenced-by-count":1,"title":["General Cryptographic Protocols: The Very Basics"],"prefix":"10.3233","author":[{"family":"Goldreich Oded","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:24Z","timestamp":1740044664000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=1871-6431&volume=10&spage=1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-169-4-1","relation":{},"ISSN":["1871-6431"],"issn-type":[{"value":"1871-6431","type":"print"}],"subject":[],"published":{"date-parts":[[2013]]}}}