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

DOI10.1007/978-3-662-46803-6_7MaRDI QIDQ2948383zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(34)

• Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
• Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits
• Efficient adaptively secure zero-knowledge from garbled circuits
• 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
• Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
• Improvements for gate-hiding garbled circuits
• On the exact round complexity of secure three-party computation
• PrORAM
• Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn
• scientific article; zbMATH DE number 1676657 (Why is no real title available?)
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Sok: vector OLE-based zero-knowledge protocols
• Efficient garbled pseudorandom functions and lookup tables from minimal assumption
• Encryption switching 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
• Lower bounds for garbled circuits from Shannon-type information inequalities
• Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
• Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
• Stacked garbling. Garbled circuit proportional to longest execution path
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• On garbling schemes with and without privacy
• Cross and clean: amortized garbled circuits with constant overhead
• A new approach to garbled circuits
• More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
• Succinct computational secret sharing
• Minimizing locality of one-way functions via semi-private randomized encodings
• Hybrid zero-knowledge from garbled circuits and circuit-based composition of -protocols
• Hybrid zero-knowledge from garbled circuits
• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits

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)