Private Computations over the Integers

The subject of this work is the possibility of private distributed computations of $n$-argument functions defined over the integers. A function $f$ is $t$-private if there exists a protocol for computing $f$, so that no coalition of at most $t$ participants can infer any additional information from...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 24; no. 2; pp. 376 - 386
Main Authors:	Chor, Benny, Geréb-Graus, Mihály, Kushilevitz, Eyal
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1995
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Boolean Communication Computer science Computer science; control theory; systems Exact sciences and technology Logical, boolean and switching functions Privacy Protocol Theoretical computing Integer Addition Boolean function Computing Distributed computing Communication Complexity
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!