Garbling XOR gates ``for free in the standard model
From MaRDI portal
Publication:315547
DOI10.1007/S00145-015-9201-9zbMATH Open1348.94030OpenAlexW2073772025MaRDI QIDQ315547FDOQ315547
Authors: Benny Applebaum 
Publication date: 21 September 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.5469
Recommendations
Cites Work
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- A proof of security of Yao's protocol for two-party computation
- The random oracle methodology, revisited.
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Improved Garbled Circuit: Free XOR Gates and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-output secure computation with malicious adversaries
- Circular-Secure Encryption from Decision Diffie-Hellman
- LEGO for Two-Party Secure Computation
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computationally private randomizing polynomials and their applications
- On the security of the ``Free-XOR technique
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- How to Encrypt with the LPN Problem
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Pseudorandom functions and permutations provably secure against related-key attacks
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Secure two-party computation is practical
- Title not available (Why is that?)
- On the Existence of Pseudorandom Generators
- Title not available (Why is that?)
- Encryption Schemes Secure under Related-Key and Key-Dependent Message Attacks
- How to Garble Arithmetic Circuits
- Noise-tolerant learning, the parity problem, and the statistical query model
Cited In (6)
- The hardness of LPN over any integer ring and field for PCG applications
- Garbling XOR gates ``for free in the standard model
- TinyKeys: a new approach to efficient multi-party computation
- How to garble mixed circuits that combine Boolean and arithmetic computations
- On the security of the ``Free-XOR technique
- Improved Garbled Circuit: Free XOR Gates and Applications
Uses Software
This page was built for publication: Garbling XOR gates ``for free in the standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315547)
