Privacy-free garbled circuits with applications to efficient zero-knowledge

DOI10.1007/978-3-662-46803-6_7zbMATH Open1371.94634OpenAlexW2173120240MaRDI QIDQ2948383FDOQ2948383

Jesper Buus Nielsen, Tore Kasper Frederiksen, Claudio Orlandi

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

Recommendations

• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Improvements for gate-hiding garbled circuits
• On garbling schemes with and without privacy
• Efficient adaptively secure zero-knowledge from garbled circuits
• Zero-knowledge proofs from secure multiparty computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (27)

• Cross and Clean: Amortized Garbled Circuits with Constant Overhead
• Efficient adaptively secure zero-knowledge from garbled circuits
• Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• On the exact round complexity of secure three-party computation
• Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
• PrORAM
• Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn
• Title not available (Why is that?)
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Sok: vector OLE-based zero-knowledge protocols
• Garbled circuits with sublinear evaluator
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• Stacked garbling for disjunctive zero-knowledge proofs
• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Stacked garbling. Garbled circuit proportional to longest execution path
• More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
• A new approach to garbled circuits
• Succinct computational secret sharing
• Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
• Encryption Switching Protocols
• Minimizing locality of one-way functions via semi-private randomized encodings
• On Garbling Schemes with and Without Privacy
• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
• Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)

This page was built for publication: Privacy-free garbled circuits with applications to efficient zero-knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948383)