Garbling XOR gates ``for free in the standard model
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1263215 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- scientific article; zbMATH DE number 1418318 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A proof of security of Yao's protocol for two-party computation
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Circular-Secure Encryption from Decision Diffie-Hellman
- Computationally private randomizing polynomials and their applications
- Encryption schemes secure under related-key and key-dependent message attacks
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- How to Encrypt with the LPN Problem
- How to Garble Arithmetic Circuits
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Improved Garbled Circuit: Free XOR Gates and Applications
- LEGO for Two-Party Secure Computation
- Noise-tolerant learning, the parity problem, and the statistical query model
- On the Existence of Pseudorandom Generators
- On the security of the ``Free-XOR technique
- Pseudorandom functions and permutations provably secure against related-key attacks
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Secure two-party computation is practical
- The random oracle methodology, revisited.
- Two-output secure computation with malicious adversaries
Cited in
(9)- Flexor: Flexible garbling for XOR gates that beats free-XOR
- A new approach to garbled circuits
- The hardness of LPN over any integer ring and field for PCG applications
- On the security of the ``Free-XOR technique
- Garbling XOR gates ``for free in the standard model
- How to garble mixed circuits that combine Boolean and arithmetic computations
- TinyKeys: a new approach to efficient multi-party computation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Refuting the dream XOR lemma via ideal obfuscation and resettable MPC
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)
