Improved Garbled Circuit: Free XOR Gates and Applications

DOI10.1007/978-3-540-70583-3_40zbMath1155.94374MaRDI QIDQ3519525

Thomas Schneider, Vladimir Kolesnikov

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://encrypto.de/papers/KS08XOR.pdf

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Garbled Circuits as Randomized Encodings of Functions: a Primer, Faster Secure Two-Party Computation in the Single-Execution Setting, Non-interactive Secure 2PC in the Offline/Online and Batch Settings, Hashing Garbled Circuits for Free, TinyKeys: a new approach to efficient multi-party computation, Public-Seed Pseudorandom Permutations, Block cipher invariants as eigenvectors of correlation matrices, On the exact round complexity of secure three-party computation, Dispelling myths on superposition attacks: formal security model and attack analyses, Low cost constant round MPC combining BMR and oblivious transfer, SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates, Actively secure garbled circuits with constant communication overhead in the plain model, High-throughput secure three-party computation with an honest majority, Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation, Faster Privacy-Preserving Location Proximity Schemes, Private evaluation of a decision tree based on secret sharing, Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic, Breaking and fixing garbled circuits when a gate has duplicate input wires, On various nonlinearity measures for Boolean functions, Garbling XOR gates ``for free in the standard model, Exploring crypto dark matter: new simple PRF candidates and their applications, Practical attacks against the walnut digital signature scheme, An efficient structural attack on NIST submission DAGS, On compiling Boolean circuits optimized for secure multi-party computation, Multiplicative complexity of vector valued Boolean functions, On multiparty garbling of arithmetic circuits, Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free, Concretely efficient large-scale MPC with active security (or tinykeys for tinyot), The multiplicative complexity of 6-variable Boolean functions, Secure two-party computation via cut-and-choose oblivious transfer, Boolean functions with multiplicative complexity 3 and 4, High-performance multi-party computation for binary circuits based on oblivious transfer, Stacked garbling for disjunctive zero-knowledge proofs, \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation, Large scale, actively secure computation from LPN and free-XOR garbled circuits, Threshold garbled circuits and ad hoc secure computation, On the decision tree complexity of threshold functions, Efficient constant-round MPC with identifiable abort and public verifiability, Stacked garbling. Garbled circuit proportional to longest execution path, Better concrete security for half-gates garbling (in the multi-instance setting), The price of active security in cryptographic protocols, Three halves make a whole? Beating the half-gates lower bound for garbled circuits, Threshold Schnorr with stateless deterministic signing from standard assumptions, Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact, Full-threshold actively-secure multiparty arithmetic circuit garbling, Optimizing registration based encryption, A simple post-quantum non-interactive zero-knowledge proof from garbled circuits, Adaptive security of practical garbling schemes, Differential uniformity and linearity of S-boxes by multiplicative complexity, \textsc{EpiGRAM}: practical garbled RAM, Garbled circuits with sublinear evaluator, Distributed (correlation) samplers: how to remove a trusted dealer in one round, Upper bounds on the multiplicative complexity of symmetric Boolean functions, Efficient and scalable universal circuits, A single shuffle is enough for secure card-based computation of any Boolean circuit, Secure two-party computation in a quantum world, Logic minimization techniques with applications to cryptology, More efficient oblivious transfer extensions, Fast garbling of circuits under standard assumptions, New cryptanalysis of LowMC with algebraic techniques, Network Oblivious Transfer, Linicrypt: A Model for Practical Cryptography, Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials, Encryption Switching Protocols, How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes, Secure Multi-party Computation: Information Flow of Outputs and Game Theory

Cites Work