Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
From MaRDI portal
Publication:2948383
DOI10.1007/978-3-662-46803-6_7zbMath1371.94634OpenAlexW2173120240MaRDI QIDQ2948383
Jesper Buus Nielsen, Claudio Orlandi, Tore Kasper Frederiksen
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2014/598.pdf
Related Items (17)
Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Garbled circuits with sublinear evaluator ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ PrORAM ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ Minimizing locality of one-way functions via semi-private randomized encodings ⋮ On the exact round complexity of secure three-party computation ⋮ Stacked garbling for disjunctive zero-knowledge proofs ⋮ On Garbling Schemes with and Without Privacy ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Encryption Switching Protocols ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
This page was built for publication: Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
