Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
type: Item
instance of: scholarly article
title: Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
zbMATH Open document ID: 1447.94050
DOI: 10.1007/978-3-030-03332-3_2
author: Vladimir Kolesnikov
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7005633
MaRDI profile type: Publication
full work available at URL: 978-3-030-03332-3 2
OpenAlex ID: W2898314371
cites work: More efficient universal circuit constructions
cites work: Software protection and simulation on oblivious RAMs
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Overlaying conditional circuit clauses for secure computation
cites work: FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
cites work: Valiant’s Universal Circuit is Practical
cites work: A proof of security of Yao's protocol for two-party computation
cites work: How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
cites work: Universal circuits (Preliminary Report)
cites work: Two Halves Make a Whole
description: scientific article; zbMATH DE number 7005633