\textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
type: Item
instance of: scholarly article
title: \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
DOI: 10.1007/978-3-030-77883-5_1
author: Vladimir Kolesnikov
author: David G. Heath
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440632
zbMATH Keywords: 2PC
zbMATH Keywords: garbled circuits
zbMATH Keywords: conditional branching
zbMATH Keywords: stacked garbling
MaRDI profile type: Publication
full work available at URL: 978-3-030-77883-5 1
OpenAlex ID: W3170372235
cites work: Efficient and scalable universal circuits
cites work: On the Security of the “Free-XOR” Technique
cites work: More efficient universal circuit constructions
cites work: Fast garbling of circuits under standard assumptions
cites work: Stacked garbling. Garbled circuit proportional to longest execution path
cites work: Stacked garbling for disjunctive zero-knowledge proofs
cites work: Overlaying conditional circuit clauses for secure computation
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: 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 7440632