{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:17:24Z","timestamp":1773512244083,"version":"3.50.1"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Zero-knowledge proofs are proofs that are both convincing and yet yield nothing beyond the validity of the assertion being proved. Their direct applications in cryptography are numerous, where they are typically used to force malicious parties to behave according to a predetermined protocol. In addition, zero-knowledge proofs serve as an excellent bench-mark for the study of various problems regarding cryptographic protocols.<\/jats:p>","DOI":"10.3233\/978-1-61499-169-4-28","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":["A Short Tutorial of Zero-Knowledge"],"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:43:02Z","timestamp":1740044582000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=1871-6431&volume=10&spage=28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-169-4-28","relation":{},"ISSN":["1871-6431"],"issn-type":[{"value":"1871-6431","type":"print"}],"subject":[],"published":{"date-parts":[[2013]]}}}