Stacked garbling. Garbled circuit proportional to longest execution path
type: Item
instance of: scholarly article
title: Stacked garbling. Garbled circuit proportional to longest execution path
DOI: 10.1007/978-3-030-56880-1_27
author: Vladimir Kolesnikov
author: David G. Heath
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614587
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 27
OpenAlex ID: W4245814547
cites work: On the Security of the “Free-XOR” Technique
cites work: A minimal model for secure computation (extended abstract)
cites work: Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
cites work: More efficient universal circuit constructions
cites work: Fast garbling of circuits under standard assumptions
cites work: Stacked garbling for disjunctive zero-knowledge proofs
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: Advances in Cryptology – CRYPTO 2004
cites work: Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: Valiant’s Universal Circuit is Practical
cites work: Secure Two-Party Computation Is Practical
cites work: Universal circuits (Preliminary Report)
cites work: Two Halves Make a Whole
cites work: Valiant's universal circuits revisited: an overall improvement and a lower bound
description: scientific article; zbMATH DE number 7614587