Private Computations over the Integers
From MaRDI portal
Publication:4834387
DOI10.1137/S0097539791194999zbMath0842.94010MaRDI QIDQ4834387
Eyal Kushilevitz, Benny Chor, Mihály Geréb-Graus
Publication date: 27 June 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
communication complexity; private Boolean function; private distributed computations of \(n\)-argument functions
68R05: Combinatorics in computer science
94A60: Cryptography
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
06E30: Boolean functions
94A15: Information theory (general)
Related Items