Private Computations over the Integers

DOI10.1137/S0097539791194999zbMath0842.94010OpenAlexW2147263373MaRDI QIDQ4834387

Mihály Geréb-Graus, Benny Chor, Eyal Kushilevitz

Publication date: 27 June 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539791194999

zbMATH Keywords

communication complexityprivate Boolean functionprivate distributed computations of \(n\)-argument functions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Boolean functions (06E30) Information theory (general) (94A15)

Related Items (3)

Privacy in non-private environments ⋮ Characterizing linear size circuits in terms of privacy ⋮ On the structure of the privacy hierarchy

This page was built for publication: Private Computations over the Integers