Garbling XOR gates ``for free in the standard model
From MaRDI portal
Publication:315547
DOI10.1007/s00145-015-9201-9zbMath1348.94030OpenAlexW2073772025MaRDI QIDQ315547
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
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- Computationally private randomizing polynomials and their applications
- On the Security of the “Free-XOR” Technique
- Randomly Encoding Functions: A New Cryptographic Paradigm
- Two-Output Secure Computation with Malicious Adversaries
- The random oracle methodology, revisited
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Improved Garbled Circuit: Free XOR Gates and Applications
- 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
- Circular-Secure Encryption from Decision Diffie-Hellman
- LEGO for Two-Party Secure Computation
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Secure Two-Party Computation Is Practical
- A Pseudorandom Generator from any One-way Function
- On the Existence of Pseudorandom Generators
- Encryption Schemes Secure under Related-Key and Key-Dependent Message Attacks
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- How to Garble Arithmetic Circuits
- Noise-tolerant learning, the parity problem, and the statistical query model
