%0 Conference Paper
%B INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies
%D 2004
%T Trust-preserving set operations
%A Morselli,R.
%A Bhattacharjee, Bobby
%A Katz, Jonathan
%A Keleher,P.
%K accumulator;
%K Bloom
%K computing;
%K filter;
%K mechanism;
%K network;
%K operation;
%K peer-to-peer
%K RSA
%K Security
%K security;
%K set
%K system-wide
%K Telecommunication
%K theory;
%K trust-preserving
%X We describe a method for performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer networks. We model search results and indexes as data sets. Such sets have value for answering a new query only if they are trusted. In the absence of any system-wide security mechanism, a data set is trusted by a node a only if it was generated by some node which is trusted by a. Our main contributions are a formal definition of the problem as well as an efficient scheme that solves this problem by allowing untrusted peers to perform set operations on trusted data sets while also producing unforgeable proofs of correctness. This is accomplished by requiring trusted nodes to sign appropriately-defined digests of generated sets; each such digest consists of an RSA accumulator and a Bloom filter. The scheme is general, and has other applications as well. We give an analysis demonstrating the low overhead of the scheme, and we include experimental data which confirm the analysis.
%B INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies
%V 4
%P 2231 - 2241 vol.4 - 2231 - 2241 vol.4
%8 2004/03//
%G eng
%R 10.1109/INFCOM.2004.1354646