Privacy-preserving set operations

DMCA

Privacy-preserving set operations (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Lea Kissner , Dawn Song

Venue:	in Advances in Cryptology - CRYPTO 2005, LNCS
Citations:	161 - 0 self

BibTeX

@INPROCEEDINGS{Kissner05privacy-preservingset,
    author = {Lea Kissner and Dawn Song},
    title = {Privacy-preserving set operations},
    booktitle = {in Advances in Cryptology - CRYPTO 2005, LNCS},
    year = {2005},
    pages = {241--257},
    publisher = {Springer}
}

OpenURL

Abstract

In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties ’ private input sets than what can be deduced from the result. In this paper, we propose efficient techniques for privacy-preserving operations on multisets. By employing the mathematical properties of polynomials, we build a framework of efficient, secure, and composable multiset operations: the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more efficient results than those of previous work.

Keyphrases

privacy-preserving set operation practical problem element reduction operation previous work distrustful party many important application efficient result party input private input multiset composable multiset operation privacy-preserving operation wide range private set privacy-preserving computation mathematical property private computation efficient technique party private input set

DMCA