Privacy-free garbled circuits for formulas: size zero and information-theoretic
type: Item
instance of: scholarly article
title: Privacy-free garbled circuits for formulas: size zero and information-theoretic
zbMATH Open document ID: 1407.94131
DOI: 10.1007/978-3-319-63688-7_7
author: Yashvanth Kondi
author: Arpita Patra
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6802613
zbMATH Keywords: garbled circuits
zbMATH Keywords: privacy-free
zbMATH Keywords: formula
zbMATH Keywords: information-theoretic
zbMATH Keywords: authenticity
MaRDI profile type: Publication
full work available at URL: 978-3-319-63688-7 7
OpenAlex ID: W2724596564
Recommended article: Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
Recommended article: On Garbling Schemes with and Without Privacy
Recommended article: Efficient adaptively secure zero-knowledge from garbled circuits
Recommended article: Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
Recommended article: On multiparty garbling of arithmetic circuits
Recommended article: Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
Recommended article: Threshold garbled circuits and ad hoc secure computation
Recommended article: Reusable garbled circuits and succinct functional encryption
Recommended article: Characterizing linear size circuits in terms of privacy
description: scientific article; zbMATH DE number 6802613