Characterizing linear size circuits in terms of privacy
type: Item
instance of: scholarly article
title: Characterizing linear size circuits in terms of privacy
zbMATH Open document ID: 0938.68048
author: Eyal Kushilevitz
author: Rafail Ostrovsky
author: Adi Rosén
published in: Journal of Computer and System Sciences
publication date: 1999-09-22T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1343332
zbMATH Keywords: complexity class
zbMATH Keywords: \(n\)-party private protocols
MaRDI profile type: Publication
full work available at URL: jcss.1997.1544
OpenAlex ID: W1988394435
cites work: A Boolean function requiring 3n network size
cites work: Q4385519
cites work: Randomness vs. fault-tolerance
cites work: A Zero-One Law for Boolean Privacy
cites work: Private Computations over the Integers
cites work: Randomness in private computations
cites work: Privacy and Communication Complexity
cites work: Q4940712
cites work: A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
cites work: A Mathematical Theory of Communication
DOI: 10.1006/JCSS.1997.1544
description: scientific article; zbMATH DE number 1343332